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 2000
Conference paper
Maximal rank likelihood as an optimization function for speech recognition
Abstract
Research has shown that rank statistics derived from contextdependent state likelihood can provide robust speech recognition. In previous work, empirical distributions were used to characterize the rank statistics. We present parametric models of the state rank and the rank likelihood, and then based on them, present a new objective function, Maximal Rank Likelihood (MRL), for estimating parameters in a HMM based speech recognition system. The objective function optimizes the average logarithm of the rank likelihood of training/adaptation data. It is a discriminative based estimation process and hence makes the training criterion close to the decoding criterion. Three applications of MRL are discussed. First one is a Linear Discriminative Projection, which optimizes the objective function using all training data and projects feature vectors into a discriminative space with a reduced dimension. The second and third applications are a feature space transformation and a model space transformation, respectively, for adaptation. The transformations are optimized to maximize the rank likelihood of the adaptation data. The experimental results show that the MRL adaptation algorithms outperform the MLLR adaptation.