DocumentCode
2769512
Title
Regularization, adaptation, and non-independent features improve hidden conditional random fields for phone classification
Author
Sung, Yun-hsuan ; Boulis, Constantinos ; Manning, Christopher ; Jurafsky, Dan
Author_Institution
Stanford Univ., Stanford
fYear
2007
fDate
9-13 Dec. 2007
Firstpage
347
Lastpage
352
Abstract
We show a number of improvements in the use of Hidden Conditional Random Fields (HCRFs) for phone classification on the TIMIT and Switchboard corpora. We first show that the use of regularization effectively prevents overfitting, improving over other methods such as early stopping. We then show that HCRFs are able to make use of non-independent features in phone classification, at least with small numbers of mixture components, while HMMs degrade due to their strong independence assumptions. Finally, we successfully apply Maximum a Posteriori adaptation to HCRFs, decreasing the phone classification error rate in the Switchboard corpus by around 1% -5% given only small amounts of adaptation data.
Keywords
hidden Markov models; maximum likelihood estimation; random processes; signal classification; speech recognition; Switchboard corpora; TIMIT corpora; hidden Markov model; hidden conditional random field; maximum a posteriori adaptation; maximum likelihood estimation; phone classification error rate; Acoustic testing; Automatic speech recognition; Degradation; Error analysis; Hidden Markov models; Maximum likelihood estimation; Maximum likelihood linear regression; Mel frequency cepstral coefficient; Speech recognition; Training data; Hidden Conditional Random Fields; Maximum a Posteriori; Phone Classification; Speech Recognition;
fLanguage
English
Publisher
ieee
Conference_Titel
Automatic Speech Recognition & Understanding, 2007. ASRU. IEEE Workshop on
Conference_Location
Kyoto
Print_ISBN
978-1-4244-1746-9
Electronic_ISBN
978-1-4244-1746-9
Type
conf
DOI
10.1109/ASRU.2007.4430136
Filename
4430136
Link To Document