JSPM

Calculate the hamming distance of two hex strings or buffers

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

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

Javascript version of hermetrics.py

Rust-powered fuzzy search and string distance for JavaScript/TypeScript. 10-50x faster than fuse.js/leven.

Window functions for signal processing and spectral analysis

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

Calculate the Hamming distance between two strings.

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

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.

extended hamming code

Hamming distance utilities and LSH binary projection for TypeScript

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

Computes the Hamming distance between two sequences.

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

TypeScript library spectral analysis such as PSD and FFT

Detect duplicate records using Hamming distance

Fixed-chunk dedup + entropy compression with ECC protection and C native acceleration (MSH1 format)

Calculate the Hamming distance between two equal-length strings.

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

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