The Levenshtein Distance calculates the minimum number of insertions, deletions and single character substitutions needed to transform string a into string b. However, The Damerau-Levenshtein Distance algorithm takes all this into consideration in addition to adjacent character substitutions.
-
Notifications
You must be signed in to change notification settings - Fork 0
danvixent/buycoin-challenge2
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published