distance-sensitive-hash/package.json

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.

{
  "name": "distance-sensitive-hash",
  "version": "1.0.0",
  "description": "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.",
  "main": "index.js",
  "type": "module",
  "directories": {
    "test": "test",
    "doc": "docs",
    "benchmark": "benchmarks"
  },
  "files": [
    "index.js",
    "README.md"
  ],
  "scripts": {
    "test": "tap test/**/*.test.js",
    "benchmark": "node benchmarks/index.js",
    "example": "node example.js"
  },
  "repository": {
    "type": "git",
    "url": "git+https://github.com/JDvorak/distance-sensitive-hash.git"
  },
  "keywords": [
    "lsh",
    "e2lsh",
    "euclidean-distance",
    "count-sketch",
    "hcs",
    "higher-order-count-sketch",
    "hashing",
    "similarity",
    "locality-sensitive-hashing",
    "vector-similarity",
    "embeddings",
    "fingerprinting",
    "fast-search",
    "memory-efficient",
    "recommendations",
    "product-similarity",
    "image-similarity",
    "text-similarity",
    "audio-fingerprinting",
    "high-dimensional",
    "approximate-similarity",
    "microsecond-search",
    "distance-estimation",
    "euclidean-similarity",
    "vector-compression",
    "fast-approximation"
  ],
  "author": "John Dvorak <john@johnsdvorak.com>",
  "license": "MIT",
  "bugs": {
    "url": "https://github.com/JDvorak/distance-sensitive-hash/issues"
  },
  "homepage": "https://github.com/JDvorak/distance-sensitive-hash#readme",
  "devDependencies": {
    "tap": "^18.0.0"
  }
}