HFST tools for morphology - An efficient open-source package for construction of morphological analyzers

Communications in Computer and Information Science

Volumn 41 CCIS, Issue , 2009, Pages 28-47

  Lindén, Krister ^a   Silfverberg, Miikka ^a   Pirinen, Tommi ^a  

^a UNIVERSITY OF HELSINKI   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

COMMERCIAL TOOLS; COMPUTATIONAL MORPHOLOGY; FINITE STATE TRANSDUCERS; FINITE-STATE MORPHOLOGY; LANGUAGE DESCRIPTION; MORPHOLOGICAL ANALYSIS; MORPHOLOGICAL ANALYZER; MORPHOLOGICAL DESCRIPTION; OPEN SOURCE TOOLS; OPEN-SOURCE; PARALLEL RULE APPLICATIONS; RULE APPLICATION;

MORPHOLOGY;

EID: 78049356517     PISSN: 18650929     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-3-642-04131-0_3     Document Type: Conference Paper

References (11)

1. Koskenniemi, K.: Two-Level Morphology: A General Computational Model for Word-Form Recognition and Production. University of Helsinki, Department of General Linguistics (1983)
2. Karttunen, L., Koskenniemi, K., Kaplan, R.: A Compiler for Two-Level Phonological Rules. CSLI Publications (1987), http://www2.parc.com/istl/members/ karttune/publications/archive/twolcomp.pdf
3. Karttunen, L.: Two-Level Rule Compiler, Technical Report ISTL-92-2, Xerox Palo Alto Research Center (1992), http://www.xrce.xerox.com/competencies/ content-analysis/fssoft/docs/twolc-92/twolc92.html
4. Karttunen, L.: Finite-State Lexicon Compiler. Technical Report, ISTL-NLTT2993-04-02, Xerox Palo Alto Research Center, Palo Alto, California (1993)
5. Karttunen, L.: Constructing Lexical Transducers. In: The Proceedings of the 15th International Conference on Computational Linguistics COLING 1994, I, pp. 406-411 (1994)
6. Beesley, K., Karttunen, L.: Finite State Morphology. CSLI Publications, Stanford (2003), http://www.fsmbook.com
7. Schmid, H.: A programming language for finite state transducers. In: Yli-Jyrä, A., Karttunen, L., Karhumäki, J. (eds.) FSMNLP 2005. LNCS (LNAI), vol. 4002, pp. 308-309. Springer, Heidelberg (2006)
8. Lombardy, S., Régis-Gianas, Y., Sakharovitch, J.: Introducing Vaucanson. Theoretical Computer Science 328, 77-96 (2004)
9. Allauzen, C., Riley, M., Schalkwyk, J., Skut,W., Mohri, M.: OpenFst: A general and efficient weighted finite-state transducer library. In: Holub, J., Žd'árek, J. (eds.) CIAA 2007. LNCS, vol. 4783, pp. 11-23. Springer, Heidelberg (2007), http://www.openfst.org
10. Yli-Jyrä, A., Koskenniemi, K.: Compiling Generalized Two-Level Rules and Grammars. In: Salakoski, T., Ginter, F., Pyysalo, S., Pahikkala, T. (eds.) FinTAL 2006. LNCS (LNAI), vol. 4139, pp. 174-185. Springer, Heidelberg (2006)
11. Pirinen, T.: Suomen kielen äärellistilainen automaattinen morfologia avoimen lähdekoodin menetelmin. Master's thesis, Helsingin yliopisto (2008)