Two algorithms for approximate string matching in static texts. (Extended abstract) (Q4035246)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 176144
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two algorithms for approximate string matching in static texts. (Extended abstract) |
scientific article; zbMATH DE number 176144 |
Statements
18 May 1993
0 references
approximate occurrences
0 references
preprocessing
0 references
suffix automata
0 references
\(q\)-gram lists
0 references
0.8739442825317383
0 references
0.8677771091461182
0 references
0.8664692044258118
0 references
Two algorithms for approximate string matching in static texts. (Extended abstract) (English)
0 references
