7 results for “topic:substring-matching”
A fast implementation of Aho-Corasick in Rust.
🐎 A fast implementation of the Aho-Corasick algorithm using the compact double-array data structure in Rust.
🐎 A fast implementation of the Aho-Corasick algorithm using the compact double-array data structure. (Python wrapper for daachorse)
Fast string seaching for node.js ( aho-corasick algorithm )
Benchmark various aho-carosick node libraries against large corpus text and pattern lengths
Implementations of some algorithms in C++
NormNumSuM (normalised Number of Substring Movements) is a string comparison algorithm designed to be token order invariant.