Computing the Most Probable String with a Probabilistic Finite State Machine

Colin de la Higuera, Jose Oncina


Anthology ID:
W13-1801
Volume:
Proceedings of the 11th International Conference on Finite State Methods and Natural Language Processing
Month:
July
Year:
2013
Address:
St Andrews, Scotland
Venues:
FSMNLP | WS
SIG:
SIGFSM
Publisher:
Association for Computational Linguistics
Note:
Pages:
1–8
Language:
URL:
https://aclanthology.org/W13-1801
DOI:
Bibkey:
Cite (ACL):
Colin de la Higuera and Jose Oncina. 2013. Computing the Most Probable String with a Probabilistic Finite State Machine. In Proceedings of the 11th International Conference on Finite State Methods and Natural Language Processing, pages 1–8, St Andrews, Scotland. Association for Computational Linguistics.
Cite (Informal):
Computing the Most Probable String with a Probabilistic Finite State Machine (de la Higuera & Oncina, 2013)
Copy Citation:
PDF:
https://aclanthology.org/W13-1801.pdf