A collection of string comparisons algorithms
-
Updated
Apr 18, 2024 - JavaScript
A collection of string comparisons algorithms
fastest & scored levenstein js impl
A Javascript library for fuzzy substring search.
Novel algorithm to generate shortest edit script.
A simple NodeJS (NPM) module for weighted Damerau–Levenshtein distance.
this library implement the edit distance algorithm (levenshtein original operation) to predict the correct spelling
Utils for node project
A simple JS game for dengue education
vanilla js simple and advanced search plugins
A weighted levenshtein that takes typiness into consideration
Levenshtein distance fuzzy searches as serverless lambdas
A simple game in which you must calculate the edit distance between words
Search YouTube with Levenshtein distances
Smart Shopping List created with ReactJS. A winning submission to IT Talents Code Competition
The Levenshtein distance algorithm calculates the minimum number of operations required to transform one string into another. The operations can be insertion, deletion, or substitution of a single character. The higher the Levenshtein distance between two strings, the more different they are.
lightweight npm package to calculate string similarity
Auto Suggestion Using Levenshtein Algorithm(Edit Distance)
Fast implementation of the Levenshtein edit distance
👌 Simple search suggestion using the Levenshtein distance algorithm.
Add a description, image, and links to the levenshtein-distance topic page so that developers can more easily learn about it.
To associate your repository with the levenshtein-distance topic, visit your repo's landing page and select "manage topics."