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
ICASSP 1994
Conference paper
A channel-bank-based phone detection strategy
Abstract
This paper presents a channel-bank bmed phone detection algorithm, that can be used tn greatly cut down the search space in the process of mapping a set of acoustic features to a phone sequence. The algorithm involves a low cost preprocessing, and relies on using local information (in time) about the acoiistic features, to predict whether or not a phone can exist,over a certain time interval; hence, it may be thought of as producing a short-list of possible phones at all times. and it is only necessary to search in this short list, rather than in the entire phone alphabet, for the correct phone. The technique was applied in the acoustic fast ma.tch of the IBM Speech Recognition System, and resulted in a significant reduction in the execution time of the fast match.