3 papers
cs.CL2001
Part-of-Speech Tagging with Two Sequential Transducers
Andre Kempe
We present a method of constructing and using a cascade consisting of a left- and a right-sequential finite-state transducer (FST), T1 and T2, for part-of-speech (POS) disambiguati…
cs.CL2000
Reduction of Intermediate Alphabets in Finite-State Transducer Cascades
Andre Kempe
This article describes an algorithm for reducing the intermediate alphabets in cascades of finite-state transducers (FSTs). Although the method modifies the component FSTs, there i…
cmp-lg1998
Look-Back and Look-Ahead in the Conversion of Hidden Markov Models into Finite State Transducers
Andre Kempe
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 transd…