Computer Science – Computation and Language
Scientific paper
1997-07-17
ACL'97, pp.460-467, Madrid, Spain. July 10, 1997
Computer Science
Computation and Language
8 pages, A4, LaTeX (+1x eps)
Scientific paper
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.
No associations
LandOfFree
Finite State Transducers Approximating Hidden Markov Models does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Finite State Transducers Approximating Hidden Markov Models, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Finite State Transducers Approximating Hidden Markov Models will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-265682