Search results
24 packages found
Calculate the Hamming distance between two equal-length strings.
Calculate the hamming distance of two hex strings or buffers
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
Distance/Similarity functions for Bag of Words, Strings, Numbers, Dates and Vectors.
- Distance
- Similarity
- NLP
- Bag of Words
- Strings
- Vectors
- Chebyshev
- Cosine
- Hamming
- Jaccard
- Jaro
- Manhattan
- Soundex
- Tversky
- View more
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
Javascript version of hermetrics.py
- hermetrics
- nlp
- similarity metric
- distance metric
- levenshtein
- jaro
- jaro-winkler
- hamming
- osa
- damerau-levenshtein
- jaccard
- dice
TypeScript/JavaScript implementation of Hamming Backups: A 2-of-3 variant of SeedXOR
Get Hamming distance between arrays.
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
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
small module to calculate if 2 images look alike using perceptual hash Hamming distance and Levenshtein distance
A JS module for calculating several distances between two (n-dimensional) points
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.
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
Calculate the Hamming distance between two strings.
Calculate the Levenshtein distance between two strings.
Some algorithms to compare strings.
Efficiently find hashes within a certain hamming distance, typically used for perceptual hashing.