A fast and memory efficient implementation of aho-corasick algorithm based on double-array trie (cedar), supports visualizing structure via graphviz.
-
Updated
Aug 4, 2026 - Go
A fast and memory efficient implementation of aho-corasick algorithm based on double-array trie (cedar), supports visualizing structure via graphviz.
High performance Trie and Ahocorasick automata (AC automata) Keyword Match & Replace Tool for python. Correct case insensitive implementation!
Fast compressed trie dictionary library
Fast, offline word source for blink.cmp, based on a double-array trie.
Fast implementation of fuzzy matching and Blacklist filtering
Pure python implementation of DARTS (Double ARray Trie System)
The continuation of me_fasttext (Memory-Efficient FastText, arXiv:2506.01254): exact n-gram identities, compact tables and fast lookup for learned n-gram embeddings.
Implementation of Aho-Corasick algorithm with Double Array Trie data structure.
An updateable dict service, multi-pattern match
Simple Double Array Trie implementation
Toy Natural Language Processing package
General algorighm implements in java
A Rust binding of Double-ARray Trie System (darts-clone)
Double-array trie for Node.js and TypeScript: exact match, common prefix search, keyword replace. Darts/darts-clone compatible
A .NET library providing a collection of high-performance, memory-efficient data structures, primarily focused on various trie implementations and advanced search capabilities. LOUDS, Double Array Trie, and more.
Double array trie implementation of rust
To associate your repository with the double-array-trie topic, visit your repo's landing page and select "manage topics."