Search results

ukkonen

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

• Ukkonen
• Hal
• Berghel
• Aproximate
• string
• match
• ASM
• EHD
• Levenshtein

sunesimonsen

• 2.1.0 • 2 years ago • 5 dependents • MITpublished version 2.1.0, 2 years ago5 dependents licensed under $MIT

@edit-distance/myers-1986

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

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

aureooms

• 1.1.0 • 4 years ago • 0 dependents • AGPL-3.0published version 1.1.0, 4 years ago0 dependents licensed under $AGPL-3.0