User:Francis Tyers/FST
Finite-state morphological analysis is the use of finite-state approaches to the problem of computational analysis of the morphology of natural languages.
History[edit]
Theoretical overview[edit]
Determinism[edit]
Subsequential and -Subsequential transducers[edit]
A subsequential finite-state transducer is a finite-state transducer which can have an extra string outputted at final states.[1] A typical subsequential transducer only allows one extra string to be outputted, this is a problem when dealing with natural languages which contain ambiguity.
Approaches[edit]
Two-level morphology[edit]
Rewrite-rule cascade[edit]
Issues[edit]
Non-concatenative morphology[edit]
Tokenisation[edit]
- Pre-tokenisation
- Tokenise as you analyse
Existing implementations[edit]
See also[edit]
Notes[edit]
- ^ Mohri, M. (1997)
References[edit]
- Beesley, L. R. and Karttunen, L. (2003) Finite State Morphology (CLSI : Stanford)
- Beesley, K. R. (2004) "Downtranslation of XML Dictionaries to lexc LEXICONs Third Draft"
- Carrasco, R. C. and Forcada, M. L. (2002) "Incremental construction and maintenance of minimal finite-state automata". Computational Linguistics, 28:2, 207-216
- Garrido-Alenda, A. and Forcada, M. L. (2002) "Comparing nondeterministic and quasideterministic finite-state transducers built from morphological dictionaries". Procesamiento del Lenguaje Natural, (XVIII Congreso de la Sociedad Española de Procesamiento del Lenguaje Natural, Valladolid, Spain, 11-13.09.2002)
- Garrido-Alenda, A., Forcada, M. L., and Carrasco, R. C. (2002) "Incremental construction and maintenance of morphological analysers based on augmented letter transducers". Proceedings of TMI 2002 (Theoretical and Methodological Issues in Machine Translation, Keihanna/Kyoto, Japan, March 2002) p. 53--62
- Garrido, A., Iturraspe, A., Montserrat, S., Pastor, H., and Forcada, M. L. (1999) "A compiler for morphological analysers and generators based on finite-state transducers"
- Johnson, C. D. (1972) Formal aspects of phonological description (Mouton : The Hague)
- Kaplan, R. M. and Kay, M. (1981), "Phonological rules and finite-state transducers", Linguistic Society of America Meeting Handbook Fifty-sixth Annual Meeting, Dec. 1981
- Karttunen, L. "Applications of Finite-State Transducers in Natural-Language Processing"
- Karttunen, L. and Beesley, K. R. (2005) "Twenty-five years of finite-state morphology". Inquiries into Words, Constraints and Contexts, pp. 71--83.
- Koskenniemi, K. (1984) "Two-level morphology: A general computational model for word form and recognition". Proceedings of the 22nd annual meeting on Association for Computational Linguistics, pp. 178--181
- Mohri, M. (1997) "Finite-State Transducers in Language and Speech Processing". Computational Linguistics 23(2) pp. 269–311.
- Ortiz-Rojas, S., Forcada, M. L., and Ramírez-Sánchez, G. (2005) "Construcción y minimizacion eficiente de transductores de letras a partir de diccionarios con paradigmas". Procesamiento del Lenguaje Natural, 35, pp. 51–57.