5th International Conference on Spoken Language Processing

Sydney, Australia
November 30 - December 4, 1998

A Minimax Search Algorithm for CDHMM based Robust Continuous Speech Recognition

Hui Jiang (1), Keikichi Hirose (1), Qiang Huo (2)

(1) The University of Tokyo, Japan
(2) The University of Hong Kong, China

In this paper, we propose a novel implementation of a minimax decision rule for continuous density hidden Markov model based robust speech recognition. By combining the idea of the minimax decision rule with a normal Viterbi search, we derive a recursive minimax search algorithm, where the minimax decision rule is repetitively applied to determine the partial paths during the search procedure. Because of its intrinsic nature of a recursive search, the proposed method can be easily extended to perform continuous speech recognition. Experimental results on Japanese isolated digits and TIDIGITS, where the mismatch between training and testing conditions is caused by additive white Gaussian noise, show the viability and efficiency of the proposed minimax search algorithm.

Full Paper

Bibliographic reference.  Jiang, Hui / Hirose, Keikichi / Huo, Qiang (1998): "A minimax search algorithm for CDHMM based robust continuous speech recognition", In ICSLP-1998, paper 0693.