A fast implementation of Aho-Corasick in Rust.
-
Updated
Sep 25, 2024 - Rust
#
substring-matching
Here are 7 public repositories matching this topic...
🐎 A fast implementation of the Aho-Corasick algorithm using the compact double-array data structure in Rust.
search
rust
finite-state-machine
text-processing
aho-corasick
no-std
double-array
substring-matching
-
Updated
Oct 12, 2024 - Rust
🐎 A fast implementation of the Aho-Corasick algorithm using the compact double-array data structure. (Python wrapper for daachorse)
-
Updated
Feb 2, 2023 - 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++
search
hashing
math
pattern-matching
hash
sort
sorting-algorithms
hashing-algorithm
factorization
sorting-algorithms-implemented
sort-algorithms
searching-algorithms
sorting-algorithm
fibonacci-sequence
exponentiation
algorithms-and-data-structures
greatest-common-divisor
substring-matching
-
Updated
Apr 11, 2023 - C++
Improve this page
Add a description, image, and links to the substring-matching topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the substring-matching topic, visit your repo's landing page and select "manage topics."