About: Commentz-Walter algorithm

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Commentz-Walter algorithm Goto Sponge NotDistinct Permalink

An Entity of Type : dbo:Island, within Data Space : el.dbpedia.org associated with source document(s)

In computer science, the Commentz-Walter algorithm is a string searching algorithm invented by . 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. For a text of length n and maximum pattern length of m, its worst-case running time is O(mn), though the average case is often much better. GNU grep implements a string matching algorithm very similar to Commentz-Walter.

Attributes	Values
rdf:type	island
rdfs:label	Commentz-Walter algorithm (en)
rdfs:comment	In computer science, the Commentz-Walter algorithm is a string searching algorithm invented by . 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. For a text of length n and maximum pattern length of m, its worst-case running time is O(mn), though the average case is often much better. GNU grep implements a string matching algorithm very similar to Commentz-Walter. (en)
sameAs	Commentz-Walter algorithm
dbp:wikiPageUsesTemplate	dbt:Algorithm-stub dbt:Cite_book dbt:Reflist dbt:Webarchive dbt:Strings
Subject	String matching algorithms
Link from a Wikipage to an external page	https://web.archive.org/web/20171010223532/http:/www.hs-albsig.de/studium/wirtschaftsinformatik/Documents/commentzwalterextab.pdf%7Cdate=2017-10-10%7Ctitle=A https://www.researchgate.net/figure/Example-for-Commentz-Walter-algorithm-24_fig4_314202032%7Cchapter=Performance
gold:hypernym	String
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Commentz-Walter_algorithm?oldid=1055315539&ns=0
Wikipage page ID	33386298 (xsd:integer)
page length (characters) of wiki page	2343 (xsd:nonNegativeInteger)
Wikipage revision ID	1055315539 (xsd:integer)
Link from a Wikipage to another Wikipage	Grep Aho–Corasick algorithm Big O notation Boyer–Moore string-search algorithm String matching algorithms Computer science GNU String-searching algorithm dbr:Beate_Commentz-Walter
has abstract	In computer science, the Commentz-Walter algorithm is a string searching algorithm invented by . 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. For a text of length n and maximum pattern length of m, its worst-case running time is O(mn), though the average case is often much better. GNU grep implements a string matching algorithm very similar to Commentz-Walter. (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/Commentz-Walter_algorithm
is Wikipage redirect of	Commentz–Walter algorithm
is Link from a Wikipage to another Wikipage of	Aho–Corasick algorithm Commentz–Walter algorithm
is foaf:primaryTopic of	http://en.wikipedia.org/wiki/Commentz-Walter_algorithm

Faceted Search & Find service v1.17_git151 as of Feb 20 2025

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (71 GB total memory, 2 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software