JSPM

Collection complète d'algorithmes de similarité textuelle et moteur de génération aléatoire avancé

A JS module for calculating several distances between two (n-dimensional) points

A library that focuses on edit distance and similarity algorithms for string

hamming-code allows you to encode and decode binary strings codes with hamming code algorithm

Get Hamming distance between arrays.

Calculate the Levenshtein distance between two strings.

Given 2 arrays, hamming distance is calculated between them.

Efficiently find hashes within a certain hamming distance, typically used for perceptual hashing.

Returns true if the hamming distance between two strings or arrays of equal length is smaller than the given limit

small module to calculate if 2 images look alike using perceptual hash Hamming distance and Levenshtein distance