Colin de la Higuera, José Oncina. Computing the Most Probable String with a Probabilistic Finite State Machine. In Mark-Jan Nederhof, editor, Proceedings of the 11th International Conference on Finite State Methods and Natural Language Processing, FSMNLP 2013, St. Andrews, Scotland, UK, July 15-17, 2013. pages 1-8, The Association for Computer Linguistics, 2013. [doi]
@inproceedings{HigueraO13,
title = {Computing the Most Probable String with a Probabilistic Finite State Machine},
author = {Colin de la Higuera and José Oncina},
year = {2013},
url = {http://aclweb.org/anthology/W/W13/W13-1801.pdf},
researchr = {https://researchr.org/publication/HigueraO13},
cites = {0},
citedby = {0},
pages = {1-8},
booktitle = {Proceedings of the 11th International Conference on Finite State Methods and Natural Language Processing, FSMNLP 2013, St. Andrews, Scotland, UK, July 15-17, 2013},
editor = {Mark-Jan Nederhof},
publisher = {The Association for Computer Linguistics},
}