📖 Aho-corasick Algorithm based multiple keyword matcher with KMP

Implementation of the Aho-Corasick multiple pattern matching finite state automaton.

An Implementation of Ukkonens 1990 linear-time algorithm for finding an approximate shortest superstring in Java. Also includes an extendable version of Aho Corasick's efficient string matcher.

An extremely fast implementation of Aho Corasick algorithm based on Double Array Trie.

📒 An Aho-Corasick algorithm based string-searching utility for Java. It supports tokenization, ignoring case, replacing text. So you can use it to find keywords in an article, filter sensitive words, etc.

Java library for fast multiple strings matchings. Uses internally Aho-Corasick or Commentz-Walter.

A double-array aho-corasick automaton implementation. It is not a simple combination of DAT and failure pointers, it is purely double-array by all elements in aho-corasick automation encoded into integers, which performs very fast.