We’ve got a use case for finding occurrences any of a large (100k+) dictionary of strings in a piece of text, so we’ve published an implementation of the Aho-Corasick bibliographic search algorithm which improves a little bit on some of the other available implementations – it might be useful if you have a similar requirement!