DocumentCode
1092466
Title
Continuous speech recognition by connectionist statistical methods
Author
Bourlard, Hervé ; Morgan, Nelson
Author_Institution
Int. Comput. Sci. Inst., Berkeley, CA, USA
Volume
4
Issue
6
fYear
1993
fDate
11/1/1993 12:00:00 AM
Firstpage
893
Lastpage
909
Abstract
Over the period of 1987-1991, a series of theoretical and experimental results have suggested that multilayer perceptrons (MLP) are an effective family of algorithms for the smooth estimation of high-dimension probability density functions that are useful in continuous speech recognition. The early form of this work has focused on hidden Markov models (HMM) that are independent of phonetic context. More recently, the theory has been extended to context-dependent models. The authors review the basic principles of their hybrid HMM/MLP approach and describe a series of improvements that are analogous to the system modifications instituted for the leading conventional HMM systems over the last few years. Some of these methods directly trade off computational complexity for reduced requirements of memory and memory bandwidth. Results are presented on the widely used Resource Management speech database that has been distributed by the US National Institute of Standards and Technology
Keywords
feedforward neural nets; hidden Markov models; speech recognition; HMM; MLP; NIST; computational complexity; connectionist statistical methods; continuous speech recognition; hidden Markov models; high-dimension probability density functions; memory bandwidth; memory requirements; multilayer perceptrons; smooth estimation; Bandwidth; Computational complexity; Context modeling; Distributed databases; Hidden Markov models; Multilayer perceptrons; Probability density function; Resource management; Speech recognition; Statistical analysis;
fLanguage
English
Journal_Title
Neural Networks, IEEE Transactions on
Publisher
ieee
ISSN
1045-9227
Type
jour
DOI
10.1109/72.286885
Filename
286885
Link To Document