SimHash
Definition
SimHash generates short digital fingerprints to compare similar content with each other.
SimHash maps weighted features via random hyperplanes onto a binary fingerprint. Similar feature vectors are likely to have a small Hamming distance.
Simply explained
Similar content receives similar bit patterns; comparing these patterns helps find similarities.
Why it matters in practice
The term improves reliable access to data and knowledge as well as their usable linkage in digital systems.
Example from business
A search system recognizes nearly identical documents even though individual words or sequences differ.
Limits and pitfalls
- Confusing SimHash with MinHash or a cryptographic hash, treating collisions as proof of identity, or not validating feature selection and weighting.
Origin & history
Charikar described similarity estimations with random projections in 2002; Google published the use of SimHash in 2007 to detect nearly identical web pages.
Use in mid-sized companies
- Possible application: A search system recognizes nearly identical documents even though individual words or sequences differ.
Frequently asked questions
What does SimHash mean?
SimHash maps weighted features via random hyperplanes onto a binary fingerprint. Similar feature vectors are likely to have a small Hamming distance. What mistakes should be avoided? Confusing SimHash with MinHash or a cryptographic hash, treating collisions as proof of identity, or not validating feature selection and weighting.
Sources
- Similarity Estimation Techniques from Rounding Algorithms · Charikar, Similarity Estimation Techniques from Rounding Algorithms
- Detecting Near-Duplicates for Web Crawling · Manku et al., Detecting Near-Duplicates for Web Crawling
Source checked on 10.10.2026. Editorial application examples are hypothetical; no evidence of real customer results.
Editorially reviewed on: