Ukkonens approximate string matching algorithm for finding edit distance similar to Levenshtein
Reasonably efficient and concise exact longest common subsequence and minimum edit-distance algorithm implementation for JavaScript
A TypeScript npm package for finding near duplicate string pairs