Open yasinzaehringer-paradime opened 3 years ago
Hi @yasinzaehringer-paradime,
When the number of allowed changes is large enough compared to the length of the pattern, it's no longer useful to first search for short sub-sequences which must appear somewhere. Therefore, fuzzysearch uses an entirely different (and also highly optimized) algorithm. However, the complexity of the computation increases exponentially with the number of allowed changes, leading to very long run times in examples such as the one you show here.
I'll think about how to explain this clearly in the documentation without making things overly complicated.
Firstly, thanks for the great tool! I came across this corner-case: the program below runs for longer than I expect. It took ~2.5mins to complete:
The result is:
Environment: System: MacOS 11.4 Python 3.9.5 fuzzysearch 0.7.3 (compiled)