An extremely fast implementation of Aho Corasick algorithm based on Double Array Trie.
-
Updated
Nov 24, 2021 - Java
An extremely fast implementation of Aho Corasick algorithm based on Double Array Trie.
Low memory, fast Aho-Corasick implementation.
Add a description, image, and links to the doublearraytrie topic page so that developers can more easily learn about it.
To associate your repository with the doublearraytrie topic, visit your repo's landing page and select "manage topics."