Using Edit Distance Trails to Analyze Path Solutions of Parsons Puzzles.
Salil MaharjanAmruth KumarPublished in: EDM (2020)
Keyphrases
- edit distance
- graph matching
- string matching
- approximate string matching
- levenshtein distance
- string similarity
- distance function
- similarity measure
- edit operations
- graph edit distance
- string edit distance
- tree structured data
- distance computation
- distance measure
- approximate matching
- dissimilarity measure
- subgraph isomorphism
- constraint satisfaction
- shortest path
- longest common subsequence
- object recognition
- optimal solution
- minimum cost
- endpoints
- similarity join
- constraint satisfaction problems
- neural network