Bounds and Estimates on the Average Edit Distance.
Gianfranco BilardiMichele SchimdPublished in: CoRR (2022)
Keyphrases
- edit distance
- graph matching
- edit operations
- string matching
- similarity measure
- distance measure
- levenshtein distance
- approximate string matching
- string similarity
- upper bound
- distance function
- graph edit distance
- string edit distance
- approximate matching
- tree edit distance
- worst case
- similarity join
- lower bound
- dissimilarity measure
- dynamic programming
- adjacency matrix
- longest common subsequence
- distance computation
- dimensionality reduction
- finite alphabet
- nearest neighbor