Minimum exact word error training

Proceedings of ASRU 2005: 2005 IEEE Automatic Speech Recognition and Understanding Workshop

Volumn 2005, Issue , 2005, Pages 186-190

  Heigold, G ^a   Macherey, W ^a   Schluter R ^a   Ney, H ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; ERROR ANALYSIS; OPTIMIZATION; PARAMETER ESTIMATION; TOPOLOGY; WORD PROCESSING;

EXACT WORD ERROR TRAINING; MINIMUM WORD ERROR (MWE) CRITERION; WORD LATTICE;

SPEECH RECOGNITION;

EID: 33846220725     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ASRU.2005.1566538     Document Type: Conference Paper

References (13)

1. P. C. Woodland and D. Povey, "Large Scale Discriminative Training of Hidden Markov Models for Speech Recognition," Computer Speech & Language, vol. 16, no. 1, pp. 25-48, 2002.
2. W. Macherey, L. Haferkamp, R. Schlüter, and H. Ney, "Investigations on Error Minimizing Training Criteria for Discriminative Training in Automatic Speech Recognition," in European Conference on Speech Communication and Technology (Interspeech), Lisbon, Portugal, Sept. 2005, pp. 2133-2136.
3. D. Povey and P. C. Woodland, "Minimum Phone Error and I-Smoothing for Improved Discriminative Training," in Proc. IEEE Int. Conf. on Acoustics, Speech and Signal Processing, vol. 1, Orlando, FL, May 2002, pp. 105-108.
4. D. Povey, "Discriminative Training for Large Vocabulary Speech Recognition," Ph.D. dissertation, Cambridge, England, 2004.
5. J. Kaiser, B. Horvat, and Z. Kacic, "A Novel Loss Function for the Overall Risk Criterion Based Discriminative Training of HMM Models," in Proc. Int. Conf. on Spoken Language Processing, vol. 2, Bejing, China, Oct. 2000, pp. 887-890.
6. V. Doumpiotis and W. Byrne, "Pinched Lattice Minimum Bayes Risk Discriminative Training for Large Vocabulary Continuous Speech Recognition," in Proc. Int. Conf. on Spoken Language Processing, Jeju Island, Korea, Oct. 2004, pp. 1717-1720.
7. M. Mohri, "Edit-Distance of Weighted Automata: General Definitions and Algorithms," International Journal of Foundations of Computer Science, vol. 14, no. 6, pp. 957 - 982, 2003.
8. V. I. Levenshtein, "Binary codes capable of correcting deletions, insertions, and reversals," Soviet Physics - Doklay, vol. 10, no. 10, pp. 707 - 710, 1966.
9. S. Kanthak and H. Ney, "FSA: An Efficient and Flexible C++ Toolkit for Finite State Automata Using On-Demand Computation," in Proc. of the Annual Meeting of the Association for Computational Linguistics, Barcelona, Spain, July 2004, pp.510-517.
10. E. S. Ristad and P. N. Yianilos, "Learning String Edit Distance," IEEE Transactions PAMI, vol. 20, no. 5, pp. 522-532, 1998.
11. C. Allauzen and M. Mohri, "Efficient Algorithms for Testing the Twins Property," Journal of Automata, Languages and Combinatorics, vol. 8, no. 2, 2003.
12. M. P. Schützenberger, "Sur une variante des fonctions séquentielles," Theoretical Computer Science, vol. 4, no. 1, pp. 47-57, 1977.
13. D. S. Pallett, J. G. Fiscus, W. M. Fisher, and J. S. Garofolo, "Benchmark Tests for the DARPA Spoken Language Program," in ARPA Human Language Technology Workshop, Princeton, NJ, March 1995, pp. 7-18.