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
950 stars 290 forks source link

没那么快呢？ #52

Open putao0525 opened 3 years ago

putao0525 commented 3 years ago

test.md

Rothes commented 1 year ago

在我的环境中，这个项目只有匹配到字典时才会比原生实现快7-8倍，如果没有匹配到任何字典甚至会比原生慢3-5倍

ANBUZHIDAO commented 11 months ago

test.md

There is an issue with this test case. AhoCorasickDoubleArrayTrie has a longer build time than Trie, but the matching time is indeed faster. Please separate the build time and matching time for statistics。