Computing the Expected Edit Distance from a String to a Probabilistic Finite-State Automaton.
Jorge Calvo-ZaragozaJosé OncinaColin de la HigueraPublished in: Int. J. Found. Comput. Sci. (2017)
Keyphrases
- edit distance
- edit operations
- string matching
- finite state automaton
- graph matching
- similarity measure
- levenshtein distance
- string similarity
- string edit distance
- distance measure
- approximate string matching
- tree structured data
- hamming distance
- approximate matching
- bayesian networks
- tree edit distance
- distance function
- dynamic programming
- neural network
- uncertain data
- similarity join
- context sensitive
- pattern recognition
- graph edit distance
- pattern matching
- special case
- finite alphabet