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.

How similar are these two strings?

Levenshtein edit distance

Damerau - Levenstein distance function for node

Give me a word and I’ll give you an array of words that differ by a single letter.

fastest & scored levenstein js impl

Morph one word into another, one letter at a time

DorisBot is a smart chatbot that was built with Wit.ai and Messenger Platform

A weighted levenshtein that takes typiness into consideration

This repository contains a fuzzy search library that provides a flexible way to search and match strings using various fuzzy matching algorithms. It supports multiple languages and allows for customization of search options such as algorithms, thresholds, and synonym handling.

A lightweight implementation of the Levenshtein algorithm for measuring string similarity.

Suggest email based on the Levenshtein distance between given email and popular domains

Simple pure javascritp mouse gestures controller. Convert your website on a mouse-gestures controlled one adding just a couple of lines to your code.

Calculate the Levenshtein distance between two strings.

A simple NodeJS (NPM) module for weighted Damerau–Levenshtein distance.

Fast string matcher conceived for chat quick replies, voice interaction channels and multiple-choice scenario

Compute the Levenshtein distance between two strings.

Diff Match and Patch

Calculates the Levenshtein (edit) distance between two strings.