The Levenshtein Distance or edit distance measures the similarity between two sequences/strings. The distance is measured in number of single character operations (delete, insert, replace) needed to transform one sequence into another.
-
Notifications
You must be signed in to change notification settings - Fork 0
The Levenshtein Distance or edit distance measures the similarity between two sequences/strings.
laszlokorte/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
The Levenshtein Distance or edit distance measures the similarity between two sequences/strings.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published