Foma: A finite-state compiler and library

EACL 2009 - 12th Conference of the European Chapter of the Association for Computational Linguistics, Proceedings

Volumn , Issue , 2009, Pages 29-32

  Hulden, Mans ^a  

^a UNIVERSITY OF ARIZONA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FINITE-STATE; FINITE-STATE AUTOMATA; FINITE-STATE COMPILERS; NATURAL LANGUAGE PROCESSING APPLICATIONS; REGULAR EXPRESSIONS; UNICODES;

AUTOMATA THEORY; COMPUTATIONAL LINGUISTICS; MATHEMATICAL OPERATORS; NATURAL LANGUAGE PROCESSING SYSTEMS; PATTERN MATCHING;

PROGRAM COMPILERS;

EID: 77955453307     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (6)

1. Beesley, K. and Karttunen, L. (2003). Finite-State Morphology. CSLI, Stanford.
2. Hulden, M. (2008). Regular expressions and predicate logic in finite-state language processing. In Piskorski, J., Watson, B., and Yli-Jyrä, A., editors, Proceedings of FSMNLP 2008.
3. Karttunen, L., Koskenniemi, K., and Kaplan, R. M. (1987). A compiler for two-level phonological rules. In Dalrymple, M., Kaplan, R., Karttunen, L., Koskenniemi, K., Shaio, S., and Wescoat, M., editors, Tools for Morphological Analysis. CSLI, Palo Alto, CA.
4. Mohri, M., Pereira, F., Riley, M., and Allauzen, C. (1997). AT & T FSM Library-Finite State Machine Library. AT & T Labs-Research.
5. Schmid, H. (2005). A programming language for finite-state transducers. In Yli-Jyrä, A., Karttunen, L., and Karhumäki, J., editors, Finite-State Methods and Natural Language Processing FSMNLP 2005.
6. Sproat, R. (2003). Lextools: a toolkit for finite-state linguistic analysis. AT & T Labs-Research.