Fast implementation of the Levenshtein edit distance
-
Updated
Mar 10, 2023 - JavaScript
#
edit-distance
Here are 11 public repositories matching this topic...
A Javascript library for fuzzy substring search.
-
Updated
Jan 4, 2023 - JavaScript
A simple NodeJS (NPM) module for weighted Damerau–Levenshtein distance.
metrics
distance
edit-distance
levenshtein
levenshtein-distance
edit
metric
damerau-levenshtein
damerau-levenshtein-distance
-
Updated
Dec 30, 2022 - JavaScript
Sørensen–Dice coefficient
-
Updated
Nov 2, 2022 - JavaScript
Novel algorithm to generate shortest edit script.
diff
algorithms
edit-distance
data-structures
levenshtein-distance
research-project
git-diff
longest-common-subsequence
research-paper
string-similarity
editdistance
edit-distance-algorithm
longest-common-substring
editscript
edit-distance-algorithms
-
Updated
Aug 22, 2022 - JavaScript
The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.
-
Updated
May 10, 2022 - JavaScript
A easy and clear javascript solution of the smith-waterman algorithm.
bioinformatics
local
functional-programming
smith-waterman
similarity
edit-distance
alignment
melodic
-
Updated
Dec 4, 2020 - JavaScript
-
Updated
Jul 23, 2018 - JavaScript
Compute the Levenshtein distance between two strings.
-
Updated
May 21, 2018 - JavaScript
Zero dependency Metric Longest Common Subsequence implementation in js.
-
Updated
Nov 9, 2017 - JavaScript
🚄 💨 A lightweight implementation of the Levenshtein distance algorithm.
-
Updated
Nov 24, 2016 - JavaScript
Improve this page
Add a description, image, and links to the edit-distance topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the edit-distance topic, visit your repo's landing page and select "manage topics."