The Levenshtein distance algorithm calculates the minimum number of operations required to transform one string into another. The operations can be insertion, deletion, or substitution of a single character. The higher the Levenshtein distance between two strings, the more different they are.
-
Notifications
You must be signed in to change notification settings - Fork 0
The Levenshtein distance algorithm calculates the minimum number of operations required to transform one string into another. The operations can be insertion, deletion, or substitution of a single character. The higher the Levenshtein distance between two strings, the more different they are.
tolgahanacar/levenshtein-distance
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
About
The Levenshtein distance algorithm calculates the minimum number of operations required to transform one string into another. The operations can be insertion, deletion, or substitution of a single character. The higher the Levenshtein distance between two strings, the more different they are.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published