Simple, deterministic, fast (but weak) approximations to edit distance and Dyck edit distance.
Michal KouckýMichael E. SaksPublished in: SODA (2023)
Keyphrases
- edit distance
- graph matching
- distance measure
- edit operations
- similarity measure
- string matching
- string similarity
- approximate string matching
- levenshtein distance
- graph edit distance
- distance function
- dynamic programming
- similarity join
- tree edit distance
- longest common subsequence
- dissimilarity measure
- approximate matching
- closed form
- subgraph isomorphism
- tree structured data
- data sets
- reinforcement learning
- feature selection
- neural network