A New Approach to Text Searching

Communications of the ACM

Volumn 35, Issue 10, 1992, Pages 74-82

  Baeza Yates, Ricardo ^a   Gonnet, Gaston H ^b  

^a UNIVERSITY OF CHILE   (Chile)

^b Informatik   (Switzerland)

Author keywords

string matching; text searching

Indexed keywords

EID: 84976680267     PISSN: 00010782     EISSN: 15577317     Source Type: Journal    
DOI: 10.1145/135239.135243     Document Type: Article

References (30)

1. Abrahamson, K. Generalized string matching. SIAM J Comput. 16 (1987), 1039-1051.
2. Aho, A.V. and Corasick, M. Efficient string matching: An aid to bibliographic search. Commun. ACM 18, 6 (June 1975), 333-340.
3. Baeza-Yates, R. Improved string searching. Software-Pract. and Exper. 19, 3 (1989), 257-271.
4. Baeza-Yates, R. String searching algorithms. In Information Retrieval: Algorithms and Data Structures, Chapt. 10, W. Frakes and R. Baeza-Yates, Eds., pp. 219-240. Prentice Hall, Englewood Cliffs, N.J., 1992.
5. Baeza-Yates, R. Text retrieval: Theory and practice. In Twelfth IFIP World Computer Congress (Madrid, Spain, Sept. 1992).
6. Baeza-Yates, R.A. Efficient text searching. Ph.D. thesis, Dept. of Computer Science, University of Waterloo, May 1989. Also as Res. Rep. CS-89-17.
7. Baeza-Yates, R.A. String searching algorithms revisted. In Workshop in Algorithms and Data Structures, F. Dehne, J.-R. Sack, and N. Santoro, Eds., pp. 75-96 (Ottawa, Canada, Aug. 1989). Springer Verlag Lecture Notes on Computer Science 382.
8. Baeza-Yates, R. and Gonnet, G.H. Fast string matching with mismatches. Inf. Comput. (1992). To be published. Also as Tech. Rep. CS-88-36, Dept. of Computer Science, University of Waterloo, 1988.
9. Baeza-Yates, R. and Gonnet, G.H. A new approach to text searching. In Proceedings of Twelfth ACM SIGIR (Cambridge, Mass., June 1989) pp. 168-175. (Addendum in ACM SIGIR Forum, W. 23, Numbers 3, 4, 1989, p. 7.).
10. Baeza-Yates, R. and Gonnet, G.H. New algorithm for pattern matching with and without mismatches. Tech. Rep. CS-88-37, Department of Computer Science, University of Waterloo, Ontario, Canada, 1988.
11. Baeza-Yates, R.A. and Perleberg, C.H. Fast and practical approximate pattern matching. In Proceedings of Third Conference on Combinatorial Pattern Matching (Tucson, Ariz., Apr. 1992) pp. 182-189.
12. Boyer, R. and Moore, S. A fast string searching algorithm. Commun. ACM 20 (1977), 762-772.
13. Commentz-Walter, B. A string matching algorithm fast on the average. In ICALP, Lecture Notes in Computer Science, vol. 6. Springer-Verlag, 1979, pp. 118-132.
14. Commun. ACM 35, 4 (Apr. 1992). Technical correspondence. Notes on a very fast substring search algorithm. 132-137.
15. Fischer, M. and Paterson, M. String matching and other products. In Complexity of Computation, R. Karp, Ed., (SIAM-AMS Proceedings 7), pp. 113-125. American Mathematical Society, Providence, R.I., 1974.
16. Galil, Z. and Giancarlo, R. Improved string matching with k mismatches. SIGACT News 17 (1986), 52-54.
17. Gonnet, G.H. Unstructured data bases or very efficient text searching. In ACM PODS 2, Atlanta, Ga., Mar. 1983, pp. 117-124.
18. Gonnet, G.H. and Baeza-Yates, R. Handbook of Algorithms and Data Structures-In Pascal and C. Second ed. Addison-Wesley, Wokingham, UK, 1991.
19. Horspool, R.N. Practical fast searching in strings. Softw.-Pract. Exper. 10 (1980), 501-506.
20. Hume, A. and Sunday, D.M. Fast string searching. Softw.-Pract. Exper. 21, 11 (Nov. 1991), 1221-1248.
21. Karp, R. and Rabin, M. Efficient randomized pattern-matching algorithms. IBM J. Res. Develop. 31 (1987), 249-260.
22. Kernighan, B. and Ritchie, D. The C Programming Language. Prentice Hall, Englewood Cliffs, N.J., 1978.
23. Knuth, D.E. The Art of Computer Programming: Sorting and Searching, vol. 3. Addison-Wesley, Reading, Mass., 1973.
24. Knuth, D.E., Morris, J. and Pratt, V. Fast pattern matching in strings. SIAM J Comput. 6 (1977), 323-350.
25. Landau, G. and Vishkin, U. Efficient string matching with k mismatches. Theoretical Comput. Sci. 43 (1986), 239-249.
26. Pinter, R. Efficient string matching with don't-care patterns. In Combinatorial Algorithms on Words, A. Apostolico and Z. Galil, Eds., vol. F12 of NATO ASI Series, Springer-Verlag, 1985, pp. 11-29.
27. Smith, P.D. Experiments with a very fast substring search algorithm. Softw.-Pract. Exper. 21, 10 (Oct. 1991), 1065-1074.
28. Sunday, D.M. A very fast substring search algorithm. Commun. ACM 33, 8 (Aug. 1990), 132-142.
29. Wu, S. and Manber, U. Fast text searching with errors. Tech. Rep. TR-91-11, Department of Computer Science, University of Arizona, Tucson, Ariz., June 1991.
30. Wu, S. and Manber, U. Agrep-a fast approximate pattern-matching tool. In Proceedings of USENIX Technical Conference (Jan. 1992, San Francisco, Calif.), pp. 153-162.