IEEE Transactions on Acoustics Speech and Signal Processing · 1990 · 410 citations · 18 references
ComputingLinguisticsAlgorithmsMachine LearningPhoneticsHidden Markov ModelsMarkov ChainsMarkov ModelingMarkov ProcessesMaximum Likelihood EstimationSpeech RecognitionBaum-welch AlgorithmInference In Hidden Markov ModelsJoint State EstimationLikelihood For Hidden Markov ModelsObjective Function FormulationSegmental Speech AnalysisSequence ModelingSpeech Segmentation
The authors discuss and document a parameter estimation algorithm for data sequence modeling involving hidden Markov models. The algorithm, called the segmental K-means method, uses the state-optimized joint likelihood for the observation data and the underlying Markovian state sequence as the objective function for estimation. The authors prove the convergence of the algorithm and compare it with the traditional Baum-Welch reestimation method. They also print out the increased flexibility this algorithm offers in the general speech modeling framework.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
18
G. David Forney · Proceedings of the IEEE · 1973 · 5.7K citations
An introduction to hidden Markov models
L. R. Rabiner, Biing‐Hwang Juang · IEEE ASSP Magazine · 1986 · 4.8K citations