The DOI matches its Crossref record.
Foma: a finite-state compiler and library
Open accessAbstract
Foma is a compiler, programming language, and C library for constructing finite-state automata and transducers for various uses. It has specific support for many natural language processing applications such as producing morphological and phonological analyzers. Foma is largely compatible with the Xerox/PARC finite-state toolkit. It also embraces Unicode fully and supports various different formats for specifying regular expressions: the Xerox/PARC format, a Perl-like format, and a mathematical format that takes advantage of the 'Mathematical Operators' Unicode block.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Plitt, M., & Masselot, F. (2010) · The Prague Bulletin of Mathematical Linguistics · doi:10.2478/v10108-010-0010-x · Cited by 265
Kuhn, R., Davis, F., Désilets, A., Joanis, E., Kazantseva, A., Knowles, R., Littell, P., Lothian, D., Pine, A., Running Wolf, C., et al. (2020) · Proceedings of the 28th International Conference on Computational Linguistics · doi:10.18653/v1/2020.coling-main.516 · Cited by 22
“Initially, WordWeaver was tightly coupled to the instance’s language model, specifically Foma (Hulden, 2009).”
Method
Metadata
- Authors
- Hulden, M.
- Venue
- Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics: Demonstrations Session on - EACL '09
- Published
- 2009
- Pages
- 29-32
- OpenAlex
- W2014611589
- Cited by
- 223
- References
- 0
- FWCI
- 8.70
- Type
- conference paper
- Language
- en
- Open access
- gold
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Foma: a finite-state compiler and library. https://app.cochat.ai/papers/10.3115/1609049.1609057
- The paper
- Hulden, M. (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 on - EACL '09. https://doi.org/10.3115/1609049.1609057
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.