Constant factor approximations to edit distance on far input pairs in nearly linear time.
Michal KouckýMichael E. SaksPublished in: STOC (2020)
Keyphrases
- edit distance
- constant factor
- string similarity
- worst case
- similarity join
- approximation algorithms
- edit operations
- lower bound
- graph matching
- levenshtein distance
- string edit distance
- string matching
- similarity measure
- dynamic programming
- graph edit distance
- distance measure
- upper bound
- approximate matching
- normalized edit distance
- distance function
- pairwise
- neural network
- join algorithms
- data sets
- model selection
- linear programming
- semi supervised
- np hard
- feature vectors
- feature extraction