A slight modification of a very efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings, modified for use in the browser.
Based on Wagner-Fischer dynamic programming algorithm, optimized for speed and memory
- use a single distance vector instead of a matrix
- loop unrolling on the outer loop
- remove common prefixes/postfixes from the calculation
- minimize the number of comparisons
- always allocate a new distance vector in order to not leak memory
Download the Minified JS file(levenshtein.min.js), and place it into the source files of your website.
I might try to get this added to some CDNs at some point.
<script>
import levenshtein from "/path/to/levenshtein.min.js";
levenshtein('kitten', 'sitting');
//=> 3
</script>MIT © Steve0Greatness