levenshtein distance
Levenshtein distance is a measurement of the difference between two strings by counting the minimum number of operations (insertions, deletions, or substitutions) required to transform one string into the other.
Requires login.
Related Concepts (1)
Similar Concepts
- approximate nearest neighbor search
- closeness
- dijkstra's algorithm
- distance perception
- edit distance
- floyd-warshall algorithm
- k-nearest neighbors
- kullback-leibler divergence
- liouvillian dynamics
- longest common subsequence
- nearest neighbor search
- proximity
- similarity search
- traveling salesman problem
- von neumann neighborhood