Edit Distance in Near-Linear Time: it's a Constant Factor.
Alexandr AndoniNegev Shekel NosatzkiPublished in: FOCS (2020)
Keyphrases
- edit distance
- constant factor
- worst case
- approximation algorithms
- lower bound
- upper bound
- graph matching
- distance function
- string matching
- similarity measure
- edit operations
- distance measure
- string edit distance
- np hard
- string similarity
- tree edit distance
- suffix array
- dynamic programming
- levenshtein distance
- sample complexity
- machine learning
- normalized edit distance
- sample size
- theoretical analysis
- text classification
- special case
- search space
- computational complexity
- feature extraction