🚄 💨 A lightweight implementation of the Levenshtein distance algorithm.
-
Updated
Nov 24, 2016 - JavaScript
🚄 💨 A lightweight implementation of the Levenshtein distance algorithm.
Zero dependency Metric Longest Common Subsequence implementation in js.
Compute the Levenshtein distance between two strings.
A easy and clear javascript solution of the smith-waterman algorithm.
The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.
Novel algorithm to generate shortest edit script.
Sørensen–Dice coefficient
A simple NodeJS (NPM) module for weighted Damerau–Levenshtein distance.
A Javascript library for fuzzy substring search.
Fast implementation of the Levenshtein edit distance
Add a description, image, and links to the edit-distance topic page so that developers can more easily learn about it.
To associate your repository with the edit-distance topic, visit your repo's landing page and select "manage topics."