A fast and memory efficient implementation of aho-corasick algorithm based on double-array trie (cedar), supports visualizing structure via graphviz.
-
Updated
Jan 21, 2024 - Go
#
double-array-trie
Here are 14 public repositories matching this topic...
High performance Trie and Ahocorasick automata (AC automata) Keyword Match & Replace Tool for python. Correct case insensitive implementation!
-
Updated
Oct 16, 2024 - Cython
Fast compressed trie dictionary library
-
Updated
Sep 20, 2024 - C++
Fast implementation of fuzzy matching and Blacklist filtering
-
Updated
Jan 27, 2021 - Go
Pure python implementation of DARTS (Double ARray Trie System)
-
Updated
Dec 7, 2022 - Python
An updateable dict service, multi-pattern match
-
Updated
Oct 17, 2022 - Go
Simple Double Array Trie implementation
-
Updated
Feb 1, 2022 - C++
Implementation of Aho-Corasick algorithm with Double Array Trie data structure.
-
Updated
Dec 20, 2022 - C
A Rust binding of s-yata/darts-clone
-
Updated
Sep 28, 2024 - Rust
Toy Natural Language Processing package
-
Updated
Oct 8, 2024 - Python
Double array trie implementation of rust
-
Updated
Sep 3, 2024 - Rust
General algorighm implements in java
java siphash sha256 lz77 bloomfilter dfa lzf double-array-trie linearcongruentialrandom mersennetwisterrandom
-
Updated
Oct 12, 2022 - Java
Improve this page
Add a description, image, and links to the double-array-trie topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the double-array-trie topic, visit your repo's landing page and select "manage topics."