Fast Text Searching: Allowing Errors

Communications of the ACM

Volumn 35, Issue 10, 1992, Pages 83-91

  Wu, Sun ^a   Manber, Udi ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b UNIVERSITY OF ARIZONA   (United States)

Author keywords

approximate string matching; information retrieval; pattern matching; software tools; string searching

Indexed keywords

EID: 84976654685     PISSN: 00010782     EISSN: 15577317     Source Type: Journal    
DOI: 10.1145/135239.135244     Document Type: Article

References (25)

1. Abrahamson, K. Generalized string matching. SIAM J. Comput. 16, 6 (1987), 1039-1051.
2. Baeza-Yates, R.A. and Gonnet, G.H. A new approach to text searching. Commun. ACM 35, 10 (1992). Preliminary version appeared in Proceedings of the 12th Annual ACM-SIGIR Conference on Information Retrieval, Cambridge, Mass. (June 1989), pp. 168-175.
3. Boyer, R.S. and Moore, J.S. A fast string searching algorithm. Commun. ACM 20, 10 (Oct. 1977), 762-772.
4. Chang, W.I. and Lawler, E.L. Approximate string matching in sub-linear expected time. FOCS 90, pp. 116-124.
5. Galil, Z. and Giancarlo, R. Data structures and algorithms for approximate string matching. J. Complex. 4 (1988), 33-72.
6. Galil, Z. and Park, K. An improved algorithm for approximate string matching. SIAM J. Comput. 19 (Dec. 1990), 989-999.
7. Gonnet, G.H. and Baeza-Yates, R.A. Handbook of Algorithms and Data Structures. Second ed. Addison-Wesley, Reading, Mass., 1991.
8. Hall, P.A.V. and Dowling, G.R. Approximate string matching. Comput. Surv. (Dec. 1980), 381-402.
9. Hopcroft, J.E. and Ullman, J.D. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, Mass. (1979).
10. Knuth, D.E., Morris, J.H. and Pratt, V.R. Fast pattern matching in strings. SIAM J. Comput. 6 (June 1977), 323-350.
11. Landau, G.M. and Vishkin, U. Fast string matching with k differences. J. Comput. Syst. Sci. 37 (1988), 63-78.
12. Landau, G.M. and Vishkin, U. Fast parallel and serial approximate string matching. J. Algor. 10 (1989).
13. Levenshtein, V.I. Binary codes capable of correcting deletions, insertions, and reversals. Sov. Phys. Dokl. (Feb. 1966), 707-710.
14. Manber, U. and Wu, S. Approximate string matching with arbitrary costs for text and hypertext. IAPR Workshop on Structural and Syntactic Pattern Recognition, (Bern, Switzerland Aug. 1992).
15. Manber, U. and Wu, S. Approximate pattern matching. BYTE. To be published Nov. 1992.
16. Myers, E.W. An O(ND) difference algorithm and its variations. Algorithmica 1 (1986), 251-266.
17. Myers, E.W. and Miller, W. Approximate matching of regular expressions. Bull. Math. Bio. 51 (1989), 5-37.
18. Pinter, R. Efficient string matching with don't-care patterns. In Combinatorial Algorithms on Words, A. Apostolico and Z. Galil, Eds., Springer-Verlag, Berlin, 1985.
19. Tarhio, J. and Ukkonen, E. Approximate Boyer-Moore string matching. Tech. Rep. #A-1990-3, Dept. of Computer Science, University of Helsinki (Mar. 1990).
20. Ukkonen, E. Finding approximate patterns in strings. J. Algor. 6 (1985), 132-137.
21. Ukkonen, E. Algorithms for approximate string matching. Inf. Control 64 (1985), 100-118.
22. Wagner, R.A. and Seiferas, J.I. Correcting counter-automaton-recognizable languages. SIAM J. Comput. 7 (1978), 357-375.
23. Wu, S. Approximate pattern matching and its applications. Ph.D. dissertation, Dept. of Comput. Sci., University of Arizona, June 1992.
24. Wu, S. and Manber, U. Agrep-A fast approximate pattern-matching tool. Usenix Winter 1992 Technical Conference (San Francisco Jan. 1992), pp. 153-162.
25. Wu, S., Manber, U. and Myers, E.W. A Sub-Quadratic Algorithm for Approximate Regular Expression Matching, submitted for publication (May 1992).