Learning string-edit distance

IEEE Transactions on Pattern Analysis and Machine Intelligence

Volumn 20, Issue 5, 1998, Pages 522-532

  Ristad, Eric Sven ^a   N yianilos, Peter ^b  

^a Mnemonic Technology Inc   (United States)

^b NEC LABORATORIES AMERICA   (United States)

Author keywords

Levenshtein distance; Pronunciation modeling; Spelling correction; Stochastic transduction; String classification; String correction; String similarity; String edit distance; Switchboard corpus; Syntactic pattern recognition

Indexed keywords

ERROR CORRECTION; MATHEMATICAL MODELS; RANDOM PROCESSES; SPEECH PROCESSING;

STOCHASTIC TRANSDUCTION; STRING EDIT DISTANCE; SYNTACTIC PATTERN RECOGNITION;

SPEECH RECOGNITION;

EID: 0032075067     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/34.682181     Document Type: Article

References (31)

1. COMLEX Pronouncing Lexicon, Version 0.2. Linguistic Data Consortium LDC95L3, July 1995.
2. L.R. Bahl and F. Jelinek, "Decoding for Channels With Insertions, Deletions, and Substitutions With Applications to Speech Recognition," IEEE Trans. Information Theory, vol. 21, no. 4, pp. 404-411, 1975.
3. L. Baum and J. Eagon, "An Inequality With Applications to Statistical Estimation for Probabilistic Functions of a Markov Process and to Models for Ecology," Bulletin Am. Mathematical Soc. 73, pp. 360-363,1967.
4. L. Baum, T. Pétrie, G. Soûles, and N. Weiss, "A Maximization Technique Occurring in the Statistical Analysis of Probabilistic Functions of Markov Chains," Ann. Mathematical Statistics 41, pp. 164-171 1970.
5. H. Bunke and J. Csirik, "Parametric String Edit Distance and its Application to Pattern Recognition," IEEE Trans. Systems, Man, and Cybernetics, vol. 25, no. 1, pp. 202-206,1995.
6. A. Dempster, N. Laird, and D. Rubin, "Maximum Likelihood From Incomplete Data via the EM Algorithm," J. Royal Statistical Soc. Series B (methodological), vol. 39, pp. 1-38,1977.
7. G.D. Forney, "The Viterbi Algorithm," Proc. IEEE, vol. 62, no. 3, pp. 268-278,1973.
8. J. Godfrey, E. Holliman, and J. McDaniel, "Switchboard: Telephone Speech Corpus for Research and Development," Proc. IEEE ICASSP, pp. 517-520, Detroit, 1995.
9. S. Greenberg, J. Hollenbach, and D. Ellis, "Insights Into Spoken Language Gleaned From Phonetic Transcription of the Switchboard Corpus," Proc. ICSLP, Philadelphia, Oct. 1996.
10. P. Hall and G. Dowling, "Approximate String Matching," Computing Surveys, vol. 12, no. 4, pp. 381-402,1980.
11. F. Jelinek, L.R. Bahl, and R.L. Mercer, "The Design of a Linguistic Statistical Decoder for the Recognition of Continuous Speech," IEEE Trans. Information Theory, vol. 21, no. 3, pp. 250256,1975.
12. F. Jelinek and R.L. Mercer, "Interpolated Estimation of Markov Source Parameters From Sparse Data," Pattern Recognition in Practice, ES. Gelsema and L.N. Kanal, eds., pp. 381-397, Amsterdam, 21-23 May, 1980.
13. K. Kukich, "Techniques for Automatically Correcting Words in Text," ACM Computing Surveys, vol. 24, pp. 377-439,1992.
14. V. Levenshtein, "Binary Codes Capable of Correcting Deletions, Insertions, and Reversals," Soviet Physics-Doklady 10, vol. 10, pp. 707-710,1966.
15. D. Llorens, and E. Vidai, "Application of Extended Generalized Linear Discriminant Functions (EGLDF) to Planar Shape Recognition," Proc. IEE European Workshop Handwriting Analysis London, May 1996.
16. A. Marzal, and E. Vidai, "Computation of Normalized Edit Distance and Applications," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 15, no. 9. pp. 926-932,1993.
17. W. Masek and M.A. Paterson, "Faster Algorithm Computing String Edit Distances. J. Computer System Science, vol. 20, pp. 18-31 1980.
18. B. Oomman, "Constrained String Editing," Information Sciences, vol. 40, pp. 267-284 1986.
19. B. Oommen and R. Kashyap, "Optimal and Information Theoretic Syntactic Pattern Recognition for Traditional Errors," Advances in Structural and Syntactic Pattern Recognition, P. Ferner, P. Wang, and A. Rosenfeld, eds., pp. 11-20, Berlin, 20-23 Aug. 1996.
20. J. Peterson, "Computer Programs for Detecting and Correcting Spelling Errors," Comm. ACM, vol. 23, pp. 676-687,1980.
21. R.A. Redner and H.F. Walker, "Mixture Densities, Maximum Likelihood, and the EM Algorithm," SIAM Review, vol. 26, no. 2, pp. 195-239,1984.
22. M. Riley, A. Ljolje, D. Hindle, and F. Pereira, "The AT&T 60,000 Word Speech-to-Text System," Eurospeech'95: ECSA Fourth European Conf. Speech Communication and Technology, J.M. Pardo, E. Enrîquez, J. Ortega, J. Ferreiros, J. Macîas, and FJ.Valverde, eds., vol. 1, pp. 207-210, Madrid, Spain, Sept. 1995.
23. M.D. Riley and A. Ljolje, "Automatic Generation of Detailed Pronunciation Lexicons," Automatic Speech and Speaker Recognition: Advanced Topics, ch. 12, C.-H. Lee, F.K. Soong, and K.K. Paliwal, eds. Kluwer Academic, 1996.
24. E.S. Ristad and R.G. Thomas, "Hierarchical Non-Emitting Markov Models," Proc. 35th Ann. Meeting ACL, pp. 381-385, Madrid, 7-11 July 1997.
25. E.S. Ristad and P.N. Yianilos, "Finite Growth Models," Technical Report CS-TR-533-96, Dept. of Computer Science, Princeton Univ., Princeton, N.J., Dec. 1996.
26. Ristad, E. S., and Yianilos, P. N. Learning String Edit Distance. Tech. Rep. CS-TR-532-96, Department of Computer Science, Princeton University, Princeton, NJ, October 1996. Revised November 1997.
27. E.S. Ristad and P.N. Yianilos, "Learning String Edit Distance/'Proc. 14th Int'l Conf. Machine Learning, D. Fisher, Ed., pp. 287-295, San Francisco, 8-11 July, 1997.
28. D. Sankoff and J.B. Kruskal, eds., Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison. Reading, Mass.: Addison-Wesley, 1983.
29. A. Viterbi, "Error Bounds for Convolutional Codes and an Asymptotically Optimum Decoding Algorithm," IEEE Trans. Information Theory, vol. 13, pp. 260-269,1967.
30. R. Wagner and M. Fisher, "The String to String Correction Problem," J. ACM, vol. 21, pp. 168-173,1974.
31. P.N. Yianilos, "Topics in Computational Hidden State Modeling," PhD thesis, Dept. Computer Science, Princeton Univ., Princeton, N.J., June 1997.