Abstract
The present article describes fsm2, a software program which can be used interactively or as a script interpreter to manipulate weighted finite-state automata with around 100 different commands. fsm2 is based on FSM<2.0> – an efficient C++ template library to create and algebraically manipulate weighted automata. fsm2 is particularly well suited to create morphological analysers on the basis of weighted automata.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Beesley, K.R., Karttunen, L.: Finite State Morphology. CSLI, Stanford (2003)
Roark, B., Sproat, R.: Computational Approaches to Syntax and Morphology. Oxford University Press, Oxford (2007)
Kuich, W., Salomaa, A.: Semirings, Automata, Languages. EATCS Monographs on Theoretical Computer Science, vol. 5. Springer, Heidelberg (1986)
Mohri, M.: Semiring frameworks and algorithms for shortest-distance problems. Journal of Automata, Languages and Combinatorics 7(3), 321–350 (2002)
Geyken, A., Hanneforth, T.: TAGH: A complete morphology for german based on weighted finite-state automata. In: Yli-Jyrä, A., Karttunen, L., Karhumäki, J. (eds.) FSMNLP 2005. LNCS (LNAI), vol. 4002, pp. 55–66. Springer, Heidelberg (2006)
Jurafsky, D., Martin, J.H.: Speech and Language Processing. Prentice Hall Series in Artificial Intelligence. Prentice Hall, Upper Saddle River (2000)
Hanneforth, T.: Using ranked semirings for representing morphology automata. In: Mahlow, C., Piotrowski, M. (eds.) Proceedings of SFCM. Springer, Heidelberg (to appear)
Mohri, M.: Weighted automata algorithms. In: Droste, M., Kuich, W., Vogler, H. (eds.) Handbook of Weighted Automata. Springer, Heidelberg (2009)
Mohri, M.: Finite-state transducers in language and speech processing. Computational Linguistics 23(2), 269–311 (1997)
Schiller, A., Teufel, S., Stöckert, C., Thielen, C.: Guidelines für das Tagging deutscher Textcorpora mit STTS. Technical report, Institut fur maschinelle Sprachverarbeitung, Stuttgart (1999)
Schiller, A.: German compound analysis with fsc. In: Yli-Jyrä, A., Karttunen, L., Karhumäki, J. (eds.) FSMNLP 2005. LNCS (LNAI), vol. 4002, pp. 239–246. Springer, Heidelberg (2006)
Junczys-Dowmunt, M.: Influence of accurate compound noun splitting on bilingual vocabulary extraction. In: Storrer, A., Geyken, A., Siebert, A., Würzner, K.M. (eds.) Selected Papers from the 9th Conference on Natural Language Processing KONVENS 2008, Berlin, Mouton de Gruyter, pp. 91–104. Mouton de Gruyter, Berlin (2008)
Lindén, K., Pirinen, T.: Weighted finite-state morphological analysis of Finnish compounding with hfst-lexc. In: Jokinen, K., Bick, E. (eds.) NODALIDA 2009 Conference Proceedings, pp. 89–95 (2009)
Mohri, M., Pereira, F.C.N.: Dynamic compilation of weighted context-free grammars. In: Proceedings of ACL 1998, pp. 891–897 (1998)
Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley Series in Computer Science. Addison-Wesley Publishing Company, Reading (1979)
Amtrup, J.W.: Efficient finite state unification morphology. In: COLING 2004: Proceedings of the 20th international conference on Computational Linguistics, Morristown, NJ, USA, vol. 453. Association for Computational Linguistics (2004)
Katz, S.M.: Estimation of probabilities from sparse data for the language model component of a speech recognizer. IEEE Transactions on Acoustics, Speech and Signal Processing 35(3), 400–401 (1987)
Jelinek, F.: Statistical Methods for Speech Recognition. In: Language, Speech and Communication. MIT Press, Cambridge (1997)
Aho, A.V., Corasick, M.J.: Efficient string matching: An aid to bibliographic search. Communications of the Asscociation for Computing Machinery 18(6), 333–340 (1975)
Daciuk, J., Watson, B.W., Mihov, S., Watson, R.E.: Incremental construction of minimal acyclic finite-state automata. Computational Linguistics 26(1), 3–16 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hanneforth, T. (2009). fsm2 – A Scripting Language for Creating Weighted Finite-State Morphologies. In: Mahlow, C., Piotrowski, M. (eds) State of the Art in Computational Morphology. SFCM 2009. Communications in Computer and Information Science, vol 41. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04131-0_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-04131-0_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04130-3
Online ISBN: 978-3-642-04131-0
eBook Packages: Computer ScienceComputer Science (R0)