Search results
75 packages found
Finds measure of similarity/distance between two input sets.
- set
- sorensen
- dice
- jaccard
- ochiai
- otsuka
- barkman
- overlap
- levenshtein
- edit-distance
- euclidean
- distance
- coefficient
- algorithm
- View more
String's percent similarity
Computes the Hamming distance between two sequences.
- compute.io
- compute
- computation
- hamming
- distance
- similarity
- information theory
- mathematics
- math
- array
- string
- dist
- information
- overlap
- View more
Finds degree of similarity between strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.
- strings
- similar
- difference
- similarity
- compare
- comparison
- degree
- match
- matching
- dice
- levenshtein
- percentage
- score
- algorithm
- View more
compute and verify string similarity
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
Text diff algorithm based on 'An O(NP) Sequence Comparison Algorithm' from Sun Wu, Udi Manber and Gene Myers
Jaro-Winkler typescript implementation
Simply sort by similarity, starring Levenshtein via leven
- sort
- leven
- levenshtein
- distance
- algorithm
- algo
- string
- difference
- diff
- fast
- fuzzy
- similar
- similarity
- compare
- View more
compare the similarity of two string
A collection of string matching algorithms built with React Select in mind
- distance
- filter
- fuzzy
- Jaro-Winkler
- Levenshtein
- match
- options
- proximity
- search
- similar
- similarity
- string
- subsequence
- substitutions
- View more
Computes the Tversky index between two sequences.
Color a given set of N strings into a set of M<N color classes
Get string similarity in JavaScript or TypeScript
- string similarity
- similarity
- string
- strings
- metric
- jaro-winkler
- Levenshtein
- Normalized
- NormalizedLevenshtein
- Normalized Levenshtein
- Weighted
- WeightedLevenshtein
- Weighted Levenshtein
- Damerau
- View more
Calculates cosine similarity between 2 strings.
String and tree edit distance
Fastest implementation of Sørensen–Dice coefficient.
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
Package that check similarity of string
A fork of js-levenshtein by gustf adding a limit to the distance calculation.
- levenshtein
- distance
- algorithm
- algo
- string
- difference
- diff
- fast
- fuzzy
- similar
- similarity
- compare
- comparison
- edit
- View more