REMAP - Recursive Estimation and Maximization of A Posteriori Probabilities

REMAP is an approach for Recursively Estimating and Maximizing A Posteriori probabilities of transition-based hidden Markov models given input sequences.

Although very general, the method is developed in the context of a statistical model for transition-based speech recognition using Artificial Neural Networks (ANN) to generate probabilities for Hidden Markov Models (HMMs). In the new approach, we use local conditional posterior probabilities of transitions to maximize global posterior probabilities of word sequences. Although we still use ANNs to estimate posterior probabilities, the network is trained with targets that are themselves estimates of local posterior probabilities that are recursively estimated to guarantee a monotonic increase of global posteriors up to a (local) maximum. Initial experimental results support the theory by showing an increase in the estimates of posterior probabilities of the correct sentences after REMAP iterations, and statistically significant decrease in error rates for independent test sets.

Remap is a result of ongoing collaboration between Yochai Konig, Hervé Bourlard, and Nelson Morgan, and is developed at the speech group that is a part of the Realization Group at the International Computer Science Institute.

Papers


Yochai Konig - 29th, August 1995