Similarity Packages

Measure the difference between two strings using the Levenshtein distance algorithm

[](https://www.npmjs.com/package/levenary) [](https://github.com/tanhauhau/levenary/actions)

Fastest Levenshtein distance implementation in JS.

The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.

Finds degree of similarity between strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.

Image structural similarity (SSIM). In TypeScript/JavaScript. For browser/server.

JavaScript implementation of the SSIM algorithm

a library for matching human-quality input to a list of potential matches using the Levenshtein distance algorithm

The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.

A collection of string matching algorithms built with React Select in mind

How similar are these two strings?

Computes the cosine similarity between two arrays.

A library implementing different string similarity

Tool for grouping objects by similarity.

Calculate the cosine distance between arrays

Computes the Hamming distance between two sequences.

Calculates cosine similarity between 2 strings.

Distance and similarity functions to compare vectors

Image multi-scale structural similarity (MS-SSIM). In TypeScript/JavaScript. For browser/server.

Simply sort by similarity, starring Levenshtein via leven