Fast and memory efficient Trie implementation for Python
An efficient C++ incremental parser for multi-choices grammars (generalization of the trie structure) with Python bindings.
Python package for lexicon
treg utilizes trie structured regex patterns to search texts for a potientially large number of words and phrases.
Welcome to coding in paradise!
Efficient lexicon data structures: Trie and DAWG
Boundary-aware fuzzy keyword matching with pluggable conflict resolution
Python bindings for WaveDB - Hierarchical B+Trie Database
Thin Python bindings for the C++ MARISA Trie library implemented using SWIG.
A Package for a trie class that autocompletes words
.sigdb trie/Aho–Corasick compiler and loader
Lekka odmiana polskich rzeczowników przez przypadki (dane SGJP, indeks marisa-trie, mmap).
An opinionated HTTP/WebSocket router for without-asgi: trie matching, typed path params, 405-vs-404, mounting, and OpenAPI.
Get repeated capture groups, search without having to fear Exceptions in any df/Series, convert results to appropriate dtypes, use fast Trie regex
Cython wrapper for tkvdb radix trie key-value database
GRID Rust kernels (DESIGN.md SS2): incremental-state trie walk
Pure-Python radix tree implementation
Beam-search inference engine for generative recommendation (SID decoding with trie constraints).
Python datastructures package
A grounded, no-LLM AI engine that verifies factual answers, abstains rather than confabulating, and can act — tool calling and sandboxed execution on a verified-answer core.
Python high performance TLD extract module based on a compressed trie with builtin python dict.
A python package that uses a compressed prefix tree (radix tree) to store a dictionary of known words and suggests completions for partial entries.
Deterministic Unicode-aware dictionary matching
A comprehensive, zero-dependency collection of fundamental data structures for Python
A friendly interactive sandbox to learn and execute core algorithms from scratch.
Production-grade data structures and algorithms — a modern alternative to Python's collections
An autocomplete program that gives suggestions
Fast and flexible search in a dictionary using Levenshtein distance
A simlpe Merkle Patricia Trie implementation
A pure Python prefix tree (trie) for fast in-memory prefix search and filtering
DoubleArrayTrie(DAT) support prefix search & exact search & multiple pattern match for python implemented by c++
PyTorch-native octonionic algebra for ML research
Skew-Phase Law (SWPL) — data structure selection under Zipf workloads + optimal zeta-Trie
tricli manages a trie data structure that can be globally accessed.
Trie for slingshot takehome.
Advanced data structures for Python.
Local, typo-tolerant search-box autocomplete for Python apps without Elasticsearch, Meilisearch, Algolia, or Typesense.
Navigate and build tries using Python attribute syntax.
Data structures the stdlib leaves out: Bloom filter, Trie, union-find (disjoint set), ring buffer. Pure Python, zero dependencies.
Build and render a Trie from newline-separated input using Graphviz.
AVL Tree, Interval Tree, Trie and More. All kinds of Trees implemented in python3.