Active learning: theory and applications to automatic speech recognition

作者: G. Riccardi , D. Hakkani-Tur

DOI: 10.1109/TSA.2005.848882

关键词:

摘要: We are interested in the problem of adaptive learning context automatic speech recognition (ASR). In this paper, we propose an active algorithm for ASR. Automatic systems trained using human supervision to provide transcriptions utterances. The goal Active Learning is minimize training acoustic and language models maximize performance given transcribed untranscribed data. aims at reducing number examples be labeled by automatically processing unlabeled examples, then selecting most informative ones with respect a cost function label. paper describe how estimate confidence score each utterance through on-line lattice output recognizer. scores filtered informativeness optimal subset samples selected. has been applied both batch scheme have experimented different selective sampling algorithms. Our experiments show that amount data needed word accuracy can reduced more than 60% random sampling.

参考文章(31)
Daniele Falavigna, Roberto Gretter, Giuseppe Riccardi, Acoustic and word lattice based algorithms for confidence scores. conference of the international speech communication association. ,(2002)
M. Federico, Bayesian estimation methods for n-gram language model adaptation international conference on spoken language processing. ,vol. 1, pp. 240- 243 ,(1996) , 10.1109/ICSLP.1996.607087
Renato De Mori, Spoken Dialogues with Computers ,(1998)
Alexander I. Rudnicky, Rong Zhang, Word Level Confidence Annotation using Combinations of Features conference of the international speech communication association. pp. 2105- 2108 ,(2001)
David D. Lewis, Jason Catlett, Heterogeneous Uncertainty Sampling for Supervised Learning Machine Learning Proceedings 1994. pp. 148- 156 ,(1994) , 10.1016/B978-1-55860-335-6.50026-X
Dilek Z. Hakkani-Tür, Giuseppe Riccardi, Active and unsupervised learning for automatic speech recognition. conference of the international speech communication association. ,(2003)
John D. Lafferty, Guy Lebanon, Cranking: Combining Rankings Using Conditional Probability Models on Permutations international conference on machine learning. pp. 363- 370 ,(2002)
Ido Dagan, Sean P. Engelson, Committee-Based Sampling For Training Probabilistic Classifiers Machine Learning Proceedings 1995. pp. 150- 157 ,(1995) , 10.1016/B978-1-55860-377-6.50027-X