Improved string searching
Ricardo A. Baeza-Yates · Software Practice and Experience · 1989
Abstract We show that it is possible to improve the average time of the Boyer‐Moore string matching algorithm using more space. This is accomplished by applying a transformation that virtually increases the size of the alphabet in use. The improvement is such that for long patterns it is possible to obtain an algorithm more than 50 per cent faster than the original one. We include experimental results on random and English text. Some improvements for searching on English text are also discussed.