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.
-
Updated
Oct 24, 2021 - Java
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.
Implementation of the Aho-Corasick multiple pattern matching finite state automaton.
📖 Aho-corasick Algorithm based multiple keyword matcher with KMP
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.
Java library for fast multiple strings matchings. Uses internally Aho-Corasick or Commentz-Walter.
📒 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.
An extremely fast implementation of Aho Corasick algorithm based on Double Array Trie.
Add a description, image, and links to the aho-corasick topic page so that developers can more easily learn about it.
To associate your repository with the aho-corasick topic, visit your repo's landing page and select "manage topics."