TY - JOUR
T1 - Simultaneous recognition of words and prosody in the Boston University Radio Speech Corpus
AU - Hasegawa-Johnson, Mark
AU - Chen, Ken
AU - Cole, Jennifer
AU - Borys, Sarah
AU - Kim, Sung Suk
AU - Cohen, Aaron
AU - Zhang, Tong
AU - Choi, Jeung Yoon
AU - Kim, Heejin
AU - Yoon, Taejin
AU - Chavarria, Sandra
N1 - Funding Information:
Supported by NSF award number 0132900, and by a grant from the University of Illinois. Statements in this paper reflect the opinions and conclusions of the authors, and are not endorsed by the NSF or the University of Illinois.
PY - 2005/7
Y1 - 2005/7
N2 - This paper describes automatic speech recognition systems that satisfy two technological objectives. First, we seek to improve the automatic labeling of prosody, in order to aid future research in automatic speech understanding. Second, we seek to apply statistical speech recognition models of prosody for the purpose of reducing the word error rate of an automatic speech recognizer. The systems described in this paper are variants of a core dynamic Bayesian network model, in which the key hidden variables are the word, the prosodic tag sequence, and the prosody-dependent allophones. Statistical models of the interaction among words and prosodic tags are trained using the Boston University Radio Speech Corpus, a database annotated using the tones and break indices (ToBI) prosodic annotation system. This paper presents both theoretical and empirical results in support of the conclusion that a prosody-dependent speech recognizer-a recognizer that simultaneously computes the most-probable word labels and prosodic tags-can provide lower word recognition error rates than a standard prosody-independent speech recognizer in a multi-speaker speaker-dependent speech recognition task on radio speech.
AB - This paper describes automatic speech recognition systems that satisfy two technological objectives. First, we seek to improve the automatic labeling of prosody, in order to aid future research in automatic speech understanding. Second, we seek to apply statistical speech recognition models of prosody for the purpose of reducing the word error rate of an automatic speech recognizer. The systems described in this paper are variants of a core dynamic Bayesian network model, in which the key hidden variables are the word, the prosodic tag sequence, and the prosody-dependent allophones. Statistical models of the interaction among words and prosodic tags are trained using the Boston University Radio Speech Corpus, a database annotated using the tones and break indices (ToBI) prosodic annotation system. This paper presents both theoretical and empirical results in support of the conclusion that a prosody-dependent speech recognizer-a recognizer that simultaneously computes the most-probable word labels and prosodic tags-can provide lower word recognition error rates than a standard prosody-independent speech recognizer in a multi-speaker speaker-dependent speech recognition task on radio speech.
KW - Automatic speech recognition
KW - Prosody
UR - http://www.scopus.com/inward/record.url?scp=21844465704&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=21844465704&partnerID=8YFLogxK
U2 - 10.1016/j.specom.2005.01.009
DO - 10.1016/j.specom.2005.01.009
M3 - Article
AN - SCOPUS:21844465704
SN - 0167-6393
VL - 46
SP - 418
EP - 439
JO - Speech Communication
JF - Speech Communication
IS - 3-4
ER -