A Javascript library for fuzzy substring search.
-
Updated
Jan 4, 2023 - JavaScript
#
levenshtein-distance
Here are 32 public repositories matching this topic...
fastest & scored levenstein js impl
-
Updated
Dec 20, 2021 - JavaScript
A collection of string comparisons algorithms
javascript algorithms distance smith-waterman trigrams levenshtein-distance similarity-measures cosine-similarity string-distance jaccard-similarity jaro-winkler-distance damerau-levenshtein hamming-distance string-comparison sorensen-dice-distance
-
Updated
Apr 18, 2024 - JavaScript
🚄 💨 A lightweight implementation of the Levenshtein distance algorithm.
-
Updated
Nov 24, 2016 - JavaScript
A weighted levenshtein that takes typiness into consideration
-
Updated
Sep 13, 2023 - JavaScript
Auto Suggestion Using Levenshtein Algorithm(Edit Distance)
-
Updated
Jun 24, 2021 - JavaScript
Search YouTube with Levenshtein distances
-
Updated
Aug 5, 2018 - JavaScript
Utils for node project
nodejs clone math date utils regex geolocation helpers file sort levenshtein-distance string-distance misc
-
Updated
Apr 3, 2017 - JavaScript
A lightweight implementation of the Levenshtein algorithm for measuring string similarity.
-
Updated
Jan 8, 2025 - 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
👌 Simple search suggestion using the Levenshtein distance algorithm.
-
Updated
Aug 17, 2015 - 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
Feb 21, 2026 - JavaScript
Compute the Levenshtein distance between two strings.
-
Updated
May 21, 2018 - JavaScript
Set of tools for implementing approximate search
-
Updated
May 30, 2024 - JavaScript
A routine for assigning spam probability to a given set of text messages by comparing each text to the rest of the corpus, checking the frequency of spam and non-spam messages in the corpus. The probability is ranged from 0 to 1, where 0 is no spam and 1 is certain spam.
-
Updated
Dec 17, 2021 - JavaScript
vanilla js simple and advanced search plugins
-
Updated
Oct 29, 2018 - JavaScript
Firefox extension to fuzzy search web pages.
-
Updated
Apr 3, 2021 - JavaScript
Tool for grouping products by title similarities.
-
Updated
Dec 9, 2024 - JavaScript
A simple JS game for dengue education
-
Updated
Jan 4, 2023 - JavaScript
-
Updated
Mar 2, 2017 - JavaScript
Improve this page
Add a description, image, and links to the levenshtein-distance topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the levenshtein-distance topic, visit your repo's landing page and select "manage topics."