3 ms·

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

by bratao 8y ago

Thank you! I' m very excited to test in my projects ( I found a working Python extension here https://github.com/shenfe/python-hyperscan 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?

glangdale 8y ago
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).
taleinat 8y ago
Have you tried some existing Python libraries which support fuzzy searching, such as regex and fuzzysearch?
- bratao 8y ago
  Yes. Both grow the complexity linearly/exponentially based on the number of patterns to be searched.
  - taleinat 8y ago
    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.