Robust speech recognition against packet loss

EUROSPEECH 2001 - SCANDINAVIA - 7th European Conference on Speech Communication and Technology

Volumn , Issue , 2001, Pages 1095-1098

  Siu, Manhung ^a   Chan, Yu Chung ^a  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

PACKET LOSS; PACKET NETWORKS; SPEECH; SPEECH COMMUNICATION; SPEECH TRANSMISSION; VITERBI ALGORITHM;

CONNECTED DIGITS; DATA LOSS; DIGIT RECOGNITION; MOST LIKELY; ROBUST APPROACHES; ROBUST SPEECH RECOGNITION; STATE SEQUENCES;

SPEECH RECOGNITION;

EID: 85009107903     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (3)

1. S. Young, J. J. Odell., D. Olasen, V. Valtchev, P. C. Woodland, The HTK Book(for HTK Version 2.2) 1999.
2. R. Lippmann and B. Carlson, Robust speech recognition with time-varying filtering interruptions and noise, Proceeding of the ASR workshop, 1997.
3. R. Schwartz and Y. L. Chow, The N-best algorithm: An efficient and exact procedure for finding the N most likely sentence hypotheses, IEEE ICASSP, pp. 81-84, Albuquerque, April 1990.