Efficient text searching of regular expressions
We present algorithms for efficient searching of regular expressions on preprocessed text, using a Patricia tree as index. We obtain searching algorithms with logarithmic expected time in the size of the text for a wide subclass of regular expressions, and sublinear expected time for any regular expression. These are the first known algorithms to achieve these time complexities.
- [BY89]R.A. Baeza-Yates. Efficient Text Searching. PhD thesis, Dept. of Computer Science, University of Waterloo, May 1989. Also as Research Report CS-89-17.Google Scholar
- [BYG89a]R. Baeza-Yates and G.H. Gonnet. Efficient text searching of regular expressions. In ICALP'89, Stresa, Italy, July 1989. Also as UW Centre for the New OED Report, OED-89-01, Univ. of Waterloo, April, 1989.Google Scholar
- [BYG89b]R.A. Baeza-Yates and G.H. Gonnet. Solving matrix recurrences with applications. Technical Report CS-89-16, Department of Computer Science, University of Waterloo, May 1989.Google Scholar