Search results
178 packages found
A lightweight, rule-based text similarity calculator that selects the most appropriate comparison algorithm based on input string lengths.
Straightforward fuzzy matching, information retrieval and NLP building blocks for JavaScript.
- bloom filter
- canberra
- caverphone
- chebyshev
- cologne
- cosine
- clustering
- daitch-mokotoff
- dice
- fingerprint
- fuzzy
- hamming
- k-means
- jaccard
- View more
A package to search dances with fuzzy matching
Modded version of string-similarity.
A minimal algorithm for computing Levenshtein distance in JavaScript.
Set of functions for efficient implementation of approximate (fuzzy) search
Group similar items together.
- algorithm
- cluster
- compare
- comparison
- disjoint-set
- edit-distance
- fuzzy
- group
- group-similar
- grouping
- levenshtein
- match
- matching
- merge-find
- View more
Various utilities regarding Levenshtein transducers.
- javascript
- coffeescript
- levenshtein
- distance
- metric
- spelling correction
- fuzzy search
- approximate string matching
- automata
- transducer
- information retrieval
🚀 The fastest and easiest「didyoumean」in the universe via levenshtein algorithm
Fuzzy string matching algorithms and utilities, port of the TheFuzz Python library.
Simply sort by similarity, starring Levenshtein via leven
- sort
- leven
- levenshtein
- distance
- algorithm
- algo
- string
- difference
- diff
- fast
- fuzzy
- similar
- similarity
- compare
- View more
this package lets you compare two strings and give you how much percent they are similar
- strings
- similar
- difference
- similarity
- compare
- comparison
- degree
- match
- matching
- dice
- levenshtein
- percentage
- score
- algorithm
- View more
Morph one word into another, one letter at a time
Give me a word and I’ll give you an array of words that differ by a single letter
Measure how similar two strings are using the Sørensen–Dice Coefficient
- closest
- coefficient
- compare
- comparison
- Dice
- difference
- index
- Levenshtein
- match
- matching
- measure
- nearest
- similar
- similarity
- View more
A lightweight implementation of the Levenshtein distance algorithm.
Levenshtein distance for an array.
Sort array of strings by Levenshtein (Sift4) distance
Return all word matches between two arrays within given Levenshtein distance
Finds degree of similarity between strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.