Computing the Most Probable String with a Probabilistic Finite State Machine

Computing the Most Probable String with a Probabilistic Finite State Machine Colin de la Higuera author Jose Oncina author 2013-07 text Proceedings of the 11th International Conference on Finite State Methods and Natural Language Processing Mark-Jan Nederhof editor Association for Computational Linguistics St Andrews, Scotland conference publication de-la-higuera-oncina-2013-computing https://aclanthology.org/W13-1801/ 2013-07 1 8