Skip to content

Latest commit

 

History

History
11 lines (7 loc) · 341 Bytes

README.md

File metadata and controls

11 lines (7 loc) · 341 Bytes

Levenshtein

Levenshtein distance is a metric for measuring the difference between two strings. Specifically, it is the minimum number of single-character edits (insertions, deletions, or substitutions) required to change one string into the other.

Example

import Levenshtein

Levenshtein.distance "kitten" "sitting" --> 3