Evaluating the performance of connected-word speech recognition systems

Outputs of connected-word recognizers may contain substitution, deletion and insertion errors, and their interpretation is not trivial. Simulations show that the commonly used dynamic programming word-sequence matching algorithm has serious shortcomings as an evaluation method at low performance levels, though it is generally reliable at high performance levels. The strategy of comparing input and output words in strict sequence is found to have little to recommend it. A method using word end-point information, which provides precise, detailed performance analyses, is described. Tests with real data confirm the reliability of the end-point method and the presence of positive bias in performance estimates form the word-sequence matching method.<<ETX>>

[1]  Michael D. Brown,et al.  An algorithm for connected word recognition , 1982, ICASSP.

[2]  David Sankoff,et al.  Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison , 1983 .

[3]  M. Bush,et al.  Network-based connected digit recognition using vector quantization , 1985, ICASSP '85. IEEE International Conference on Acoustics, Speech, and Signal Processing.

[4]  M. Hunt,et al.  Speaker dependent and independent speech recognition experiments with an auditory model , 1988, ICASSP-88., International Conference on Acoustics, Speech, and Signal Processing.