A tiny implementation of the Levenshtein edit distance algorithm.
npm install tiny-levenshteinA tiny implementation of the Levenshtein edit distance algorithm.
``sh`
npm install tiny-levenshtein
`ts
import levenshtein from 'tiny-levenshtein';
// Let's compute the Levenshtein edit distance between two strings
// Strings are compared at the byte level
levenshtein ( 'kitten', 'sitting' ); // => 3
levenshtein ( '🤣', '😂' ); // => 2
// Let's compute the Levenshtein edit distance between two arrays
// Arrays are compared at the element level
// This can double-down as Unicode-aware string comparison too
levenshtein ( [1, 2, 3], [1, 4, 3] ); // => 1
levenshtein ( [...'🤣'], [...'😂'] ); // => 1
``
MIT © Fabio Spampinato