Kimmo Koskenniemi
Kimmo Matti Koskenniemi (born September 7, 1945[1][2]) is the inventor of finite-state two-level models for computational phonology and morphology and a professor of Computational Linguistics at the University of Helsinki, Finland. In the early 1980s Koskenniemi's work became accessible by early adopters such as Lauri Karttunen, Ronald M. Kaplan and Martin Kay, first at the University of Texas Austin,[3] later at the Xerox Palo Alto Research Center.[4]
This application of finite-state transducers to phonology and morphology was initially implemented for Finnish, but it soon proved to be useful for other languages with complex morphology such as Basque.[5]
Bibliography
- Koskenniemi, Kimmo 1983: Two-level morphology : a general computational model for word-form recognition and production. Publications (Helsingin yliopisto. Yleisen kieliteteen laitos 11)
References
- ↑ Karlsson, Fred. "Kimmo Koskenniemi’s first 60 years" (PDF). Retrieved 2007-10-07.
- ↑ "Twenty-Five Years of Finite-State Morphology" (PDF). Stanford: CSLI Publications. 2007.
- ↑ "Texas Linguistic Forum 22, 1983".
- ↑ "A Compiler for Two-level Phonological Rules" (PDF). Stanford: Center for the Study of Language and Information. 1987.
- ↑ "Xuxen: A Spelling Checker/Corrector for Basque based in Two-Level Morphology". Povo Trento: Proceedings of NAACL-ANLP'92. 1992.
External links
- Koskenniemi’s page at the University of Helsinki
- Koskenniemi, Kimmo, Two-level Morphology: A General Computational Model for Word-Form Recognition and Production, Publications, No. 11, 160 pages, University of Helsinki, Department of General Linguistics (1983). (Available for personal use.)
- Xuxen, Kimmo Koskenniemi and FSMNLP2012 Acknowledgement of Koskeniemmi's work for its use in the creation of the morphological description of Basque and the construction of the spelling checker Xuxen. Blog of the Ixa Group.
This article is issued from Wikipedia - version of the Tuesday, March 31, 2015. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.