Levenshtein distance (LD) is a measure of the similarity between two strings, which we will refer to as the source string (s) and the target string (t). The distance is the number of deletions, insertions, or substitutions required to transform s into t.
malcolm-sheridan/Levenshtein
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
A micro library that returns the Levenshtein distance bewteen lists of strings
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published