4.1.0
Measure the difference between two strings using the Levenshtein distance algorithm
Suggestions
Sort by
1.0.16
Fastest Levenshtein distance implementation in JS.
2.2.0
Ukkonens approximate string matching algorithm for finding edit distance similar to Levenshtein
1.2.2
Match human-quality input to potential matches by edit distance.
8.0.2
A JavaScript text diff implementation.
4.0.4
Finds degree of similarity between strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.
2.0.1
Like the `Did you mean?` in git for npm
Follow for updates
Keep up-to-date with new features, changelog and more
@pkgland