golombcodedsets
Golomb-coded sets (GCS) is a probabilistic data structure conceptually similar to the famous Bloom filters, but with a more compact in-memory representation, and a slower query time.
Golomb-coded sets (GCS) is a probabilistic data structure conceptually similar to the famous Bloom filters, but with a more compact in-memory representation, and a slower query time.
Math approximation tools (TypeScript)
Give me an approximate number around this one (for setTimeout/setInterval etc).
function approximation on a set of segments
Fast approximate hash for large objects
Approximate/Fuzzy variable stuff
Textile's Streaming Approximate Histograms
Javascript fuzzy matching, scoring, sorting, and approximating library
This package adds new features to the mongodb database through the use of fuzzy techniques and approximate string matching.
Golomb-coded sets (GCS) is a probabilistic data structure conceptually similar to the famous Bloom filters, but with a more compact in-memory representation, and a slower query time.
Approximate the logarithm base 10 of a small integer.
Annoy Indexing binidings for node.js
Set of functions for efficient implementation of approximate (fuzzy) search
Collection of fuzzy string matching algorithms written in rust
An ESM-compatible TypeScript rewrite of the fuzzaldrin-plus library.
FAISS-based high-performance KNN search addon for Node.js
JavaScript NAPI bindings for faiss
Node.js bindings for faiss
QuantumMatcher library is a fuzzy matching algorithm that leverages bitwise operations to efficiently find approximate matches within a collection of items.
Compute an integer binary logarithm (base two).