Average-case linear-time similar substring searching by the \(q\)-gram distance (Q2440164)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Average-case linear-time similar substring searching by the q-gram distance |
scientific article; zbMATH DE number 6275054
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Average-case linear-time similar substring searching by the \(q\)-gram distance |
scientific article; zbMATH DE number 6275054 |
Statements
Average-case linear-time similar substring searching by the \(q\)-gram distance (English)
0 references
27 March 2014
0 references
string searching
0 references
approximate string matching
0 references
\(q\)-gram distance
0 references
0.8656096458435059
0 references
0.8173822164535522
0 references
