A channel-bank-based phone detection strategy

This paper presents a channel-bank based phone detection algorithm, that can be used in 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 acoustic 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 match of the IBM speech recognition system, and resulted in a significant reduction in the execution time of the fast match