Easy to use and powerful fuzzy string matching, port of fuzzywuzzy.
-
Updated
Oct 11, 2024 - JavaScript
Easy to use and powerful fuzzy string matching, port of fuzzywuzzy.
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.
Damerau - Levenstein distance function for node
Dividing the task into stages and subtasks, notifications, and time execution statistics for each task
404 page that suggests links based off of sitemap and levenshtein edit distance
Fast string matcher conceived for chat quick replies, voice interaction channels and multiple-choice scenario
A weighted levenshtein that takes typiness into consideration
Fast implementation of the Levenshtein edit distance
A simple NodeJS (NPM) module for weighted Damerau–Levenshtein distance.
Levenshtein edit distance
The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.
Calculate the Levenshtein distance between two strings.
fastest & scored levenstein js impl
Simple pure javascritp mouse gestures controller. Convert your website on a mouse-gestures controlled one adding just a couple of lines to your code.
How similar are these two strings?
Suggest email based on the Levenshtein distance between given email and popular domains
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."