A simple game in which you must calculate the edit distance between words
-
Updated
Dec 8, 2016 - JavaScript
A simple game in which you must calculate the edit distance between words
DorisBot is a smart chatbot that was built with Wit.ai and Messenger Platform
Compute the Levenshtein distance between two strings.
Suggest email based on the Levenshtein distance between given email and popular domains
How similar are these 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.
fastest & scored levenstein js impl
Damerau - Levenstein distance function for node
Calculate the Levenshtein distance between two strings.
The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.
Levenshtein edit distance
A simple NodeJS (NPM) module for weighted Damerau–Levenshtein distance.
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 weighted levenshtein that takes typiness into consideration
Fast string matcher conceived for chat quick replies, voice interaction channels and multiple-choice scenario
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."