A Practical Algorithm for Intersecting Weighted Context-free Grammars with Finite-State Automata

Thomas Hanneforth


Anthology ID:
W11-4408
Volume:
Proceedings of the 9th International Workshop on Finite State Methods and Natural Language Processing
Month:
July
Year:
2011
Address:
Blois, France
Venues:
FSMNLP | WS
SIG:
SIGFSM
Publisher:
Association for Computational Linguistics
Note:
Pages:
57–64
Language:
URL:
https://aclanthology.org/W11-4408
DOI:
Bibkey:
Cite (ACL):
Thomas Hanneforth. 2011. A Practical Algorithm for Intersecting Weighted Context-free Grammars with Finite-State Automata. In Proceedings of the 9th International Workshop on Finite State Methods and Natural Language Processing, pages 57–64, Blois, France. Association for Computational Linguistics.
Cite (Informal):
A Practical Algorithm for Intersecting Weighted Context-free Grammars with Finite-State Automata (Hanneforth, 2011)
Copy Citation:
PDF:
https://aclanthology.org/W11-4408.pdf