Speeding-Up the Dynamic Programming Procedure for the Edit Distance of Two Strings.
Giuseppe LanciaMarcello DalpassoPublished in: DEXA Workshops (2019)
Keyphrases
- edit distance
- dynamic programming
- approximate string matching
- edit operations
- string matching
- string similarity
- string edit distance
- similarity measure
- graph matching
- dynamic time warping
- levenshtein distance
- distance measure
- distance computation
- graph edit distance
- longest common subsequence
- approximate matching
- tree structured data
- hamming distance
- tree edit distance
- normalized edit distance
- machine learning
- distance function
- finite alphabet
- object recognition
- nearest neighbor
- reinforcement learning