Approximating edit distance in near-linear time.
Alexandr AndoniKrzysztof OnakPublished in: STOC (2009)
Keyphrases
- edit distance
- edit operations
- approximate string matching
- string matching
- similarity measure
- graph matching
- string similarity
- levenshtein distance
- distance measure
- string edit distance
- worst case
- distance function
- suffix array
- subgraph isomorphism
- tree structured data
- approximate matching
- dynamic programming
- graph edit distance
- tree edit distance
- finite alphabet
- neural network
- distance computation
- adjacency matrix
- endpoints
- natural language processing
- feature vectors
- pairwise
- lower bound
- data analysis
- machine learning
- data sets