Levenshtein distance (LD) is a measure of the similarity between two strings, which we will refer to as the source string (s) and the target string (t). The distance is the number of deletions, insertions, or substitutions required to transform s into t.
levenstein
1.0.0 • Public • PublishedPackage Sidebar
Install
npm i levenstein
Repository
Weekly Downloads
0
Version
1.0.0
License
MIT