REMAP-experiments with speech recognition

We present experimental and theoretical results using a framework for training and modeling continuous speech recognition systems based on the theoretically optimal maximum a posteriori (MAP) criterion. This is in contrast to most state-of-the-art systems which are trained according to a maximum likelihood (ML) criterion. Although the algorithm is quite general, we applied it to a particular form of hybrid system combining hidden Markov models (HMMs) and artificial neural networks (ANNs) in which the ANN targets and weights are iteratively reestimated to guarantee the increase of the posterior probability of the correct model, hence actually minimizing the error rate. More specifically, this training approach is applied to a transition-based model that uses local conditional transition probabilities (i.e. the posterior probability of the current state given the current acoustic vector and the previous state) to estimate the posterior probabilities of sentences. Experimental results on isolated and continuous speech recognition tasks show an increase in the estimates of posterior probabilities of the correct sentences after training, and significant decreases in error rates in comparison to a baseline system