Skip to content

An Elm implementation of the Levenshtein distance algorithm.

License

Notifications You must be signed in to change notification settings

dasch/levenshtein

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

42 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

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

About

An Elm implementation of the Levenshtein distance algorithm.

Resources

License

Stars

Watchers

Forks

Packages

No packages published

Languages