search

hankcs / AhoCorasickDoubleArrayTrie

An extremely fast implementation of Aho Corasick algorithm based on Double Array Trie.
http://www.hankcs.com/program/algorithm/aho-corasick-double-array-trie.html
946 stars 289 forks source link

Inspiration in newer papers about double array tries #49

Open dumblob opened 3 years ago

dumblob commented 3 years ago

Is this based on Speeding Up Double-Array Trie Construction for String Matching or something else?

hankcs commented 3 years ago

No, although I wrote this after the paper you mentioned, I did not read it and I can't tell if the algorithms are the same.

dumblob commented 3 years ago

Have you documented somewhere which approach you've taken for modifications?

hankcs commented 3 years ago

No, but I wrote a blog post on it:https://www.hankcs.com/program/algorithm/aho-corasick-double-array-trie.html

You may need a translator.

dumblob commented 3 years ago

Nice! I've read a translated version (Google translate) and find it interesting.

Any plans to rewrite it in a closer-to-metal language (V or Rust or C++ or C or Go etc.)?

hankcs commented 3 years ago

It's a good idea but I don't have time now. I'm pretty sure there is a go implementation somewhere on GitHub.