About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
INTERSPEECH - Eurospeech 1995
Conference paper
Fast Match Based on Decision Tree
Abstract
In a large vocabulary speech recognition system using hidden Markov models, calculating the likelihood of an acoustic signal segment for all words in the vocabulary involves a large amount of computation. We describe in this paper a scheme to rapidly obtaining an approximate acoustic match for all words in the vocabulary in such a way as to ensure that the correct word is one of a small number of words examined in detail. Using a decision tree method we obtain a matching algorithm that is much faster than common acoustic likelihood computation on all the words. This method has been tested on isolated syllables.