Search results
171 packages found
Pure Javascript/Node.js in-memory full text search engine.
Dynamic word set with accelerated exact and fuzzy search based on trie data structure.
A simple ES6 proxy wrapper that enables you to make typos in property names.
Fuzzy string matching algorithms and utilities, port of the TheFuzz Python library.
Efficient implementation of Levenshtein algorithm with locale-specific collator support.
JavaScript port of the fast Damerau-Levenshtein string distance calculation algorithm used in Git
A lib to compare similarity of two strings
- string similarity
- edit distance
- levenshtein
- levenshtein distance
- lcs
- longest common subsequence
- simhash
- hamming distance
A Search library, with integrated threshhold.
Compare Strings Similarity Based on Levenshtein Distance Algorithm
- leven
- levenshtein
- algo
- algorithm
- string
- strings
- difference
- diff
- similar
- similarity
- compare
- comparison
- match
- matching
Use Levenshtein distance alg to find the most similar word in an array to the target word Edit
Suggests which tasks you wanted to call unless you made a typo
To find similarity between two words/string
- similarity
- words
- string
- string-smiliarity
- word-similarity
- words-similarity
- strings-similarity
- levenshtein
- damerau
- damerau-levenshtein
- compare
- compare-strings
- compare-string
- compare-words
Fast search for big arrays
Measure the difference between two strings using the Levenshtein distance algorithm
- cli-app
- cli
- leven
- levenshtein
- distance
- algorithm
- string
- difference
- diff
- fast
- fuzzy
- similar
- similarity
- compare
- View more
Compare the difference between two strings using Levenshtein Distance. Returns a number 0 to 1 showing exactly how related the two strings are.
Finds degree of similarity between two strings, based on Dice's Coefficient and Levenshtein Distance.
Ensemble de methodes prototypes utiles
@magic library to calculate levenshtein distances.
Finds degree of similarity between strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.
Efficient implementation of Levenshtein algorithm with locale-specific collator support.