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 1986
Conference paper
AUTOMATIC SPEECH RECOGNITION VIA PSEUDO-INDEPENDENT MARGINAL MIXTURES.
Abstract
Statistical models (prototypes) for the multivariate probability distribution of vectors (frames) of speech parameters may be utilized in various ways. If the stream of vectors is passed directly to the decoder of a continuous parameter speech recognizer, then the prototypes are used by the decoder; if the recognizer has a time-synchronous labeling acoustic processor, then they are used for vector quantization (labeling) and the resulting label stream is passed to the decoder; other uses are possible as well. A method for constructing such prototypes is presented. Speech recognition experiments are described in which the prototypes were trained by iteratively interleaving steps of a K-MEANS-type algorithm for clustering and steps of an expectation and maximization algorithm for reestimation. Results are presented (using a labeling acoustic processor) having significantly fewer decoding errors than previous methods do.