7 packages found

Finds degree of similarity between strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.

a library for matching human-quality input to a list of potential matches using the Levenshtein distance algorithm

Fastest Levenshtein distance implementation in JS.

Determines if an object can be used as an array

The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.

Measure the difference between two strings using the Levenshtein distance algorithm

Object properties matcher for Chai