The Community for Technology Leaders
Green Image
<p>In the literature on automatic speech recognition, the popular hidden Markov models (HMMs), left-to-right hidden Markov models (LRHMMs), Markov source models (MSMs), and stochastic regular grammars (SRGs) are often proposed as equivalent models. However, no formal relations seem to have been established among these models to date. A study of these relations within the framework of formal language theory is presented. The main conclusion is that not all of these models are equivalent, except certain types of hidden Markov models with observation probability distribution in the transitions, and stochastic regular grammar.</p>
stochastic finite state networks; automatic speech recognition; formal language theory; hidden Markov models; observation probability distribution; stochastic regular grammar; formal languages; grammars; Markov processes; speech recognition; stochastic processes
F. Casacuberta, "Some Relations Among Stochastic Finite State Networks Used in Automatic Speech Recognition", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 12, no. , pp. 691-695, July 1990, doi:10.1109/34.56212
94 ms
(Ver 3.3 (11022016))