Hidden conditional random fields for phone classification

182Citations
Citations of this article
104Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we show the novel application of hidden conditional random fields (HCRFs) - conditional random fields with hidden state sequences - for modeling speech. Hidden state sequences are critical for modeling the non-stationarity of speech signals. We show that HCRFs can easily be trained using the simple direct optimization technique of stochastic gradient descent. We present the results on the TIMIT phone classification task and show that HCRFs outperforms comparable ML and CML/MMI trained HMMs. In fact, HCRF results on this task are the best single classifier results known to us. We note that the HCRF framework is easily extensible to recognition since it is a state and label sequence modeling technique. We also note that HCRFs have the ability to handle complex features without any change in training procedure.

Cite

CITATION STYLE

APA

Gunawardana, A., Mahajan, M., Acero, A., & Platt, J. C. (2005). Hidden conditional random fields for phone classification. In 9th European Conference on Speech Communication and Technology (pp. 1117–1120). https://doi.org/10.21437/interspeech.2005-126

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free