Calculating distances for dissimilar strings: the shortest path formulation revisited (Q856246)
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: Calculating distances for dissimilar strings: the shortest path formulation revisited |
scientific article; zbMATH DE number 5078496
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Calculating distances for dissimilar strings: the shortest path formulation revisited |
scientific article; zbMATH DE number 5078496 |
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
0.86359805
0 references
0.86063457
0 references
0.8575938
0 references
0.85520595
0 references
0.8552059
0 references
0 references
