3 ms·
True- levenshtein isn't the best algorithm for the purpose. Is there an algorithm that takes key proximity into account? Like, 'libm' and 'libc' are sufficientl
by utexaspunk 10y ago
True- levenshtein isn't the best algorithm for the purpose. Is there an algorithm that takes key proximity into account? Like, 'libm' and 'libc' are sufficiently different to preclude typos, but 'lib[n/j/k]' or 'lib[x/d/f/v]' are not?
- sqeaky 10y agoKey proximity on which of the hundreds of keyboard layouts?
- utexaspunk 10y agoGood question... I'd imagine your standard QUERTY makes up a sizeable majority of programmers, but then I have no data to back that up... :)