Jump to content

Commentz-Walter algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Dominikrussenberger (talk | contribs) at 07:54, 13 October 2011. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
Stub icon

This algorithms or data structures-related article is a stub. You can help Wikipedia by expanding it.

The Commentz-Walter algorithm is a string searching algorithm invented by Beate Commentz-Walter. Like the Aho–Corasick string matching algorithm, it can search for multiple patterns at once. It combines ideas from Aho-Corasick with the fast matching of the Boyer–Moore string search algorithm.

GNU grep implements a string matching algorithm very similar to Commentz-Walter[1].

References

  1. ^ http://git.savannah.gnu.org/cgit/grep.git/tree/src/kwset.c

http://www.hs-albsig.de/studium/wirtschaftsinformatik/Documents/commentzwalterextab.pdf

Retrieved from "https://en.wikipedia.org/w/index.php?title=Commentz-Walter_algorithm&oldid=455336859"