pytries / hat-trieLinks
HAT-Trie for Python
☆87Updated 10 years ago
Alternatives and similar repositories for hat-trie
Users that are interested in hat-trie are comparing it to the libraries listed below
Sorting:
- C++ Ternary Search Tree implementation with Python bindings☆43Updated 8 years ago
- Roaring Bitmap in Cython☆82Updated last year
- An efficient, immutable, persistent mapping object☆98Updated 6 years ago
- DAFSA-based dictionary-like read-only objects for Python. Based on `dawgdic` C++ library.☆305Updated last year
- Non-Overlapping Aho-Corasick Python extension, for Python 2 (str and unicode) and Python 3☆51Updated 10 years ago
- 💥 Cython hash tables that assume keys are pre-hashed☆87Updated last month
- A partially and lazily sorted list data structure for Python☆125Updated 5 years ago
- This is a Python binding to the tokenizer Ucto. Tokenisation is one of the first step in almost any Natural Language Processing task, yet…☆31Updated last week
- Implementation of Bayesian Sets for fast similarity searches.☆14Updated 14 years ago
- Locality-sensitive hashing algorithm for text similarity comparisons☆59Updated 10 months ago
- embedded graph datastore☆185Updated 7 years ago
- Pure-python reader for DAWGs created by dawgdic C++ library or DAWG Python extension.☆50Updated 2 years ago
- Python collections supporting parallel map/reduce style methods☆40Updated 2 years ago
- Implementation of Burkhard-Keller trees in various languages☆52Updated 15 years ago
- Pure Python CDB reader/writer☆45Updated 2 months ago
- Fast Python bindings to Sophia Database☆81Updated last month
- ☆86Updated 2 months ago
- MapReduce platform in python☆34Updated 10 years ago
- unofficial git mirror of http://svn.whoosh.ca svn repo☆49Updated 16 years ago
- fast online statistics collection☆78Updated 6 months ago
- A simple proof of concept levenshtein automaton in Python☆108Updated 10 years ago
- 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
- Low-Level Data Structure - efficient data structures, and fast data access in the 3.x/4.x/5.x/6.x kernel☆121Updated 2 years ago
- A memory-based, optional-persistence naïve bayesian text classifier.☆36Updated 10 years ago
- A tool to segment text based on frequencies and the Viterbi algorithm "#TheBoyWhoLived" => ['#', 'The', 'Boy', 'Who', 'Lived']☆81Updated 9 years ago
- Fast HyperLogLog for Python.☆110Updated 5 months ago
- Python bindings for RocksDB☆150Updated 4 years ago
- An efficient approximation for tree edit-distance.☆45Updated 14 years ago
- implementations of a counting bloom, a timing bloom and a scaling timing bloom... made for working with streams!☆42Updated 9 years ago
- A column oriented, embarrassingly distributed relational event database.☆238Updated 7 years ago