An approximate string-matching algorithm (Q1190457): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4057549 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fast parallel and serial approximate string matching / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fast String Matching in Stationary Ergodic Sources / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A binary n-gram technique for automatic correction of substitution, deletion, insertion and reversal errors in words / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The String-to-String Correction Problem / rank | |||
Normal rank | |||
Latest revision as of 11:44, 16 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An approximate string-matching algorithm |
scientific article |
Statements
An approximate string-matching algorithm (English)
0 references
26 September 1992
0 references
\(n\)-grams
0 references
approximate string-matching
0 references
trie
0 references
0 references
