boyer-moore

Somewhat similar to how a Boyer-Moore search doesn't need to scan the whole haystack while looking for needles.

We used the Boyer-Moore theorem prover and the Stanford Pascal Verifier, but the tools were not there yet.

You can do Boyer-Moore on byte sequences and return the byte offset instead of the character offset.

It's not cutting edge at this point, but still covers all the basics (like Boyer-Moore) really well.

But it doesn't matter much in the real world, because even better algorithms, like Boyer-Moore and its derivatives are faster still, and they are used instead.

IMO the Boyer-Moore string searching algorithm is way more elegant.

For a time, I was fascinated by Boyer-Moore theory and their theorem prover.

How do you extend Boyer-Moore to arbitrary regexps?

If you can't do that, your regexp may contain longish fixed strings that allow you to discard most lines via Boyer-Moore before you have to run the regexp engine.

Tried exploring string-search algorithms like Knuth-Morris-Pratt and Boyer-Moore; tried keeping a tree list of 16-bit matches (which in fully randomized data reduces search overhead to O(n×m/{between log2(65536) and 65536})...

I couldn't find Boyer-Moore via search, or by an alphabetical search.

With Boyer-Moore you can do less than 100% of the file size in I/O, especially if the given pattern is long relative to the full text.

One example from later in that email thread: ^foo is the same as a fixed string search for foo I presume there are ways you can bound your fixed searches, and have your NFA work "backwards" through the string after a boyer-moore hits.