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
ICSLP 1998
Conference paper
A TIME-SYNCHRONOUS, TREE-BASED SEARCH STRATEGY IN THE ACOUSTIC FAST MATCH OF AN ASYNCHRONOUS SPEECH RECOGNITION SYSTEM
Abstract
This paper describes the interaction between a synchronous fast match and an asynchronous detailed match search in an automatic speech recognition system. We show a considerable speed-up through this hybrid architecture over a fully-asynchronous approach and discuss the advantages of the hybrid system.