Description
JavaScript implementation of the SSIM algorithm
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
Fastest Levenshtein distance implementation.
Keywords
- levenshtein
- distance
- fast
- native
- n-api
- fastest
- edit
- string
- similarity
- algorithm
- match
- addon
- comparison
- fuzzy
- View more
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
Sentence similarity algorithm.
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 implementing different string similarity
Keywords
- strings
- compare similarity
- similarity
- Dice's Coefficient
- Cosine
- Jaccard Index
- Levenshtein
- Longest Common Subsequence
- Metric Longest Common Subsequence
- difference
- compare
- comparision
- similar
- distance
- View more
Publisher
Description
Distance and similarity functions to compare vectors
Keywords
Publisher
Description
Peaks similarity - calculate the similarity between 2 ordered arrays of peaks
Keywords
Publisher
Description
Finds measure of similarity between two strings using Ochiai coefficient.
Keywords
- ochihai
- otsuka
- barkman
- distance
- coefficient
- algo
- algorithm
- string
- strings
- difference
- diff
- similar
- similarity
- compare
- View more
Publisher
Description
Finds degree of similarity between two strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.
Keywords
Publisher
Description
Covectric is a simple vector based search engine using cosine similarity and tf-idf methods for finding text similarity.
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
Returns a difference between two strings using soundex, levenshtein distance or both.
Keywords
Publisher
Description
Validate the structure of Javascript objects using semantic templates. Written as an underscore/lodash mixin.
Keywords
Publisher
Description
Module to compare similarity between strings / arrays.
Keywords
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
How similar are these two strings?
Keywords
Publisher
Description
Find similarity between two strings, based on Dice Similarity Coefficient DSC
Keywords
- string
- string-matching
- similarity
- string-similarity
- string-compare
- dice
- dice-similarity
- javascript
- rn-strings-filter
- rn-string-matching
- rn-strig-compare
- react-native
