FSA: An Efficient and Flexible C++ Toolkit for Finite State Automata Using On-Demand Computation

Stephan Kanthak, Hermann Ney


Anthology ID:
P04-1065
Volume:
Proceedings of the 42nd Annual Meeting of the Association for Computational Linguistics (ACL-04)
Month:
July
Year:
2004
Address:
Barcelona, Spain
Venue:
ACL
SIG:
Publisher:
Note:
Pages:
510–517
Language:
URL:
https://aclanthology.org/P04-1065
DOI:
10.3115/1218955.1219020
Bibkey:
Cite (ACL):
Stephan Kanthak and Hermann Ney. 2004. FSA: An Efficient and Flexible C++ Toolkit for Finite State Automata Using On-Demand Computation. In Proceedings of the 42nd Annual Meeting of the Association for Computational Linguistics (ACL-04), pages 510–517, Barcelona, Spain.
Cite (Informal):
FSA: An Efficient and Flexible C++ Toolkit for Finite State Automata Using On-Demand Computation (Kanthak & Ney, ACL 2004)
Copy Citation:
PDF:
https://preview.aclanthology.org/emnlp22-frontmatter/P04-1065.pdf