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.
Conference paper
SPEED IMPROVEMENT OF THE TIME-ASYNCHRONOUS ACOUSTIC FAST MATCH
Abstract
This paper describes an algorithm for improvement of the speed of a time-asynchronous fast match, which is a part of a stack-search based recognition system. This fast match uses a phonetic tree to represent the entire vocabulary of the recognizer. Evaluation of the tree (in a depth-first manner), can be done much more efficiently using the fact that under certain conditions, the results of branch evaluations can be used to approximate the scores of other branches of the tree.