Hamming Packages

keyword-search

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.

0.1.2 • Published 3 years ago

bktree-fast

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

0.0.7 • Published 1 year ago

hmsearch

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

0.1.0 • Published 7 years ago