Lightning-fast cosine similarity search using locality-sensitive hashing. Compress high-dimensional vectors into tiny fingerprints for 10× faster similarity search with 99% less memory usage.
Locality-Sensitive Hashing implementation for indexing vectors using random projections
TypeScript implementation of the SuperMinHash algorithm for Jaccard similarity estimation
Lightning-fast Euclidean distance search using locality-sensitive hashing. Compress high-dimensional vectors into tiny fingerprints for 10× faster similarity search with 99% less memory usage.