Approximate String Matching

ACM Computing Surveys (CSUR)

Volumn 12, Issue 4, 1980, Pages 381-402

  Hall, Patrick A V ^a   Dowling, Geoff R ^b  

^a SCICON Consultancy International Limited ^*  (United Kingdom)

^b CITY UNIVERSITY   (United Kingdom)

Author keywords

approximate matching; best match; equivalence; error correction; errors; file organization; informatmn retrieval; longest common subsequence; misspelling; searching; similarity; spelling correction; string correction; string editing; string matching; syntax errors

Indexed keywords

EID: 84976659284     PISSN: 03600300     EISSN: 15577341     Source Type: Journal    
DOI: 10.1145/356827.356830     Document Type: Article

References (84)

1. Aho, A. V., and Peterson, T. G. “A minimum distance error-correcting parser for context-free languages.” SIAM J. Comput. 1 (Dec. 1972), 305-312.
2. Aho, A. V., and Corasick, M. J. “Fast pattern matching: An aid to bibliographic search,” Commun. ACM 18, 6 (June 1975), 333-340.
3. Aho, A. V., Hirschberg, D. S., and Ullman, J. D. “Bounds on the complexity of the longest common subsequence problem”, J. ACM 23, 1 (Jan. 1976), 1-12.
4. Alberga, C. N. “String similarity and misspellings,” Commun. ACM 10, 5 (May 1967), 302-313.
5. Bacon, M. D., and Bull, G. M. Data transmission, Macdonald and Jane's, London, 1973.
6. Bell, D. “Programmer selection and programming errors,” Comput. J. 19, 3 (1976), 202-206.
7. Birkoff, G., and Maclean, S. A survey of modern algebra, Macmillan, New York, 1970.
8. Blair, C. R. “A program for correcting spelling errors,” Inf. Control 3 (1960), 60-67.
9. Bourne, C. P., and Ford, D. J. “A study of methods for systemtically abbreviating English words and names,” J. ACM 8, 4 (Oct. 1961), 538-552.
10. Bourne, C. P. “Frequency and impact of spelling errors in bibiographic data bases,” Inf. Process. Manage. 13, 1 (1977), 1-12.
11. Boyer, R. S., and Moore, J. S. “A fast string searching algorithm.” Commun. ACM 20, 10 (Oct. 1977), 762-772.
12. Bryant, J. R., and Fenlon, S. M. “The design and implementation of an on-line index,” Database Technol.(ON-LINE, 1976).
13. Comer, D. “The ubiquitous B-tree,” Comput. Surv. 11, 1 (June 1979), 121-138.
14. “Spelling correction program for micros,” Comput. Weekly (July 3, 1980), 7.
15. Cormack, R. M. “A review of classification,” Royal Statistical Soc. J. 134 (Series A, 1971), 321-367.
16. Damerau, F. J. “A technique for computer detection and correction of spelling errors,” Commun. ACM 7, 3 (March 1964), 171-176.
17. Davidson, L. “Retrieval of misspelled names in an airline's passenger record system,” Commun. ACM 5, 3 (March 1962), 169-171.
18. Dowling, G. R., and Hall, P. A. V. “Elastic template matching in speech recognition, using linguistic information,” in 2nd Int. Joint Conf. Pattern Recognition, Copenhagen, Aug. 1974, pp. 249-250 (available from IEEE.).
19. Dowling, G. R. “Automatic segmentation of continuous speech,” Ph.D. Dissertation, The City University, London, 1977.
20. Earley, J. “An efficient context-free parsing algorithm,” Commun. ACM 13, 2 (Feb. 1970), 94-102.
21. Eggers, B. “Error reporting, error treatment and error correction in ALGOL translation, part II,” in 2nd Annual Meeting, G.I., Karlsruhe, Oct. 1972.
22. Erman, L. D., Hayes-Roth, F., Lesser, V. R., and Reddy, D. R. “The HEAR-SAY-II speech understanding system: Integrating knowledge to resolve uncertainty,” Comput. Surv. 12, 2 (June 1980), 213-253.
23. Freeman, D. “Error correction in CORC: The Cornell computing language,” Ph.D. Dissertation, Cornell University, Ithaca, N.Y., 1963.
24. Fu, K. S. “Error-correcting parsing for syntactic pattern recognition,” in Data-structures, computer graphics and pattem recognition, Klinger et al. (Eds.) Academic Press, New York, 1976.
25. Fung, L. W., and Fu, K. S. “Maximum-likelihood syntactic decoding,” IEEE Trans. Inform. Theory IT-21 (July 1975), 423-430.
26. Galil, Z. “On improving the worst case running time of the Boyer-Moore string matching algorithms,” Commun. ACM 22, 9 (Sept. 1979), 505-508.
27. Gimpel, J. F. Algorithms in SNOBOL 4, Wiley-Interscience, New York, 1976.
28. Graham, S. L., and Rhodes, S. P. “Practical syntactic error recovery,” Commun. ACM 18, 11 (Nov. 1975), 639-650.
29. Gries, D. Compiler construction for digital computers, Wiley, New York, 1971.
30. Hall, P. A. V. “Branch and bound and beyond,” in Int Joint Conf. Artificial Intelligence, Imperial College, London, Sept. 1971, pp. 641-650 (available from British Computer Society).
31. Hall, P. A. V., and Hussein, I. “Design of information systems for Arabic,” in Information systems methodology, ECI 78 Conference, Venice, Springer-Verlag, New York, 1978, pp. 643-663.
32. Heckel, P. “A technique for isolating differences between files,” Commun. ACM 21, 4 (April 1978), 264-268.
33. Hopcroft, J. E., and Ullman, J. D. “Error correction for formal languages,” Tech. Rep. 52, Princeton Univ., Princeton, N.J., Nov. 1966.
34. Hopcroft, J. E., and Ullman, J. D. Formal languages and their relation to automata, Addison-Wesley, Reading, Mass., 1969.
35. Hunt, J. W., and Szymanski, T. G. “A fast algorithm for computing longest common subsequences,” Commun. ACM 20, 5 (May 1977), 350-353.
36. Irons, E. T. “An error-correcting parser algorithm,” Commun. ACM 6, 11 (Nov. 1963), 669-673.
37. James, E. B., and Partridge, D. P. “Adaptive correction of program statements,” Commun. ACM 16, 1 (Jan. 1973), 27-37.
38. Jenks, R. D. 1976 ACM Conf. Symbolic and Algebraic. Computation (ACM), 1976.
39. Knuth, D. E. Sorting and searching, Addison-Wesley, Reading, Mass., 1973.
40. Knuth, D. E., Morris, J. H., and Pratt, V. R. “Fast pattern matching in strings,” SIAM J. Comput. 6 (1977), 323-350.
41. Levenshtein, V. I. “Binary codes capable of correcting deletions, insertions, and reversals,” Sov. Phys. Dokl. 10 (Feb. 1966), 707-710.
42. Levy, J. P. “Automatic correction of syntax errors in programming languages,” Acta Inf. 4 (1975), 271-292.
43. Lipski, W., Jr. “On semantic issues connected with incomplete information databases” ACM Trans. Database Syst. 4, 3 (Sept. 1979), 262-296.
44. Litecky, C. R., and Davis, G. B. “A study of errors, error-proneness, and error diagnosis in COBOL,” Commun. ACM 19, 1 (Jan. 1976), 33-37.
45. Lowrance, R., and Wagner, R. A. “An extension of the string-to-string correction problem,” J. ACM 22, 2 (April 1975), 177-183.
46. Lyon, G. “Syntax-directed least-errors analysis for context-free languages: A practical approach,” Commun. ACM 17, 1 (Jan. 1974), 3-14.
47. Martin, J. Computer data base organization, Prentice-Hall, Englewood Cliffs, N.J., 1975.
48. Mickunas, M. D., and Modry, J. A. “Automatic error recovery for LR parsers,” Commun. ACM 21, 6 (June 1978), 459-465.
49. Morgan, H. L. “Spelling correction in systems programs,” Commun. ACM 13, 2 (Feb. 1970), 90-94.
50. Muth, F. E., Jr., and Tharp, A. L. “Correcting human error in alphanumeric terminal input,” Inf. Process. Manage. 13, 6 (1977), 329-337.
51. Newell, A., Barnett, J., Forgie, J. W., Green, C., Klatt, D., Licklider, J. C. R., Munson, J., Reddy, D. R., and Woods, W. A. “Speech understanding systems. Final report of a study group,” in Artificial intelligence, North-Holland Elsevier, New York, 1973.
52. Odell, M. K., and Russell, R. C. U.S. Patent nos. 1, 261, 167 (1918) and 1, 435, 663 (1922).
53. Paice, C. D. Information retrieval and the computer, MacDonald and Jane's Computer Monographs, London, 1977.
54. Pan, V. YA. “Field extension and tri-linear aggregating, uniting, and canceling for the acceleration of matrix multiplications,” in Proc. 20th Annual Symp. Foundations of Computer Science, Oct. 1979, pp. 28-38.
55. Peterson, W. W. Error-correcting codes, Wiley, New York, 1961.
56. Potter, R. K., Kopp, G. A., and Kopp, H. G. Visible speech, Dover, New York, 1966.
57. Radecki, T. “New approach to the problem of information system effectiveness evaluation,” Inf. Process. Manage. 12, 5 (1976), 319-326.
58. Rahman, N. A. A course in theoretical statistics, Griffin, London, 1968.
59. Riseman, E. M., and Hanson, A. R. “A contextual post-processing system for error-correction using binary n-grams,” IEEE Trans. Comput. C-23, 5 (1974), 480-493.
60. Rivest, R. L. “On the worst-cast behavior of string-searching algorithms,” SIAM J. Comput. 6, 4 (Dec. 1977), 669-673.
61. Roget The new Boget's thesaurus, N. Lewis (Ed.), Putnam, 1961.
62. Sakoe, H. “Two level DP-matching—A dynamic programming based pattern matching algorithm for connected word recognition,” IEEE Trans. Acoust., Speech, Signal Proc. ASSP-27, 6 (Dec. 1979), 588-595.
63. Salton, G. Automatic information organization and retrieval, McGraw-Hill, New York, 1968.
64. Salton, G., and Wong, A. “Generation and search of clustered files,” ACM Trans. Database Syst. 3, 4 (Dec. 1978), 321-346.
65. Shaffer, L. H., and Hardwich, J. “Typing performance as a function of text,” Qt. J. Exper. Psychol. 20, 4 (1968), 360-369.
66. Shapiro, M. “The choice of reference points in best match file searching,” Commun. ACM 20, 5 (May 1977), 339-343.
67. Smith, W. B. “Error detection in formal languages,” J. Comput. Syst. Sci, 4 (1970), 385-405.
68. Slinn, C. “Retrieval mechanisms and Arabic strings,” in 5th Saudi Arabian Computer Conf., Dhahran, Saudi Arabia, March 1979.
69. Szanzer, A. J. “Error-correcting methods in natural language processing,” in Information processing 68, IFIP 1969, pp. 1412-1416.
70. Szanzer, A. J. “Bracketing technique in elastic matching,” Comput. J. 16, 2 (1973), 132-134.
71. Tanaka, E., and Fu, K. S. “Error-correcting parsers for formal languages,” IEEE. Trans. Comput. C-27, 7 (July 1978), 605-616.
72. Tarjan, R. E. “Efficiency of a good but not linear set union algorithm,” J. ACM 22, 2 (April 1975), 215-225.
73. Teitelbaum, R. “Minimal distance analysis of syntax errors in computer programs,” Ph.D. Dissertation, Carnegie-Mellon Univ., Pittsburgh, Pa., 1976.
74. Ullman, J. R. “A binary n-gram technique for automatic correction of substitution, deletion, insertion and reversal errors in words,” Comput. J. 20, 2 (1977), 141-147.
75. UNESCO SPINES thesaurus, The UNESCO Press, Paris, 1976.
76. Velichko, V. M., and Zagaruiko, N. G. “Automatic recognition of 200 words,” Int. J. Man-Mach. Stud. 2 (1970), 223-234.
77. Vintsyuk, T. K. “Speech discrimination by dynamic programming,” Kibernetika 4, 1 (1968), 81-88 (in Russian).
78. translated in Cybernetics 4, 1, 52-58.
79. Wagner, R. A. “An n3 minimum edit distance correction algorithm for context-free languages,” Tech. Rep., Systems and Information Sci. Dept., Vanderbilt Univ., Nashville, Tenn., 1972.
80. Wagner, R. A., and Fischer, M. J. “The string-to-string correction problem,” J. ACM 21, 1 (Jan 1974), 168-178.
81. Wagner, R. A. “Order-n correction for regular languages,” Commun. ACM 17, 5 (May 1974), 265-268.
82. White, G. M., and Neely, R. B. “Speech recognition experiments with linear prediction, bandpass filtering, and dynamic programming,” IEEE Trans. Acoust., Speech, Signal Proc. ASSP-24, 2 (April 1976), 183-188.
83. Wilcox, T. R., Davis, A. M., and Tindall, M. H. “The design and implementation of a table-driven interactive diagnostic programming system,” Commun. ACM 19, 11 (Nov. 1976), 609-616.
84. Wong, C. K., and Chandra, A. K. “Bounds for the string editing problem,” J. ACM 23, 1 (Jan. 1976), 13-16.