Search algorithm that merges candidates in meaning level for very large vocabulary spontaneous speech recognition

The paper describes an efficient search algorithm for spontaneous speech recognition. This algorithm merges candidates that have the same meaning in beam search. To do this effectively, the authors change their phoneme-synchronous search algorithm into a quasi-frame-synchronous one. The algorithm is evaluated using a telephone directory assistance task containing more than 70000 subscriber names. The average sentence understanding rate for eight speakers is improved from 58% to 65% by merging candidates at the meaning level.<<ETX>>

[1]  Douglas D. O'Shaughnessy,et al.  Experiments in continuous speech recognition with a 60, 000 word vocabulary , 1992, ICSLP.

[2]  David S. Pallett.  DARPA February 1992 Pilot Corpus CSR "Dry Run" Benchmark Test Results , 1992, HLT.

[3]  Kenji Kita,et al.  HMM continuous speech recognition using predictive LR parsing , 1989, International Conference on Acoustics, Speech, and Signal Processing,.

[4]  Masaru Tomita,et al.  Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems , 1985 .

[5]  H. Ney,et al.  Improvements in beam search for 10000-word continuous speech recognition , 1992, [Proceedings] ICASSP-92: 1992 IEEE International Conference on Acoustics, Speech, and Signal Processing.