Topic: "substring-matching"
BurntSushi/aho-corasick
A fast implementation of Aho-Corasick in Rust.
Language: Rust - Size: 4.72 MB - Last synced at: 3 days ago - Pushed at: about 1 month ago - Stars: 1,159 - Forks: 107
daac-tools/daachorse
🐎 A fast implementation of the Aho-Corasick algorithm using the compact double-array data structure in Rust.
Language: Rust - Size: 3.71 MB - Last synced at: 2 months ago - Pushed at: 6 months ago - Stars: 232 - Forks: 20
daac-tools/python-daachorse
🐎 A fast implementation of the Aho-Corasick algorithm using the compact double-array data structure. (Python wrapper for daachorse)
Language: Rust - Size: 3.22 MB - Last synced at: 2 months ago - Pushed at: 9 months ago - Stars: 17 - Forks: 1
xn-sakina/hoshino
Fast string seaching for node.js ( aho-corasick algorithm )
Language: Rust - Size: 172 KB - Last synced at: about 1 month ago - Pushed at: almost 2 years ago - Stars: 13 - Forks: 0
zeightOFFICIAL/algorithms
Implementations of some algorithms in C++
Language: C++ - Size: 34.6 MB - Last synced at: over 2 years ago - Pushed at: almost 3 years ago - Stars: 1 - Forks: 1
jmfn/node-aho-corasick-benchmarks
Benchmark various aho-carosick node libraries against large corpus text and pattern lengths
Language: JavaScript - Size: 18.6 KB - Last synced at: over 2 years ago - Pushed at: almost 5 years ago - Stars: 1 - Forks: 0
harrystuart/NormNumSuM
NormNumSuM (normalised Number of Substring Movements) is a string comparison algorithm designed to be token order invariant.
Language: Python - Size: 9.77 KB - Last synced at: 7 months ago - Pushed at: almost 3 years ago - Stars: 0 - Forks: 0
