Definition: A multiple string matching algorithm that compares from the end of the pattern, like Boyer-Moore, using a finite state machine, like Aho-Corasick.
Generalization (I am a kind of ...)
Beate Commentz-Walter, A string matching algorithm fast on the average in Maurer (ed.), Proc 6th International Coll. on Automata, Languages, and Programming, pages 118-132, Springer-Verlag, 1979.
Beate Commentz-Walter, A string matching algorithm fast on the average, Technical Report TR 79.09.007, IBM Germany, Heidelberg Scientific Center, 1979.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 14 August 2008.
HTML page formatted Fri Feb 23 10:06:07 2018.
Cite this as:
Paul E. Black, "Commentz-Walter", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 14 August 2008. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/CommentzWalter.html