Efficient Algorithms for Computing the Inner Edit Distance of a Regular Language via Transducers.
Lila KariStavros KonstantinidisSteffen KopeckiMeng YangPublished in: Algorithms (2018)
Keyphrases
- edit distance
- efficient algorithms for computing
- graph matching
- similarity measure
- levenshtein distance
- string matching
- edit operations
- graph edit distance
- distance measure
- string edit distance
- string similarity
- distance function
- approximate string matching
- approximate matching
- tree structured data
- tree edit distance
- potential functions
- distance computation
- dynamic programming
- similarity join
- finite alphabet
- pairwise
- natural language