array-edit-steps
Find the difference between two arrays and compute the minimal steps to transform one array to another.
Find the difference between two arrays and compute the minimal steps to transform one array to another.
Find similarity between two strings, based on Dice Similarity Coefficient DSC
Library used to find degrees of similarity between text's phonetics. Uses double-methaphone and accounts for numbers.
Simple text similarity module
Code similarity detection based on the Winnowing algorithm
Very simple package for measuring the similarity of two sets by their shared members.
Compare Strings Similarity Based on Levenshtein Distance Algorithm
Sorts a list of strings by the similarity of the search value and filter with it
String comparison without caring for order of letters
Recomm.js is a javascript library used to build recommendation systems, using Content-Based Filtering System.
A simple kNN library for Machine Learning, comparing JSON objects using Euclidean distances, returning top k similar objects -- supports normalization, weights, key and filter parameters
string extrapolated relations based on string similarity range between 0 and 1
String's percent similarity
An optimized port of the SimMetrics Java library
Measure the difference between two strings using the Levenshtein distance algorithm
similarity based on Levenshtein distance
Computes the Minkowski distance between two arrays.
Covectric is a simple vector based search engine using cosine similarity and tf-idf methods for finding text similarity.
Computation of distance between words with Jaro-Winkler algorithm
SuggestGrid JavaScript Clients