JSPM

Straightforward fuzzy matching, information retrieval and NLP building blocks for JavaScript.

Calculate the hamming distance of two hex strings or buffers

Applies a windowing function to an array of data, making it ready to be FFT'd.

Javascript version of hermetrics.py

Applies a windowing function to an array of data, making it ready to be FFT'd.

Calculate the Hamming distance between two strings.

Computes the Hamming distance between two sequences.

Determine whether a given query string contains keywords in a given item string, with a specified margin for spelling error based on the hamming distance.

High-performance and memory efficient native C++ text similarity algorithms for Node.js

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

TypeScript library spectral analysis such as PSD and FFT

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

extended hamming code

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

As an example, a common strategy for de-duplicating images is to compute perceptual hashes for each of the images and compare those hashes with each other. Such hashes are small compared with the images (often 32, 64, 128 bits). If the hashing function is

Given 2 arrays, hamming distance is calculated between them.

Calculate the Levenshtein distance between two strings.

TypeScript/JavaScript implementation of Hamming Backups: A 2-of-3 variant of SeedXOR

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

Node.js implementation of a sample framer (Array or Buffer) and signal windowing functions (e.g. Hamming).

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

Calculate the Hamming distance between two equal-length strings.

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

Get Hamming distance between arrays.

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