Alternatives and similar repositories for hat-trie

Users that are interested in hat-trie are comparing it to the libraries listed below

• discoproject / discodb
  An efficient, immutable, persistent mapping object
  ☆98Updated 6 years ago
• andreasvc / roaringbitmap
  Roaring Bitmap in Cython
  ☆81Updated last year
• dokipen / whoosh
  unofficial git mirror of http://svn.whoosh.ca svn repo
  ☆49Updated 15 years ago
• naftaliharris / lazysort
  A partially and lazily sorted list data structure for Python
  ☆124Updated 5 years ago
• pytries / DAWG-Python
  Pure-python reader for DAWGs created by dawgdic C++ library or DAWG Python extension.
  ☆49Updated last year
• JDonner / NoAho
  Non-Overlapping Aho-Corasick Python extension, for Python 2 (str and unicode) and Python 3
  ☆51Updated 9 years ago
• gtoonstra / remap
  MapReduce platform in python
  ☆34Updated 9 years ago
• pytries / DAWG
  DAFSA-based dictionary-like read-only objects for Python. Based on `dawgdic` C++ library.
  ☆302Updated 11 months ago
• explosion / preshed
  💥 Cython hash tables that assume keys are pre-hashed
  ☆87Updated last week
• coleifer / sophy
  Fast Python bindings to Sophia Database
  ☆81Updated 7 months ago
• pombredanne / SimSearch
  Implementation of Bayesian Sets for fast similarity searches.
  ☆14Updated 13 years ago
• diffeo / py-nilsimsa
  Locality-sensitive hashing algorithm for text similarity comparisons
  ☆58Updated last month
• nlehuen / pytst
  C++ Ternary Search Tree implementation with Python bindings
  ☆43Updated 7 years ago
• vstinner / faulthandler
  Fault handler for Python: display the Python backtrace on SIGSEGV, SIGFPE, SIGABRT, SIGBUS and SIGILL signals
  ☆99Updated 5 years ago
• ikegami-yukino / madoka-python
  Memory-efficient Count-Min Sketch Counter (based on Madoka C++ library)
  ☆26Updated 6 years ago
• mynameisfiber / fuggetaboutit
  implementations of a counting bloom, a timing bloom and a scaling timing bloom... made for working with streams!
  ☆42Updated 8 years ago
• njsmith / zs
  ZS is a compressed, read-only file format for efficiently distributing, querying, and archiving arbitrarily large record-oriented dataset…
  ☆46Updated 9 years ago
• ahupp / bktree
  Implementation of Burkhard-Keller trees in various languages
  ☆52Updated 15 years ago
• steeve / python-lz4
  LZ4 bindings for python
  ☆106Updated 9 years ago
• mattandahalfew / Levenshtein_search
  Python search module for fast approximate string matching
  ☆54Updated 2 years ago
• rjpower / falcon
  C Python, made faster.
  ☆341Updated 9 years ago
• scrapinghub / aduana
  Frontera backend to guide a crawl using PageRank, HITS or other ranking algorithms based on the link structure of the web graph, even whe…
  ☆55Updated last year
• alex / zero_buffer
  zero_buffer is a high-performance, zero-copy, implementation of a byte-buffer for Python.
  ☆135Updated 8 years ago
• brentp / fastbit-python
  pythonic access to fastbit
  ☆26Updated 6 years ago
• fastforwardlabs / cuckoofilter
  ☆40Updated 8 years ago
• dcjones / hat-trie
  An efficient trie implementation.
  ☆255Updated 4 years ago
• wharris / libesm
  C library for efficient string matching with Aho-Corasick
  ☆21Updated 13 years ago
• zopefoundation / BTrees
  ☆81Updated 2 months ago
• proycon / python-ucto
  This is a Python binding to the tokenizer Ucto. Tokenisation is one of the first step in almost any Natural Language Processing task, yet…
  ☆29Updated 5 months ago
• gterzian / Python-Parallel-Collections
  Python collections supporting parallel map/reduce style methods
  ☆40Updated last year