Jump to content

Commentz-Walter algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Yobot (talk | contribs) at 07:12, 14 December 2011 (→External links: WP:CHECKWIKI error 54|52|37|88|6|57|44|26|38|55|63|65 fixes + general fixes using AWB (7879)). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In computer science, 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


Stub icon

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

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