js-levenshtein
js-levenshtein copied to clipboard
gustf
The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.
This PR: * Updates the benchmarks in the README to be on the latest Node version (v14.7.0). * Updates `fast-levenshtein` to version (v3.0.0). * Adds [`fastest-levenshtein`](https://github.com/ka-weihe/fastest-levenshtein) to the benchmark-suite. I...
Hi, Could you please tell me, where I can plug a custom substitution cost function, or is it not straightforward? There are no comments for the substution/insertion/deletion steps. Thank you!
Hello, Thank you for this implementation. It is indeed very fast! I am trying to optimize the algorithm for the specific (but rather common) case where we look for only...
For example in the following text: > > Easier to reason about useMemo can make your code easier to reason about by making it clear which values are being calculated...
