A Golang implementation of the Aho-Corasick string matching algorithm
-
Updated
Dec 18, 2019 - Go
A Golang implementation of the Aho-Corasick string matching algorithm
A concurrency-safe Aho-Corasick string matching algorithms implementation in golang.
A Golang implementation of the Aho-Corasick string-searching algorithm
Golang implementation of Aho-Corasick algorithm.
UCAS 2022春季”模式串匹配与信息过滤“课程作业 Implement Aho-Corasick Algorithm based golang, and tesing this in url data.
Go efficiently double-array trie and aho corasick
ACOR means Aho-Corasick automation working On Redis, Written in Go
Multi-String Pattern Matching Algorithm Using TrieNode
📒 An Aho-Corasick algorithm based string-searching utility for Go. It supports tokenization, ignoring case, replacing text. So you can use it to find keywords in an article, filter sensitive words, etc.
Enhance productivity and avoid to reinvent the wheel every time that you start a Go project
efficient string matching in Golang via the aho-corasick algorithm.
A fast and memory efficient implementation of aho-corasick algorithm based on double-array trie (cedar), supports visualizing structure via graphviz.
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."