A formal theory for optimal and information theoretic syntactic pattern recognition

Pattern Recognition

Volumn 31, Issue 8, 1998, Pages 1159-1177

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

^a CARLETON UNIVERSITY   (Canada)

^b PURDUE UNIVERSITY   (United States)

Author keywords

Markovian sequence generation; Optimal and information theoretic pattern recognition; Sequence generation; String generation; Syntactic pattern recognition; Unigram and bigram model

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; DYNAMIC PROGRAMMING; ERRORS; FORMAL LOGIC; MARKOV PROCESSES; MATHEMATICAL MODELS; PROBABILITY DISTRIBUTIONS; SET THEORY;

BIGRAM MODEL; SEQUENCE GENERATION; STRING GENERATION; SYNTACTIC PATTERN RECOGNITION; UNIGRAM MODEL;

PATTERN RECOGNITION;

EID: 0032141693     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0031-3203(97)00124-6     Document Type: Article

References (47)

1. R. O. Duda, P.E. Hart. Pattern Classification and Scene Analysis. Wiley, New York (1973).
2. K. Fukunaga, Introduction to Statistical Pattern Recognition. Academic Press, New York (1972).
3. K. S. Fu, Syntactic Methods in Pattern Recognition, Academic Press, New York (1974).
4. H. Bunke and J. Csirik, Parametric string edit distance and its application to pattern recognition, IEEE Trans. Systems Man and Cybernat. SMC-25, 202-206 (1995).
5. 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, Inform. Sci. 23(2), 123-142 (1981).
6. D. Sankoff and J. B. Kruskal, Time Warps,String Edits and Macromolecules: The Theory and practice of Sequence Comparison, Addison-Wesley, Reading, Massuchusetts (1983).
7. R. L. Bahl and F. Jelinek, Decoding with channels with insertions, deletions and substitutions with applications to speech recognition, IEEE Trans. Inform. Theory IT-21, 404-411 (1975).
8. P. Bucher and K. Hoffmann, A sequence similarity search algorithm based on a probabilistic interpretation of an alignment scoring system, Proc. 4th Int. Conf. on Intelligent Systems for Molecular Biology, Vol. ISMB-96, pp. 44-51 (1996).
9. H. Bunke, Structural and syntactic pattern recognition, in Handbook of Pattern Recognition and Computer Vision, C. H. Chen, L. F. Pau and P. S. P. Wang, eds. World Scientific, Singapore (1993).
10. M. Y. Chen, A. Kundu and S. Srihari, Handwritten word recognition using morphological segmentation and variable duration - hidden Markov model, Proc. CVPR, June (1993).
11. S. Eddy, Multiple alignment using hidden Markov models, Proc. 3rd Int. Conf. for Intelligent Systems for Molecular Biology, pp. 114-120 AAAI Press, New York (1995).
12. G. D. Forney, The Viterbi algorithm, Proc. IEEE 61 (1973).
13. A. Krogh, M. Brown, I. S. Mian, K. Sjolander and D. Hausler, Hidden Markov models in computational biology: Applications to protein modeling, J. Mol. Biol. 235, 1501-1531 (1994).
14. A. Kundu, Y. He and P. Bahl, Recognition of the handwritten word: first and second order hidden Markov model based approach, Pattern Recognition 22, 283-297 (1989).
15. L. R. Rabiner and B.-H. Juang, An introduction to hidden Markov models, IEEE Accoustics Sound Signal Process, 4-16 (1986).
16. A. J. Viterbi, Error bounds for convolutional codes and an asymptotically optimal decoding algorithm, IEEE Trans. Inform. Theory 260-266 (1967).
17. G. Dewey, Relative Frequency of English Speech Sounds. Harvard Univ. Press, Cambridge, Massuchusetts (1923).
18. P. A. V. Hall and G. R. Dowling, Approximate string matching, Comput. Surveys 12, 381-402 (1980).
19. R. L. Kashyap and B. J. Oommen, A common basis for similarity and dissimilarity measures involving two strings, Int. J. Comput. Math. 13, 17-40 (1983).
20. R. L. Kashyap and B. J. Oommen, The noisy substring matching problem, IEEE Trans. Software Engng SE-9, 365-370 (1983).
21. R. L. Kashyap and B. J. Oommen, String correction using probabilistic methods, Pattern Recognition Lett. 147-154 (1984).
22. S. B. Needleman and C. D. Wunsch, A general method applicable to the search for similarities in the amino acid sequence of two proteins, J. Mol. Biol. 443-453 (1970).
23. T. Okuda, E. Tanaka and T. Kasai, A method of correction of garbled words based on the Levenshtein metric, IEEE Trans. Comput. C-25, 172-177 (1976).
24. B. J. Oommen, Recognition of noisy subsequences using constrained edit distances, IEEE Trans. Pattern Anal. Mach. Intell. PAMI-9, 676-685 (1987).
25. B. J. Oommen, Constrained string editing, Inform. Sci. 40, 267-284 (1987).
26. S. Srihari, Computer Text Recognition and Error Correction. IEEE Computer Society Press, Silver Spring, Maryland (1984).
27. W. J. Masek and M. S. Paterson, A faster algorithm computing string edit distances, J. Comput. System Sci. 20, 18-31 (1980).
28. C. K. Wong and A. K. Chandra, Bounds for the string editing problem, J. Assoc. Comput. Mach. 23, 13-16 (1976).
29. L. Devroye, W. Szpankowski and B. Rais, A note on the height of suffix trees, SIAM J. of Comput. 21, 48-54 (1992).
30. P. Jacquet and W. Szpankowski, Analysis of digital tries with Markovian dependencies, IEEE Trans. Inform. Theory IT-37, 1470-1475 (1991).
31. D. L. Neuhoff, The Viterbi algorithm as an aid in text recognition, IEEE Trans. Inform. Theory 222-226 (1975).
32. W. Szpankowski, Probabilistic analysis of generalized suffix trees, Proc. CPM-92, the 3rd Annual Symp. on Combinatorial Pattern Matching, pp. 1-14 (1992).
33. S. H. Levine, S. L. Minneman, C. O. Getschow and C. Goodenough-Trepagnier, Computer disambiguation of multi-character text entry: An adaptive design approach, Proc. IEEE Int. Conf. on Systems, Man and Cybernetics, pp. 298-301 (1986).
34. S. L. Minneman, Keyboard optimization technique to improve output rate of disabled individuals, Proc. 9th Annual RESNA Conf. Minneapolis, pp. 402-404 (1986).
35. R. Shinghal and G. T. Toussaint, Experiments in text recognition with the modified Viterbi algorithm, IEEE Trans. Pattern. Anal. Mach. Intel. pp. 184-192 (1979).
36. J. Golic and M. Mihaljevic, A noisy clock-controlled shift register cryptanalysis concept based on sequence comparison approach, Proc. EUROCRYPT-90, Aarhus, Denmark, pp. 487-491 (1990).
37. D. S. Hirschberg, Algorithms for longest common subsequence problem, J. Assoc. Comput. Mach. 24, 664-675 (1977).
38. D. S. Hirschberg, A linear space algorithm for computing maximal common subsequences, Comm. Assoc. Comput. Mach. 18, 341-343 (1975).
39. J. W. Hunt and T. G. Szymanski, A fast algorithm for computing longest common subsequences, Comm. Assoc. Comput. Mach. 20, 350-353 (1977).
40. A. Levenshtein, Binary codes capable of correcting deletions, insertions and reversals, Sov. Phys. Dokl. 10, 707-710 (1966).
41. B. J. Oommen and K. Zhang, The normalized string editing problem revisited, IEEE Trans. Pattern Anal. Mach. Intell. PAMI-18, 669-672 (1996).
42. J. L. Peterson, Computer programs for detecting and correcting spelling errors, Comm. Assoc. Comput. Mach. 23, 676-687 (1980).
43. R. A. Wagner and M. J. Fisher, The string to string correction problem, J. Assoc. Comput. Mach. 21, 168-173 (1974).
44. D. Sankoff, Matching sequences under deletion/insertion constraints, Proc. Nat. Acad. Sci. U.S.A. 69, 4-6 (1972).
45. L. Devroye, Non-Uniform Random Variate Generation. Springer, Berlin (1986).
46. R. Lowrance and R. A. Wagner, An extension of the string to string correction problem, J. Assoc. Comput. Mach. 22, 177-183 (1975).
47. M. Regnier, A language approach to string searching evaluation, Proc. CPM-92 the 3rd Annual Symp. on Combinatorial Pattern Matching, pp. 15-26 (1992).