Alternatives and similar repositories for PyFastPFor

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

• glitzflitz / pyxorfilter
  Python bindings for xorfilter(faster and smaller than bloom and cuckoo filters)
  ☆116Updated last month
• 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
• QratorLabs / pysdsl
  Python bindings to Succinct Data Structure Library 2.0
  ☆33Updated 6 years ago
• ekzhu / lshensemble
  LSH index for approximate set containment search
  ☆59Updated 3 years ago
• pytries / hat-trie
  HAT-Trie for Python
  ☆86Updated 9 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 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.
  ☆252Updated last week
• explosion / preshed
  💥 Cython hash tables that assume keys are pre-hashed
  ☆85Updated 4 months ago
• Blosc / bloscpack
  Command line interface to and serialization format for Blosc
  ☆123Updated 2 years ago
• explosion / murmurhash
  💥 Cython bindings for MurmurHash2
  ☆44Updated 2 weeks ago
• DataDog / sketches-py
  Python implementations of the distributed quantile sketch algorithm DDSketch
  ☆88Updated 5 months ago
• lemire / fastrand
  Fast random number generation in an interval in Python: Up to 10x faster than random.randint.
  ☆117Updated last month
• s-yata / madoka
  Count-Min sketch-based approximate counting library
  ☆45Updated 4 months ago
• stanford-futuredata / wmsketch
  Sketching linear classifiers over data streams with the Weight-Median Sketch (SIGMOD 2018).
  ☆39Updated 7 years ago
• simongog / surf
  SUccinct Retrieval Framework
  ☆21Updated 9 years ago
• mjpost / bin
  bin files
  ☆13Updated 8 months ago
• fujimotos / mbleven
  An efficient algorithm for k-bounded (Damerau-)Levenshtein distance
  ☆16Updated 6 years ago
• jjfiv / fastrank
  My most frequently used learning-to-rank algorithms ported to rust for efficiency. Try it: "pip install fastrank".
  ☆52Updated 7 months ago
• LightTag / ALMa
  ALMa (Active Learning Manager) Keeps track of labeled and unlabeled data for active learning
  ☆42Updated 5 years ago
• cceh / suffix-tree
  A Generalized Suffix Tree for any Python iterable using Ukkonen's algorithm, with Lowest Common Ancestor retrieval.
  ☆53Updated last year
• onfido / faiss_prebuilt
  Prebuilt .whl files for MacOS + Linux of the Facebook FAISS library
  ☆56Updated 3 years ago
• ezelikman / Context-Is-Everything
  Official details for: [1803.08493] Context is Everything: Finding Meaning Statistically in Semantic Spaces
  ☆39Updated 6 years ago
• dataplayer12 / Fly-LSH
  An implementation of efficient LSH inspired by fruit fly brain
  ☆87Updated 6 years ago
• osirrc / ciff
  Common Index File Format to to support interoperability between open-source IR engines
  ☆39Updated last year
• wangyi-fudan / wyHLL
  The dream accurate approximate set cardinality estimator based on 3-bit HyperLogLog. More accurate than Redis HyperLogLog.
  ☆55Updated 4 years ago
• pauldmccarthy / indexed_gzip
  Fast random access of gzip files in Python
  ☆111Updated 3 weeks ago
• atom-moyer / getpy
  A Vectorized Python Dict/Set
  ☆118Updated 2 years ago
• migumar2 / uiHRDC
  Suite of universal indexes for Highly Repetitive Document Collections
  ☆20Updated 5 years ago
• bloomberg / koan
  A word2vec negative sampling implementation with correct CBOW update.
  ☆260Updated 3 years ago