Hyperscan: A Fast Multi-Pattern Regex Matcher for Modern CPUs

Re:Hyperscan: A Fast Multi-Pattern Regex Matcher for Modern ... by bratao on Thursday February 28, 2019 @08:24AM (#19271142)

Thank you! I' m very excited to test in my projects ( I found a working Python extension here https://github.com/shenfe/python-hyperscan)

Let me seize the opportunity. I have a problem where I need to match multiple person names (hundreds of thousands) in huge texts. Aho-Corasick works good for exact matches. Could HyperScan works for approximated matches?

[ Parent | on HN ]

Re:Hyperscan: A Fast Multi-Pattern Regex Matcher for Modern ... by glangdale on Thursday February 28, 2019 @04:00PM (#19275143)

We have both Levenstein and Hamming distance parameters. Do note that putting large distance numbers is not expected to perform well (i.e. matching "Smith" at Levenstein distance = 3 won't be a happy experience).

[ Parent | on HN ]

Re:Hyperscan: A Fast Multi-Pattern Regex Matcher for Modern ... by taleinat on Thursday February 28, 2019 @02:51PM (#19274456)

Have you tried some existing Python libraries which support fuzzy searching, such as regex and fuzzysearch?

[ Parent | on HN ]

Re:Hyperscan: A Fast Multi-Pattern Regex Matcher for Modern ... by bratao on Thursday February 28, 2019 @03:26PM (#19274801)

Yes. Both grow the complexity linearly/exponentially based on the number of patterns to be searched.

[ Parent | on HN ]

Re:Hyperscan: A Fast Multi-Pattern Regex Matcher for Modern ... by taleinat on Thursday February 28, 2019 @05:22PM (#19275873)

Ah. You should likely use a different algorithmic approach.

If you add contact details to your user info I'll be happy to get in touch and help.

[ Parent | on HN ]