Levenshtein distance (or edit distance) between two strings is the number of deletions, insertions, or substitutions required to transform source string into target string.
For example, if source is "book" and target is "back", to transform "book" to "back" you will need to change first "o" to "a", second "o" to "c", without additional deletions and insertions, thus, levenshtein distance will be 2.
Levenshtein distance is named after the Russian scientist Vladimir Levenshtein, who devised the algorithm in 1965.
This has a wide range of applications, for instance, spell checkers, correction systems for optical character recognition, etc.
You can find more information, for example, in Wikipedia
- • Conversion between imperial and metric units of area
- • Conversion between metric units of length and old Russian system of measures units of length
- • Distance across the surface vs distance through the Earth
- • Prospect distance from the ground and line of sight distance between two observers
- • Imperial to Metric and Metric to Imperial measures of length converter
- • Math section ( 248 calculators )