%0 Journal Article %1 stolcke_1994_merging %A Stolcke, Andreas %A Omohundro, Stephen M. %D 1994 %K sequence %T Best-first Model Merging for Hidden Markov Model Induction %U http://arxiv.org/abs/cmp-lg/9405017 %X This report describes a new technique for inducing the structure of Hidden Markov Models from data which is based on the general `model merging' strategy (Omohundro 1992). The process begins with a maximum likelihood HMM that directly encodes the training data. Successively more general models are produced by merging HMM states. A Bayesian posterior probability criterion is used to determine which states to merge and when to stop generalizing. The procedure may be considered a heuristic search for the HMM structure with the highest posterior probability. We discuss a variety of possible priors for HMMs, as well as a number of approximations which improve the computational efficiency of the algorithm. We studied three applications to evaluate the procedure. The first compares the merging algorithm with the standard Baum-Welch approach in inducing simple finite-state languages from small, positive-only training samples. We found that the merging procedure is more robust and accurate, particularly with a small amount of training data. The second application uses labelled speech data from the TIMIT database to build compact, multiple-pronunciation word models that can be used in speech recognition. Finally, we describe how the algorithm was incorporated in an operational speech understanding system, where it is combined with neural network acoustic likelihood estimators to improve performance over single-pronunciation word models.

@article{stolcke_1994_merging, abstract = {This report describes a new technique for inducing the structure of Hidden Markov Models from data which is based on the general `model merging' strategy (Omohundro 1992). The process begins with a maximum likelihood HMM that directly encodes the training data. Successively more general models are produced by merging HMM states. A Bayesian posterior probability criterion is used to determine which states to merge and when to stop generalizing. The procedure may be considered a heuristic search for the HMM structure with the highest posterior probability. We discuss a variety of possible priors for HMMs, as well as a number of approximations which improve the computational efficiency of the algorithm. We studied three applications to evaluate the procedure. The first compares the merging algorithm with the standard Baum-Welch approach in inducing simple finite-state languages from small, positive-only training samples. We found that the merging procedure is more robust and accurate, particularly with a small amount of training data. The second application uses labelled speech data from the TIMIT database to build compact, multiple-pronunciation word models that can be used in speech recognition. Finally, we describe how the algorithm was incorporated in an operational speech understanding system, where it is combined with neural network acoustic likelihood estimators to improve performance over single-pronunciation word models.}, added-at = {2009-08-06T15:16:38.000+0200}, archiveprefix = {arXiv}, author = {Stolcke, Andreas and Omohundro, Stephen M.}, biburl = {https://www.bibsonomy.org/bibtex/27f0132e69cd882b956bad03067c79df9/chato}, citeulike-article-id = {3968372}, citeulike-linkout-0 = {http://arxiv.org/abs/cmp-lg/9405017}, citeulike-linkout-1 = {http://arxiv.org/pdf/cmp-lg/9405017}, eprint = {cmp-lg/9405017}, interhash = {ef20aa1b23e22daa1fcbb76981c33722}, intrahash = {7f0132e69cd882b956bad03067c79df9}, keywords = {sequence}, month = May, posted-at = {2009-01-27 16:46:45}, priority = {2}, timestamp = {2009-08-06T15:16:43.000+0200}, title = {Best-first Model Merging for Hidden Markov Model Induction}, url = {http://arxiv.org/abs/cmp-lg/9405017}, year = 1994 }