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.
Approximate/Fuzzy variable stuff
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 the logarithm base 10 of a small integer.
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.
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.
QuantumMatcher library is a fuzzy matching algorithm that leverages bitwise operations to efficiently find approximate matches within a collection of items.
Annoy Indexing binidings for node.js
Set of functions for efficient implementation of approximate (fuzzy) search
FAISS-based high-performance KNN search addon for Node.js
JavaScript NAPI bindings for faiss
Node.js bindings for faiss
Collection of fuzzy string matching algorithms written in rust
An ESM-compatible TypeScript rewrite of the fuzzaldrin-plus library.
Compute an integer binary logarithm (base two).