Alternatives and similar repositories for PyFastPFor

Users that are interested in PyFastPFor are comparing it to the libraries listed below

• puffinn / puffinn
  Parameterless and Universal FInding of Nearest Neighbors
  ☆60Updated 5 months ago
• glitzflitz / pyxorfilter
  Python bindings for xorfilter(faster and smaller than bloom and cuckoo filters)
  ☆117Updated 2 months ago
• QratorLabs / pysdsl
  Python bindings to Succinct Data Structure Library 2.0
  ☆33Updated 6 years ago
• dncc / qpick
  Search for similar short strings
  ☆52Updated 4 years ago
• jermp / tongrams
  A C++ library providing fast language model queries in compressed space.
  ☆132Updated 2 years ago
• hpclab / quickscorer
  Official repository of Quickscorer: a fast algorithm to rank documents with additive ensembles of regression trees.
  ☆18Updated 9 years ago
• KeyviDev / keyvi
  Keyvi - the key value index. It is an in-memory FST-based data structure highly optimized for size and lookup performance.
  ☆250Updated last week
• andreasvc / roaringbitmap
  Roaring Bitmap in Cython
  ☆81Updated last year
• osirrc / ciff
  Common Index File Format to to support interoperability between open-source IR engines
  ☆38Updated 11 months ago
• jjfiv / fastrank
  My most frequently used learning-to-rank algorithms ported to rust for efficiency. Try it: "pip install fastrank".
  ☆52Updated 5 months ago
• explosion / preshed
  💥 Cython hash tables that assume keys are pre-hashed
  ☆84Updated 2 months ago
• simongog / surf
  SUccinct Retrieval Framework
  ☆21Updated 9 years ago
• s-yata / madoka
  Count-Min sketch-based approximate counting library
  ☆45Updated 3 months ago
• granne / granne
  Graph-based Approximate Nearest Neighbor Search
  ☆320Updated last year
• DataDog / sketches-py
  Python implementations of the distributed quantile sketch algorithm DDSketch
  ☆88Updated 3 months ago
• pytries / DAWG
  DAFSA-based dictionary-like read-only objects for Python. Based on `dawgdic` C++ library.
  ☆303Updated last year
• stanford-futuredata / wmsketch
  Sketching linear classifiers over data streams with the Weight-Median Sketch (SIGMOD 2018).
  ☆39Updated 7 years ago
• mjpost / bin
  bin files
  ☆13Updated 6 months ago
• src-d / minhashcuda
  Weighted MinHash implementation on CUDA (multi-gpu).
  ☆119Updated last year
• explosion / murmurhash
  💥 Cython bindings for MurmurHash2
  ☆44Updated 3 months ago
• bloomberg / koan
  A word2vec negative sampling implementation with correct CBOW update.
  ☆260Updated 3 years ago
• dataplayer12 / Fly-LSH
  An implementation of efficient LSH inspired by fruit fly brain
  ☆87Updated 6 years ago
• mmihaltz / pysettrie
  python3 package supporting efficient storage and querying of sets of sets using the trie data structure. Supports finding all the superse…
  ☆23Updated last year
• edoliberty / streaming-quantiles
  Implements the Karnin-Lang-Liberty (KLL) algorithm in python
  ☆58Updated 2 years ago
• ezelikman / Context-Is-Everything
  Official details for: [1803.08493] Context is Everything: Finding Meaning Statistically in Semantic Spaces
  ☆39Updated 6 years ago
• HazyResearch / epoxy
  Interactive Model Iteration with Weak Supervision and Pre-Trained Embeddings
  ☆77Updated 3 years ago
• atom-moyer / getpy
  A Vectorized Python Dict/Set
  ☆118Updated 2 years ago
• Blosc / bloscpack
  Command line interface to and serialization format for Blosc
  ☆123Updated 2 years ago
• cceh / suffix-tree
  A Generalized Suffix Tree for any Python iterable using Ukkonen's algorithm, with Lowest Common Ancestor retrieval.
  ☆52Updated last year
• lemire / fastrand
  Fast random number generation in an interval in Python: Up to 10x faster than random.randint.
  ☆115Updated 3 months ago