Compiling Regular Formalisms with Rule Features into Finite-State Automata

Anthology ID:: P97-1042
Volume:: 35th Annual Meeting of the Association for Computational Linguistics and 8th Conference of the European Chapter of the Association for Computational Linguistics
Month:: July
Year:: 1997
Address:: Madrid, Spain
Venues:: ACL | EACL
SIG:
Publisher:: Association for Computational Linguistics
Note:
Pages:: 329–336
Language:
URL:: https://preview.aclanthology.org/add_missing_videos/P97-1042/
DOI:: 10.3115/976909.979659
Bibkey:
Cite (ACL):: George Anton Kiraz. 1997. Compiling Regular Formalisms with Rule Features into Finite-State Automata. In 35th Annual Meeting of the Association for Computational Linguistics and 8th Conference of the European Chapter of the Association for Computational Linguistics, pages 329–336, Madrid, Spain. Association for Computational Linguistics.
Cite (Informal):: Compiling Regular Formalisms with Rule Features into Finite-State Automata (Kiraz, ACL-EACL 1997)
Copy Citation:
PDF:: https://preview.aclanthology.org/add_missing_videos/P97-1042.pdf