The objects listed in the title have proven to be useful and practical modeling tools in continuous speech recognition work and elsewhere. Nevertheless, there are natural and simple situations in which the forward-backward algorithm will be inadequate for its intended purpose of finding useful maximum likelihood estimates of the parameters of the distribution of a probabilistic function of a Markov chain (a "hidden Markov model" or "Markov source model"). We observe some difficulties that arise in the case of common (e.g., Gaussian) families of conditional distributions for the observables. These difficulties are due not to the algorithm itself, but to modeling assumptions which introduce singularities into the likelihood function. We also comment on the fact that the parameters of a hidden Markov model cannot, in general, be determined, even if the distribution of the observables is completely known. We close with remarks about some effects of these modeling and estimating difficulties on practical speech recognition, and about the role of initial statistics.
[1]
L. Baum,et al.
Statistical Inference for Probabilistic Functions of Finite State Markov Chains
,
1966
.
[2]
L. Baum,et al.
An inequality with applications to statistical estimation for probabilistic functions of Markov processes and to a model for ecology
,
1967
.
[3]
T. Petrie.
Probabilistic functions of finite-state markov chains.
,
1967,
Proceedings of the National Academy of Sciences of the United States of America.
[4]
L. Baum,et al.
A Maximization Technique Occurring in the Statistical Analysis of Probabilistic Functions of Markov Chains
,
1970
.
[5]
F. Jelinek,et al.
Continuous speech recognition by statistical methods
,
1976,
Proceedings of the IEEE.