This paper describes the conversion of a Hidden Markov Model into a finite state transducer that closely approximates the behavior of the stochastic model. In some cases the transducer is equivalent to the HMM. This conversion is especially advantageous for part-of-speech tagging because the resulting transducer can be composed with other transducers that encode correction rules for the most frequent tagging errors. The speed of tagging is also improved. The described methods have been implemented and successfully tested.
CITATION STYLE
Kempe, A. (1998). Look-Back and Look-Ahead in the Conversion of Hidden Markov Models into Finite State Transducers. In Proceedings of the Joint Conference on New Methods in Language Processing and Computational Natural Language Learning, NeMLaP/CoNLL 1998 (pp. 29–37). Association for Computational Linguistics (ACL). https://doi.org/10.3115/1603899.1603907
Mendeley helps you to discover research relevant for your work.