Easy to use and powerful fuzzy string matching, port of fuzzywuzzy.
-
Updated
Jun 16, 2024 - JavaScript
Easy to use and powerful fuzzy string matching, port of fuzzywuzzy.
The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.
Damerau - Levenstein distance function for node
How similar are these two strings?
Suggest email based on the Levenshtein distance between given email and popular domains
Levenshtein edit distance
fastest & scored levenstein js impl
DorisBot is a smart chatbot that was built with Wit.ai and Messenger Platform
Calculate the Levenshtein distance between two strings.
Fast string matcher conceived for chat quick replies, voice interaction channels and multiple-choice scenario
A simple NodeJS (NPM) module for weighted Damerau–Levenshtein distance.
A weighted levenshtein that takes typiness into consideration
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.
Simple pure javascritp mouse gestures controller. Convert your website on a mouse-gestures controlled one adding just a couple of lines to your code.
Compute the Levenshtein distance between 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."