@inproceedings{e5887de4c943470c890b6e8eec61852e,
title = "PyFoma: a Python finite-state compiler module",
abstract = "We describe PyFoma, an open-source Python module for constructing weighted and unweighted finite-state transducers and automata from regular expressions, string rewriting rules, right-linear grammars, or low-level state/transition manipulation. A large variety of standard algorithms for working with finite-state machines is included, with a particular focus on the needs of linguistic and NLP applications. The data structures and code in the module are designed for legibility to allow for potential use in teaching the theory and algorithms associated with finite-state machines.",
author = "Mans Hulden and Michael Ginn and Miikka Silfverberg and Michael Hammond",
note = "Publisher Copyright: {\textcopyright} 2024 Association for Computational Linguistics.; 62nd Annual Meeting of the Association for Computational Linguistics, ACL 2024 ; Conference date: 11-08-2024 Through 16-08-2024",
year = "2024",
language = "English (US)",
series = "Proceedings of the Annual Meeting of the Association for Computational Linguistics",
publisher = "Association for Computational Linguistics (ACL)",
pages = "258--265",
editor = "Yixin Cao and Yang Feng and Deyi Xiong",
booktitle = "System Demonstrations",
}