Calculating distances for dissimilar strings: the shortest path formulation revisited (Q856246)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Calculating distances for dissimilar strings: the shortest path formulation revisited |
scientific article |
Statements
Calculating distances for dissimilar strings: the shortest path formulation revisited (English)
0 references
7 December 2006
0 references
computing science
0 references
data cleansing
0 references
shortest path problem
0 references
string matching
0 references
Levenshtein distance
0 references
