Download
AhoCorasickDoubleArrayTrie is a Java implementation of the Aho–Corasick multi-pattern matching algorithm that is optimized using a Double-Array Trie data structure. It is designed for fast keyword scanning across large texts, where you want to search for many patterns simultaneously and efficiently. The core idea is to build an automaton from a dictionary of patterns, then stream through input text to emit matches with minimal overhead. By using a double-array trie representation, the project emphasizes performance and memory efficiency compared to simpler pointer-heavy trie structures, which can matter a lot for large dictionaries or latency-sensitive services. This makes it a strong fit for tasks like content filtering, entity/term spotting, dictionary-based annotation, or high-throughput log/text processing. In short, it’s a specialized, speed-focused library for industrial-strength multi-keyword matching in Java.
Features
- Multi-pattern string matching using the Aho–Corasick algorithm
- Double-Array Trie-based automaton representation for speed and compactness
- Efficient scanning across long texts and large pattern sets
- Suitable for dictionary-based extraction, filtering, and annotation
- Works well in batch processing or low-latency services
- Java-focused design for easy embedding in JVM applications
Project Samples
