Statistical Methods for Speech Recognition
Journal of the American Statistical Association1999Vol. 94(446), pp. 650–650
Citations Over TimeTop 1% of 1999 papers
Abstract
The speech recognition problem hidden Markov models the acoustic model basic language modelling the Viterbi search hypothesis search on a tree and the fast match elements of information theory the complexity of tasks - the quality of language models the expectation - maximization algorithm and its consequences decision trees and tree language models phonetics from orthography - spelling-to-base from mappings triphones and allophones maximum entropy probability estimation and language models three applications of maximum entropy estimation to language modelling estimation of probabilities from counts and the Back-Off method.
Related Papers
- → The Expectation-Maximization Viterbi Algorithm for Blind Adaptive Channel Equalization(2005)26 cited
- → Reduction of Maximum Entropy Models to Hidden Markov Models(2012)1 cited
- → The Viterbi Algorithm for Models of Hidden Markov Processes with the Unknown Moment of Appearance of Parameter Jump(2005)1 cited
- Research on Information Extraction Based on Second-Order HMM(2011)