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
  ☆59Updated 8 months ago
• QratorLabs / pysdsl
  Python bindings to Succinct Data Structure Library 2.0
  ☆34Updated 6 years ago
• glitzflitz / pyxorfilter
  Python bindings for xorfilter(faster and smaller than bloom and cuckoo filters)
  ☆118Updated 2 months ago
• dncc / qpick
  Search for similar short strings
  ☆53Updated 5 years ago
• jermp / tongrams
  A C++ library providing fast language model queries in compressed space.
  ☆132Updated 2 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.
  ☆254Updated last week
• src-d / minhashcuda
  Weighted MinHash implementation on CUDA (multi-gpu).
  ☆121Updated last year
• hpclab / quickscorer
  Official repository of Quickscorer: a fast algorithm to rank documents with additive ensembles of regression trees.
  ☆18Updated 9 years ago
• kootenpv / shrynk
  Using Machine Learning to learn how to Compress
  ☆113Updated 2 years ago
• onfido / faiss_prebuilt
  Prebuilt .whl files for MacOS + Linux of the Facebook FAISS library
  ☆56Updated 3 years ago
• explosion / murmurhash
  💥 Cython bindings for MurmurHash2
  ☆44Updated last month
• pytries / hat-trie
  HAT-Trie for Python
  ☆86Updated 9 years ago
• mjpost / bin
  bin files
  ☆13Updated 9 months ago
• Blosc / bloscpack
  Command line interface to and serialization format for Blosc
  ☆123Updated 3 years ago
• jjfiv / fastrank
  My most frequently used learning-to-rank algorithms ported to rust for efficiency. Try it: "pip install fastrank".
  ☆52Updated 8 months ago
• DataDog / sketches-py
  Python implementations of the distributed quantile sketch algorithm DDSketch
  ☆89Updated 6 months 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 2 years ago
• explosion / preshed
  💥 Cython hash tables that assume keys are pre-hashed
  ☆87Updated last week
• LightTag / ALMa
  ALMa (Active Learning Manager) Keeps track of labeled and unlabeled data for active learning
  ☆42Updated 5 years ago
• simongog / surf
  SUccinct Retrieval Framework
  ☆21Updated 9 years ago
• migumar2 / uiHRDC
  Suite of universal indexes for Highly Repetitive Document Collections
  ☆20Updated 5 years ago
• bbayles / python-pure-cdb
  Pure Python CDB reader/writer
  ☆45Updated last year
• lemire / fastrand
  Fast random number generation in an interval in Python: Up to 10x faster than random.randint.
  ☆119Updated 3 weeks ago
• ekzhu / lshensemble
  LSH index for approximate set containment search
  ☆60Updated 3 years ago
• s-yata / madoka
  Count-Min sketch-based approximate counting library
  ☆46Updated 6 months ago
• osirrc / ciff
  Common Index File Format to to support interoperability between open-source IR engines
  ☆39Updated last year
• HazyResearch / epoxy
  Interactive Model Iteration with Weak Supervision and Pre-Trained Embeddings
  ☆77Updated 3 years ago
• byronknoll / lstm-compress
  Data compression using LSTM
  ☆136Updated 2 years ago
• julesjacobs / levenshtein
  A simple proof of concept levenshtein automaton in Python
  ☆108Updated 10 years ago
• AWNystrom / DiskDict
  A disk-based key/value store in Python with no dependencies.
  ☆21Updated 10 years ago