Optimal and information theoretic syntactic pattern recognition for traditional errors

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1121, Issue , 1996, Pages 11-20

  Oommen, B J ^a   Kashyap, R L ^b  

^a CARLETON UNIVERSITY   (Canada)

^b PURDUE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DYNAMIC PROGRAMMING; INFORMATION THEORY; SIGNAL PROCESSING; SYNTACTICS;

FINITE ALPHABET; INSERTION OPERATIONS; RIGOROUS MODEL; SYNTACTIC ERRORS; SYNTACTIC PATTERN RECOGNITION;

PATTERN RECOGNITION;

EID: 84958544090     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61577-6_2     Document Type: Conference Paper

References (24)

1. R.L. Bahl and F. Jelinek, Decoding with channels with insertions, deletions and substitutions with applications to speech recognition, IEEE T. Inf. Th., IT-21:404-411 (1975).
2. Bunke, H. and Csirik, J, Parametric string edit distance and its application to pattern Recognition, IEEE T. Syst., Man and Cybern., SMC-25:202-206 (1993).
3. L. Devroye, W. Szpankowski and B. Rais, A note on the height of suffix trees, SIAM J. of Computing, 21:48-54, (1992).
4. G. Dewey, Relative Frequency of English Speech Sounds, Harvard Univ. Press, (1923).
5. R.O. Duda, P.E. Hart. Pattern Classification and Scene Analysis. Wiley & Sons, 1973.
6. G.D. Forney, The Viterbi Algorithm, Proceedings of the IEEE, Vol. 61. (1973).
7. K. Fukunaga. Introduction to Statistical Pattern Recognition. Academic Press, 1972.
8. P.A.V. Hall and G.R. Dowling, Approximate string matching, Comp. Sur., 12:381-402 (1980).
9. P. Jacquet and W. Szpankowski, Analysis of digital tries with markovian dependencies, IEEE T. Inf. Th., IT-37:1470-1475 (1991).
10. R. L. Kashyap and B. J. Oommen, A common basis for similarity and dissimilarity measures involving two strings, Int. J. Comp. Math.,17-40 (1983).
11. R. L. Kashyap and B. J. Oommen, An effective algorithm for string correction using generalized edit distances -I. Description of the algorithm and its optimality, Inf. Sci., 23(2):123-142 (1981).
12. R. L. Kashyap, and B. J. Oommen, String correction using probabilistic methods, Pattern Recognition Letters, 147-154 (1984).
13. R. Lowrance and R. A. Wagner, An extension of the string to string correction problem, J. Assoc. Comput. Mach., 22:177-183 (1975).
14. A. Levenshtein, Binary codes capable of correcting deletions, insertions and reversals, Soviet Phys. Dokl., 10:707-710 (1966).
15. W. J. Masek and M. S. Paterson, A faster algorithm computing string edit distances, J. Comput. System Sci., 20:18-31 (1980).
16. D. L. Neuhoff, The Viterbi algorithm as an aid in text recognition, IEEE T. Inf. Th., 222-226 (1975).
17. T. Okuda, E. Tanaka, and T. Kasai, A method of correction of garbled words based on the Levenshtein metric, IEEE T. Comput., C-25:172-177 (1976).
18. B. J. Oommen, Recognition of noisy subsequences using constrained edit distances, IEEE T. on Pattern Anal. and Mach. lntel., PAMI-9:676-685 (1987).
19. B. J. Oommen and R. L. Kashyap, A Formal Theory for Optimal and Information Theoretic Syntactic Pattern Recognition. Unabridged Version of the present paper. (Submitted for Publication).
20. D. Sankoff and J. B. Kruskal, Time Warps, String Edits and Macromolecules: The Theory and practice of Sequence Comparison, Addison-Wesley (1983).
21. R. Shinghal, and G. T. Toussaint, Experiments in text recognition with modified Viterbi algorithm, IEEE T. on Pat. Anal. and Mach. Intel., 184-192 (1979).
22. S. Srihari, Computer Text Recognition and Error Correction, IEEE Computer Press, (1984).
23. A. J. Viterbi, Error bounds for convolutional codes and an asymptotically optimal decoding algorithm, IEEE T. on Inf. Th., 260-26 (1967).
24. R. A. Wagner and M. J. Fisher, The string to string correction problem, J. Assoc. Comput. Mach., 21:168-173 (1974).