Description
Efficient implementation of Levenshtein algorithm with locale-specific collator support.
Keywords
Publisher
Description
Measure the difference between two strings using the fastest JS implementation of the Levenshtein distance algorithm
Keywords
- leven
- levenshtein
- distance
- algorithm
- algo
- string
- difference
- diff
- fast
- fuzzy
- similar
- similarity
- compare
- comparison
- View more
Publisher
Description
The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.
Keywords
- levenshtein
- distance
- algorithm
- algo
- string
- difference
- diff
- fast
- fuzzy
- similar
- similarity
- compare
- comparison
- edit
- View more
Publisher
Description
Damerau - Levenshtein distance by The Spanish Inquisition + relative distance
Keywords
Publisher
Description
Levenshtein edit distance. No cruft. Real fast.
Keywords
Publisher
Description
Finds degree of similarity between strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.
Keywords
Publisher
Description
a library for matching human-quality input to a list of potential matches using the Levenshtein distance algorithm
Keywords
- closest
- compare
- comparison
- didyoumean
- diff
- difference
- distance
- edit
- find
- fuzzy
- leven
- levenshtein
- match
- matching
- View more
Publisher
Description
diff strings and lists with levenshtein distance
Keywords
Publisher
Description
A tiny optimized package which finds the Levenshtein distance (edit distance) between two words. Having two strings of length N and M, the algorithm has O(N*M) complexity and uses O(N) additional space.
Keywords
Publisher
Description
A lightweight implementation of the Levenshtein distance algorithm.
Keywords
Publisher
Description
Node.js bindings for the levenshtein-sse lib
Keywords
Publisher
Description
The fastest JS implementation of the Damerau-Levenshtein edit distance
Keywords
Publisher
Description
String and tree edit distance
Keywords
Publisher
Description
Finds measure of similarity/distance between two input sets.
Keywords
- set
- sorensen
- dice
- jaccard
- ochiai
- otsuka
- barkman
- overlap
- levenshtein
- edit-distance
- distance
- coefficient
- algorithm
- string
- View more
Publisher
Description
How similar are these two strings?
Keywords
Publisher
Description
A simple ES6 proxy wrapper that enables you to make typos in property names.
Keywords
Publisher
Description
Implementation of the Levenshtein algorithm used to calculate distince between strings.
Keywords
Publisher
Description
Sort array of strings by Levenshtein (Sift4) distance
