Abstract
We propose a class of complex weight structures called ranked semirings for the compact representation of morphological analysers based on weighted finite-state automata. In an experiment, we compare this compact representation with the conventional representation based on letter transducers.
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.
References
Koskenniemi, K.: Two-level morphology: A general computational model for word-form recognition and production. In: Proceedings of COLING 1984, Stanford University, California, pp. 178–181 (1984)
Mohri, M.: Finite-state transducers in language and speech processing. Computational Linguistics 23, 269–311 (1997)
Mohri, M.: Minimization algorithms for sequential transducers. Theoretical Computer Science 234, 177–201 (2000)
Kuich, W., Salomaa, A.: Semirings, Automata, Languages. EATCS Monographs on Theoretical Computer Science, vol. 5. Springer, Heidelberg (1986)
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)
Mohri, M.: Semiring Frameworks and Algorithms for Shortest-Distance Problems. Journal of Automata, Languages and Combinatorics 7, 321–350 (2002)
Volk, M.: Choosing the right lemma when analysing german nouns. In: Multilinguale Corpora: Codierung, Strukturierung, Analyse. 11. Jahrestagung der GLDV. Frankfurt, pp. 304–310 (1999)
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)
Geyken, A., Schrader, N.: LexikoNet, a lexical database based on role and type hierarchies. In: Proceedings of LREC (2006)
Hanneforth, T.: FSM<> 2.0 – C++ library for manipulating (weighted) finite automata (2004), http://www.ling.uni-potsdam.de/fsm
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). Using Ranked Semirings for Representing Morphology Automata. 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_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-04131-0_1
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)