The Aho-Corasick string matching algorithm is a fast algorithm for finding all occurrences of a set of substrings in a pattern text. It is a generalization of the Knuth-Morris-Pratt algorithm.
