|Initial release||2010, 2–3 years ago|
|Stable release||0.9.16alpha / December 13, 2011|
|Type||Finite State Toolkit|
Foma is a free and open source finite-state toolkit created and maintained by Mans Hulden. It includes a compiler, programming language, and C library for constructing finite-state automata and transducers (FST's) for various uses, most typically Natural Language Processing uses such as morphological analysis.
Foma can replace the proprietary Xerox Finite State Toolkit for compiling and running FST's written in the lexc and xfst formalisms. The speed is comparable with the Xerox tools for most lexicons, although foma can be 3 or 4 times slower for very large lexicons (e.g. >100,000 words). Foma is also one of the possible backends of the free and open source Helsinki Finite State Toolkit (where other backends provide support for further formalisms).
- HFST - The Helsinki Finite State Toolkit
- SFST - The Stuttgart Finite State Toolkit (an HFST backend)
- OpenFST (an HFST backend supporting weighted FST's)
- XFST - The Xerox Finite State Toolkit
- http://foma.googlecode.com/ - official homepage
- http://wiki.apertium.org/wiki/Foma - foma information on the Apertium wiki
- http://www.ling.helsinki.fi/kieliteknologia/tutkimus/hfst/ - HFST home page
- Hulden, Mans (2009), Foma: a finite-state compiler and library, "Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics: Demonstrations Session", Association for Computational Linguistics: 29–32
|This programming tool–related article is a stub. You can help Wikipedia by expanding it.|