Finite State Transducers Approximating Hidden Markov Models
| dc.creator | Kempe, Andre | |
| dc.date | 1997-07-17 | |
| dc.date.accessioned | 2026-07-07T09:10:54Z | |
| dc.date.available | 2026-07-07T09:10:54Z | |
| dc.description | This paper describes the conversion of a Hidden Markov Model into a sequential transducer that closely approximates the behavior of the stochastic model. This transformation 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 on six languages. | |
| dc.description | 8 pages, A4, LaTeX (+1x eps) | |
| dc.identifier | https://arxiv.org/abs/cmp-lg/9707006 | |
| dc.identifier | http://arxiv.org/abs/cmp-lg/9707006 | |
| dc.identifier | ACL'97, pp.460-467, Madrid, Spain. July 10, 1997 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/151494 | |
| dc.subject | Computation and Language | |
| dc.title | Finite State Transducers Approximating Hidden Markov Models | |
| dc.type | text |