Efficient Alignment and Correspondence Using Edit Distance.
Paolo BergaminiLuigi CinqueAndrew D. J. CrossEdwin R. HancockStefano LevialdiRichard MyersPublished in: SSPR/SPR (2000)
Keyphrases
- edit distance
- dynamic time warping
- approximate matching
- edit operations
- similarity measure
- string edit distance
- approximate string matching
- string matching
- distance computation
- sequence alignment
- distance function
- computer vision
- levenshtein distance
- neural network
- data sets
- space efficient
- data structure
- tree edit distance
- longest common subsequence
- machine learning