Computing the Most Probable String with a Probabilistic Finite State Machine

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]

Abstract

Abstract is missing.