This module implements the Levenshtein edit distance, which measures the difference between two strings, in terms of the edit distance. This distance is the number of substitutions, deletions or insertions ("edits") needed to transform one string into the other one (and vice versa). When two strings have distance 0, they are the same.
To learn more about the Levenshtein metric, have a look at the at http://en.wikipedia.org/wiki/Levenshtein_distance.
Package Version | Update ID | Released | Package Hub Version | Platforms | Subpackages |
---|---|---|---|---|---|
0.15-bp156.1.1 info | GA Release | 2023-10-17 | 15 SP6 |
|
|