Levenshtein Packages

Efficient implementation of Levenshtein algorithm with locale-specific collator support.

Measure the difference between two strings using the Levenshtein distance algorithm

[](https://www.npmjs.com/package/levenary) [](https://github.com/tanhauhau/levenary/actions)

Fastest Levenshtein distance implementation in JS.

The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.

Finds degree of similarity between strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.

Match human-quality input to potential matches by edit distance.

Levenshtein edit distance

A minimal algorithm for computing Levenshtein distance in JavaScript.

a library for matching human-quality input to a list of potential matches using the Levenshtein distance algorithm

library for simularity identification

Fuzzy string matching algorithms and utilities, port of the TheFuzz Python library.

The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.

Straightforward fuzzy matching, information retrieval and NLP building blocks for JavaScript.

A handy collection of algorithms dealing with fuzzy strings and phonetics.

How similar are these two strings?

Array / Arraylike utilities

Fast and tiny fuzzy-search utility

findsuggestions searches haystacks for needles and nails.

Javascript version of hermetrics.py