An Extension of Ukkonen's Enhanced Dynamic Programming ASM Algorithm

ACM Transactions on Information Systems

Volumn 14, Issue 1, 1996, Pages 94-106

  Berghel, Hal ^a,c   Roach, David ^b  

^a UNIVERSITY OF ARKANSAS   (United States)

^b ACXIOM CORPORATION   (United States)

^c University of Arkansas   (United States)

Author keywords

F.2.2 Analysis of Algorithms and Problem Complexity :Nonnumerical Algorithms; H.3.1 Information Storage and Retrieval : Content Analysis and Indexing; H.3.3 Information Storage and Retrieval : Information Search and Retrieval

Indexed keywords

EID: 1542428871     PISSN: 10468188     EISSN: None     Source Type: Journal    
DOI: 10.1145/214174.214183     Document Type: Article

References (11)

1. BERGHEL, H. 1987. A logical framework for the correction of spelling errors in electronic documents. Inf. Process. Manage. 23, 477-494.
2. DAMERAU, F. J. 1964. A technique for computer detection and correction of spelling errors. Commun. ACM 7, 171-176.
3. FAULK, R. 1964. An inductive approach to language translation. Commun. ACM 7, 647-653.
4. GALIL, Z. AND GIANCARLO, R. 1988. Data structures and algorithms for approximate string matching. J. Complexity 20, 33-72.
5. LEVENSHTEIN, V. 1966. Binary codes capable of correcting deletions, insertions, and reversals. Sov. Phys. Dokl. 10, 707-710.
6. SELLERS, P. 1974. On the theory and computation of evolutionary distances. SIAM J. Appl. Math. 26, 787-793.
7. UKONNEN, E. 1983. On approximate string matching. In Proceedings of the International Conference on Foundations of Computation Theory (Borgholm, Sweden, Aug.). 21-27.
8. UKKONEN, E. 1985. Algorithms for approximate string matching. Inf. Contr. 64, 100-118.
9. WAGNER, R. AND FISCHER, M. 1974. The string-to-string correction problem. J. ACM 21, 168-178.
10. Wu, S. AND MANBER, U. 1992. Fast text searching allowing errors. Commun. ACM 35, 83-91.
11. Wu, S., MANBER, U., MYERS, G., AND MILLER, W. 1990. An O(NP) sequence comparison algorithm. Inf. Process. Lett. 35, 317-323.