Fast implementation of the Levenshtein edit distance
-
Updated
Mar 10, 2023 - JavaScript
Fast implementation of the Levenshtein edit distance
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.
A simple game in which you must calculate the edit distance between words
404 page that suggests links based off of sitemap and levenshtein edit distance
Compute the Levenshtein distance between two strings.
Simple pure javascritp mouse gestures controller. Convert your website on a mouse-gestures controlled one adding just a couple of lines to your code.
Fast string matcher conceived for chat quick replies, voice interaction channels and multiple-choice scenario
Calculate the Levenshtein distance between two strings.
A simple NodeJS (NPM) module for weighted Damerau–Levenshtein distance.
Suggest email based on the Levenshtein distance between given email and popular domains
A weighted levenshtein that takes typiness into consideration
DorisBot is a smart chatbot that was built with Wit.ai and Messenger Platform
fastest & scored levenstein js impl
Damerau - Levenstein distance function for node
Levenshtein edit distance
How similar are these two strings?
Add a description, image, and links to the levenshtein topic page so that developers can more easily learn about it.
To associate your repository with the levenshtein topic, visit your repo's landing page and select "manage topics."