Re:The Boyer-Moore Fast String Searching Algorithm
by MattPalmer1086 on Saturday April 24, 2021 @05:35AM
(#26923578)
That is all true. You can however increase the effective alphabet size by working with n-grams of the needle rather than bytes. Even a 2 byte n-gram gives you an alphabet of 65536. You wouldn't get all of that as the hash table would probably be smaller, but you can increase the shifts a lot for longer patterns in this manner.
[ Parent
| on HN ]
There are no comments on this comment yet.