What HMMs Can Do

Authors:
Jeff A. Bilmes
Affiliations:
The author is with the Dept. of Electrical Engineering, the University of Washington, Seattle, Box 352500, Seattle WA, 98195--2500, U.S.A. E-mail: bilmes@ee.washington.edu
Venue:
IEICE - Transactions on Information and Systems
Year:
2006

Citing 0
Cited 6

Signing Exact English (SEE): Modeling and recognition

Pattern Recognition
Signing Exact English (SEE): Modeling and recognition

Pattern Recognition
Efficient duration and hierarchical modeling for human activity recognition

Artificial Intelligence
Speech recognition using augmented conditional random fields

IEEE Transactions on Audio, Speech, and Language Processing
Automatic identification of audio recordings based on statistical modeling

Signal Processing
Classification trees for time series

Pattern Recognition

Quantified Score

Hi-index	0.00

Visualization

Abstract

Since their inception almost fifty years ago, hidden Markov models (HMMs) have have become the predominant methodology for automatic speech recognition (ASR) systems---today, most state-of-the-art speech systems are HMM-based. There have been a number of ways to explain HMMs and to list their capabilities, each of these ways having both advantages and disadvantages. In an effort to better understand what HMMs can do, this tutorial article analyzes HMMs by exploring a definition of HMMs in terms of random variables and conditional independence assumptions. We prefer this definition as it allows us to reason more throughly about the capabilities of HMMs. In particular, it is possible to deduce that there are, in theory at least, no limitations to the class of probability distributions representable by HMMs. This paper concludes that, in search of a model to supersede the HMM (say for ASR), rather than trying to correct for HMM limitations in the general case, new models should be found based on their potential for better parsimony, computational requirements, and noise insensitivity.