Next: About this document ...
Up: Topics in Computational Hidden
Previous: Conditional Normal Mixtures
- Act70
-
Forman S. Acton.
Numerical Methods that Work.
Harper and Row, 1970.
- Bau72
-
L. E. Baum.
An inequality and associated maximization technique in statistical
estimation of probabilistic functions of Markov processes.
Inequalities, 3:1-8, 1972.
- BBS88
-
H. A. P. Blom and Y. Bar-Shalom.
The interacting multiple model algorithm for systems with markovian
switching coefficients.
IEEE Trans. Automatic Control, pages 780-783, August 1988.
- BE67
-
L. E. Baum and J. E. Eagon.
An inequality with application to statistical estimation for
probabalistic functions of a Markov process and to models for ecology.
Bull. AMS, 73:360-363, 1967.
- Ber79
-
J. Berstel.
Transductions and Context-Free Languages.
Teubner, Stuttgart, 1979.
- BF96
-
Y. Bengio and P. Frasconi.
Input/output hmms for sequence processing.
IEEE Transactions on Neural Networks, 7(5), 1996.
- BGT93
-
C. Berrou, A. Glavieux, and P. Thitimajshima.
Near shannon limit error-correcting coding and decoding: Turbo codes
(1).
In Proc. ICC'93, pages 1064-1070, Geneva, Switzerland, 1993.
- BPSW70
-
L. E. Baum, T. Petrie, G. Soules, and N. Weiss.
A maximization technique occurring in the statistical analysis of
probabilistic functions of Markov chains.
Ann. Math Stat., 41:164-171, 1970.
- Bre73
-
Richard P. Brent.
Algorithms for Minimization without Derivatives.
Prentice-Hall, 1973.
- Bro87
-
Peter F. Brown.
Acoustic-phonetic modeling problem in automatic speech
recognition.
PhD thesis, Carnegie-Mellon University, 1987.
- BSL93
-
Yaakov Bar-Shalom and Xiao-Rong Li.
Estimation and Tracking: Principles, Techniques, and Software,
chapter 11, pages 461-465.
Artech House, Boston, London, 1993.
- CJ93
-
Rama Chellappa and Anil Jain, editors.
Markov Random Fields: Theory and Application.
Academic Press, 1993.
- Cov84
-
Thomas M. Cover.
An algorithm for maximizing expected log investment return.
IEEE Transactions on Information Theory, 1984.
- CT91
-
Thomas M. Cover and Joy A. Thomas.
Elements of Information Theory.
Wiley, 1991.
- DH73
-
Richard O. Duda and Peter E. Hart.
Pattern Classification and Scene Analysis.
John Wiley & Sons, Inc., 1973.
- DLR77
-
A. P. Dempster, N. M. Laird, and D. B. Rubin.
Maximum-likelihood from incomplete data via the EM algorithm.
J. Royal Statistical Society Ser. B (methodological), 39:1-38,
1977.
- FJM80
-
F F. Jelinek and R. L. Mercer.
Interpolated estimation of Markov source parameters from sparse
data.
In E. S. Gelsema and L. N. Kanal, editors, Pattern Recognition
in Practice, volume Amsterdam, May 21-23, pages 381-397. North Holland,
1980.
- GHE96
-
S. Greenberg, J. Hollenbach, and D. Ellis.
Insights into spoken language gleaned from phonetic transcription of
the Switchboard corpus.
In Proc. ICSLP, Philadelphia, October 1996.
- GHM95
-
J. Godfrey, E. Holliman, and J. McDaniel.
Switchboard: telephone speech corpus for research and development.
In Proc. IEEE ICASSP, pages 517-520, 1995.
- HAJ90
-
X. D. Huang, Y. Ariki, and M. A. Jack.
Hidden Markov Models for Speech Recognition.
Edinburgh University Press, 1990.
- HD80
-
Patrick A. V. Hall and Geoff R. Dowling.
Approximate string matching.
Computing Surveys, 12(4):381-402, December 1980.
- HJ89
-
X. D. Huang and M. A. Jack.
Unified modelling of vector quantization and hidden markov models
using semi-continuous hidden markov models.
In Proc. ICASSP, pages 639-642, 1989.
- HU79
-
John E. Hopcroft and Jeffrey D. Ullman.
Introduction to Automata Theory, Languages, and Computation.
Addison-Wesley, 1979.
- Lau96
-
Steffen L. Lauritzen.
Graphical Models.
Clarendon Press, Oxford, 1996.
- LDC95
-
COMLEX pronouncing lexicon, version 0.2.
Linguistic Data Consortium LDC95L3, July 1995.
- Lev66
-
V. Levenshtein.
Binary codes capable of correcting deletions, insertions, and
reversals.
Soviet Physics - Doklady 10, 10:707-710, 1966.
- Lev86
-
S. E. Levinson.
Continuously variable duration hidden markov models for automatic
speech recognition.
Computer Speech and Language, 1:29-45, 1986.
- MMC96
-
Robert J. McEliece, D. J. C. MacKay, and J.F. Cheng.
Turbo decoding as an instance of pearl's `belief propagation'
algorithm.
Submitted to IEEE Journal on Selected Areas in Communication,
1996.
- OGV93
-
José Oncina, Pedro García, and Enrique Vidal.
Learning subsequential transducers for pattern recognition
interpretation tasks.
IEEE Transactions on Pattern Analysis and Machine Intelligence,
15(5), May 1993.
- Pea88
-
Judea Pearl.
Probabilistic Reasoning in Intelligent Systems: Networks of
Plausible Inference.
Morgan Kaufmann, 1988.
- PFTV88
-
William H. Press, Brian P. Flannery, Saul A. Teukolsky, and William T.
Vetterling.
Numerical Recipes in C - The Art of Scientific Computing,
chapter 10.
Cambridge University Press, 1988.
- Por88
-
A. B. Poritz.
Hidden Markov models: a guided tour.
In Proc. ICASSP-88, pages 7-13, 1988.
- RC85
-
M. J. Russell and A. E. Cook.
Experimental evaluation of duration modelling techniques for
automatic speech recognition.
In Proc. ICASSP-85, pages 5-8, 1985.
- RJLS85
-
L. R. Rabiner, B. H. Juang, S. E. Levinson, and M. M. Sondhi.
Recognition of isolated digits using hidden markov models with
continuous mixture densities.
AT&T Technical Journal, 1985.
- RW84
-
R. A. Redner and H. F. Walker.
Mixture densities, maximum likelihood, and the EM algorithm.
SIAM Review, 26:195-239, 1984.
- RY94
-
Eric Sven Ristad and Peter N. Yianilos.
Probability value library.
Technical report, Princeton University, Department of Computer
Science, 1994.
- RY96a
-
Eric Sven Ristad and Peter N. Yianilos.
Finite growth models.
Technical Report 533-96, Princeton University, Department of Computer
Science, 1996.
- RY96b
-
Eric Sven Ristad and Peter N. Yianilos.
Learning string edit distance.
Technical report, Princeton University, Department of Computer
Science, 1996.
- RY96c
-
Eric Sven Ristad and Peter N. Yianilos.
On the strange a posteriori degeneracy of normal mixtures, and
related reparameterization theorems.
Technical report, Princeton University, Department of Computer
Science, 1996.
- RY97a
-
Eric S. Ristad and Peter N. Yianilos.
Learning string edit distance.
In (to appear) The Fourteenth International Conference on
Machine Learning (ICML'97), 1997.
- RY97b
-
Eric Sven Ristad and Peter N. Yianilos.
Library of practical abstractions, release 1.2.
ftp://ftp.cs.princeton.edu/pub/packages/libpa, March 1997.
- SHJ96
-
Padhraic Smith, David Heckerman, and Michael I. Jordan.
Probabilistic independence networks for hidden probability models.
Technical Report MSR-TR-93-03, Microsoft Research, 1996.
- SK83
-
D. Sankoff and J. B. Kruskal.
Macromolecules: The Theory and Practice of Sequence Comparison.
Addison-Wesley, 1983, 1983.
- Wib96
-
Niclas Wiberg.
Codes and Decoding on General Graphs.
PhD thesis, Linköping Studies in Science and Technology, Sweden,
1996.
No. 440.
- WLK95
-
N. Wiberg, H. Loeliger, and R. Kotter.
Codes and iterative decoding on general graphs.
European Transactions on Telecommunications, 6(5):513-526,
October 1995.
Peter N. Yianilos
2002-06-24