4 ms·
He-hey! For Levenshtein distance check out the development branch of StringZilla. Hopefully will release this week :) Oh, and for multithreading, USearch might
by ashvardanian 3y ago
He-hey! For Levenshtein distance check out the development branch of StringZilla. Hopefully will release this week :)
Oh, and for multithreading, USearch might be more practical.
- chaps 3y agoHeck yeah, thanks. If the first 4 bytes of the string are the same, the strings are likely to be equal. Similarly, the first 4 bytes of the strings can be used to determine their relative order most of the time. That's a fun heuristic.
- ashvardanian 3y agoYes, it was very practical in most cases, but v3 only uses it for short needles with SWAR. SIMD variants will use Raita-style heuristics.