ukkonen

Ukkonens approximate string matching algorithm for finding edit distance similar to Levenshtein

v2.2.0 URL: https://unpkg.com/ukkonen@2.2.0/index.js

Open Browse Files

Ukkonen Hal Berghel Aproximate string match ASM EHD Levenshtein

@edit-distance/myers-1986

Reasonably efficient and concise exact longest common subsequence and minimum edit-distance algorithm implementation for JavaScript

v1.1.0 URL: https://unpkg.com/@edit-distance/myers-1986@1.1.0/dist/index.umd.js

Open Browse Files

Hirschberg Myers Ukkonen common distance divide-and-conquer edit exact longest optimal string subsequence