Look-Back and Look-Ahead in the Conversion of Hidden Markov Models into Finite State Transducers
| dc.creator | Kempe, Andre | |
| dc.date | 1998-02-02 | |
| dc.date.accessioned | 2026-07-07T02:36:12Z | |
| dc.date.available | 2026-07-07T02:36:12Z | |
| dc.description | 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. | |
| dc.description | 9 pages, A4, LaTeX (+4x eps) gzip tar gzip uuencode | |
| dc.identifier | https://arxiv.org/abs/cmp-lg/9802001 | |
| dc.identifier | http://arxiv.org/abs/cmp-lg/9802001 | |
| dc.identifier | NeMLaP3/CoNLL'98, pp.29-37, Sydney, Australia. January 15-17, 1998 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/15827 | |
| dc.subject | Computation and Language | |
| dc.title | Look-Back and Look-Ahead in the Conversion of Hidden Markov Models into Finite State Transducers | |
| dc.type | text |