3 ms·
The gold standard for substring search is EPSM, see the comparison at https://smart-tool.github.io/smart/ https://smart-tool.github.io/smart/. (Broken links. Se
by rurban 6y ago
The gold standard for substring search is EPSM, see the comparison at https://smart-tool.github.io/smart/ https://smart-tool.github.io/smart/. (Broken links. See https://www.sciencedirect.com/science/article/pii/S1570866714000471 https://www.sciencedirect.com/science/article/pii/S157086671...) Robin-Karp and Boyer-Moore are long outdated.
The gold standard for string pattern matching is Hyperscan. This has also benchmarks to support their claims.
For tree matching I have no idea.
- deleted 6y ago[deleted]
- deleted 6y ago[deleted]
- MrYellowP 6y agoExcuse me, but looking at HyperScan it seems that it's required to build a pattern matching database first. Is this correct? I'm confused about the comparability, because this can't be used "just so" for tools like grep, for example. Also the new link has nested links which lead to the 404s. lol I can find myself through this, no problem, but it's funny. :) And no windows version of HyperScan and I have to compile it myself, using cygwin.
- rurban 6y agoHyperscan has a normal pattern matching compiler, as most regex engines. Of course you can interpret a pattern on the fly, but most matchers take the additional compilation step. Yep, looks like the university site for smart is just down. Wasn't last week. You can still look at their GitHub though to at least get at their code.
- MrYellowP 6y agoA "compiler". I've never read anything about this being "compiled" in some sort, at least not before this. Interesting! I think I understand how this works and can make my own solution even faster. I thought memory bandwidth is a hard limit, but no! I'm allowed to "cheat"! :D