Finite State Transducers Approximating Hidden Markov Models
نویسنده
چکیده
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.
منابع مشابه
P − 20 01 Speech - to - Speech Translation Based on Finite - State Transducers
Nowadays, the most successful speech recognition systems are based on stochastic finite-state networks (hidden Markov models and n-grams). Speech translation can be accomplished in a similar way as speech recognition. Stochastic finite-state transducers, which are specific stochastic finitestate networks, have proved very adequate for translation modeling. In this work a speech-to-speech transl...
متن کاملLook-Back and Look-Ahead in the Conversion of Hidden Markov Models into Finite State Transducers
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 partof-speech tagging because the resulting transducer can be composed with other transducers that encode correction rules for the most fre...
متن کاملLecture 8: Speech Recognition Using Finite State Transducers
In order to use HTK-trained speech recognition models with the AT&T speech recognition search engine, three types of conversion are necessary. First, you must convert the HTK-format hidden Markov models into ATT format acoustic models. Second, you’ll need to write finite state transducers for the language model, dictionary, and context dependency transducer. Third, acoustic feature files need t...
متن کاملHidden semi-Markov Model based earthquake classification system using Weighted Finite-State Transducers
Automatic earthquake detection and classification is required for efficient analysis of large seismic datasets. Such techniques are particularly important now because access to measures of ground motion is nearly unlimited and the target waveforms (earthquakes) are often hard to detect and classify. Here, we propose to use models from speech synthesis which extend the double stochastic models f...
متن کاملSome approaches to statistical and finite-state speech-to-speech translation
Speech-input translation can be properly approached as a pattern recognition problem by means of statistical alignment models and stochastic finite-state transducers. Under this general framework, some specific models are presented. One of the features of such models is their capability of automatically learning from training examples. Moreover, the stochastic finite-state transducers permit an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997