DocumentCode
2800613
Title
Phone recognition using Restricted Boltzmann Machines
Author
Mohamed, Abdel-rahman ; Hinton, Geoffrey
Author_Institution
Dept. of Comput. Sci., Univ. of Toronto, Toronto, ON, Canada
fYear
2010
fDate
14-19 March 2010
Firstpage
4354
Lastpage
4357
Abstract
For decades, Hidden Markov Models (HMMs) have been the state-of-the-art technique for acoustic modeling despite their unrealistic independence assumptions and the very limited representational capacity of their hidden states. Conditional Restricted Boltzmann Machines (CRBMs) have recently proved to be very effective for modeling motion capture sequences and this paper investigates the application of this more powerful type of generative model to acoustic modeling. On the standard TIMIT corpus, one type of CRBM outperforms HMMs and is comparable with the best other methods, achieving a phone error rate (PER) of 26.7% on the TIMIT core test set.
Keywords
Boltzmann machines; acoustic signal processing; hidden Markov models; speech processing; speech recognition; acoustic modeling; automatic speech recognition; conditional restricted Boltzmann machine; hidden Markov model; phone error rate; Acoustic applications; Acoustic testing; Automatic speech recognition; Bipartite graph; Computer science; Error analysis; Hidden Markov models; Power generation; Smoothing methods; Stochastic processes; distributed representations; phone recognition; restricted Boltzmann machines;
fLanguage
English
Publisher
ieee
Conference_Titel
Acoustics Speech and Signal Processing (ICASSP), 2010 IEEE International Conference on
Conference_Location
Dallas, TX
ISSN
1520-6149
Print_ISBN
978-1-4244-4295-9
Electronic_ISBN
1520-6149
Type
conf
DOI
10.1109/ICASSP.2010.5495651
Filename
5495651
Link To Document