substring-matching
Here are 7 public repositories matching this topic...
Language:All
A fast implementation of Aho-Corasick in Rust.
- Updated
Oct 28, 2025 - Rust
🐎 A fast implementation of the Aho-Corasick algorithm using the compact double-array data structure in Rust.
- Updated
Jun 11, 2025 - Rust
🐎 A fast implementation of the Aho-Corasick algorithm using the compact double-array data structure. (Python wrapper for daachorse)
- Updated
Mar 15, 2025 - Rust
Fast string seaching for node.js ( aho-corasick algorithm )
- Updated
Jan 24, 2024 - Rust
Benchmark various aho-carosick node libraries against large corpus text and pattern lengths
- Updated
Dec 6, 2020 - JavaScript
NormNumSuM (normalised Number of Substring Movements) is a string comparison algorithm designed to be token order invariant.
- Updated
Dec 7, 2022 - Python
Implementations of some algorithms in C++
- Updated
Apr 11, 2023 - C++
Improve this page
Add a description, image, and links to thesubstring-matching topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with thesubstring-matching topic, visit your repo's landing page and select "manage topics."