Search results
23 packages found
Sort by: Default
- Default
- Most downloaded this week
- Most downloaded this month
- Most dependents
- Recently published
Calculate the hamming distance of two hex strings or buffers
Computes the Hamming distance between two sequences.
- compute.io
- compute
- computation
- hamming
- distance
- similarity
- information theory
- mathematics
- math
- array
- string
- dist
- information
- overlap
- View more
Calculate the Hamming distance between two strings.
A library that focuses on edit distance and similarity algorithms for string
Straightforward fuzzy matching, information retrieval and NLP building blocks for JavaScript.
- bloom filter
- canberra
- caverphone
- chebyshev
- cologne
- cosine
- clustering
- daitch-mokotoff
- dice
- fingerprint
- fuzzy
- hamming
- k-means
- jaccard
- View more
Get Hamming distance between arrays.
Calculate the Hamming distance between two equal-length strings.
Javascript version of hermetrics.py
- hermetrics
- nlp
- similarity metric
- distance metric
- levenshtein
- jaro
- jaro-winkler
- hamming
- osa
- damerau-levenshtein
- jaccard
- dice
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.
small module to calculate if 2 images look alike using perceptual hash Hamming distance and Levenshtein distance
Calculate the Levenshtein distance between two strings.
Given 2 arrays, hamming distance is calculated between them.
- hamming
- distance
- ist
- tecnico
- luis
- rita
- warcraft12321
- community
- finding
- phylogenetic
- networks
- application
- biomedical
- engineering
Returns true if the hamming distance between two strings or arrays of equal length is smaller than the given limit
A JS module for calculating several distances between two (n-dimensional) points
Applies a windowing function to an array of data, making it ready to be FFT'd.
- fft
- fourier
- windowing
- hann
- hamming
- cosine
- lanczos
- gaussian
- tukey
- blackman
- exact_blackman
- kaiser
- nuttall
- blackman_harris
- View more
Efficiently find hashes within a certain hamming distance, typically used for perceptual hashing.
Applies a windowing function to an array of data, making it ready to be FFT'd.
- fft
- fourier
- windowing
- hann
- hamming
- cosine
- lanczos
- gaussian
- tukey
- blackman
- exact_blackman
- kaiser
- nuttall
- blackman_harris
- View more
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
TypeScript library spectral analysis such as PSD and FFT
- fft
- fast-fourier-transform
- digital-signal-processing
- fourier
- psd
- spectrometry
- spectral-analysis
- dsp
- windowing
- hann
- hamming
- cosine
- lanczos
- gaussian
- View more
extended hamming code