摘要: We introduce a discriminative training algorithm for the estimation of hidden Markov model (HMM) parameters. This is based on an approximation maximum mutual information (MMI) objective function and its maximization in technique similar to expectation-maximization (EM) algorithm. The implemented by simple modification standard Baum-Welch algorithm, can be applied speech recognition as well word-spotting systems. Three tasks were tested: isolated digit noisy environment, connected environment word-spotting. In all significant improvement over likelihood (ML) was observed. also compared new commonly used extended MMI our tests showed advantages terms both performance computational complexity.