Search results

179 packages found

Levenshtein edit distance

published version 3.0.1, 3 years ago37 dependents licensed under $MIT
1,211,208

Fastest Levenshtein distance implementation in JS.

published version 1.0.16, 3 years ago549 dependents licensed under $MIT
69,283,784

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

published version 1.2.2, 4 years ago786 dependents licensed under $Apache-2.0
67,481,964

Measure the difference between two strings using the Levenshtein distance algorithm

published version 4.0.0, 4 years ago1480 dependents licensed under $MIT
182,367,594

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

published version 1.1.6, 7 years ago215 dependents licensed under $MIT
21,533,716

String and tree edit distance

published version 1.0.5, 3 years ago2 dependents licensed under $Apache-2.0
9,326

A minimal algorithm for computing Levenshtein distance in JavaScript.

published version 2.2.12, 5 months ago2 dependents licensed under $MIT
438,089

A tiny implementation of the Levenshtein edit distance algorithm.

published version 1.1.0, 11 days ago2 dependents licensed under $MIT
110,457

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

published version 2.0.0, 4 months ago4 dependents licensed under $MIT
279,794

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

published version 7.0.4, 10 months ago45 dependents licensed under $MIT
784,034

diff strings and lists with levenshtein distance

published version 1.1.7, 8 years ago2 dependents licensed under $MIT
654

Levenshtein distance for an array.

published version 2.2.11, 5 months ago1 dependents licensed under $MIT
2,770

NPM package that calculates synchronously or asynchronously the Damerau-Levenshtein distance between strings

published version 1.1.8, 3 years ago2 dependents licensed under $MIT
6,278

An implementation of weighted Damerau–Levenshtein distance.

published version 0.1.2, 6 years ago0 dependents licensed under $Apache-2.0
1,641

A lightweight implementation of the Levenshtein distance algorithm.

published version 1.0.9, 9 years ago2 dependents licensed under $MIT
1,549

Calculates the Levenshtein (edit) distance between two strings.

published version 0.2.2, a year ago1 dependents licensed under $Apache-2.0
1,152

Customizable edit distance calculator

published version 0.1.2, 6 years ago1 dependents licensed under $MIT
111

Distance between given email and popular domains

published version 1.0.0, 7 years ago0 dependents licensed under $MIT
406

[![npm-version](https://img.shields.io/npm/v/levenary.svg)](https://www.npmjs.com/package/levenary) [![github-actions](https://github.com/tanhauhau/levenary/workflows/CI/badge.svg)](https://github.com/tanhauhau/levenary/actions)

published version 1.1.1, 5 years ago69 dependents licensed under $MIT
7,506,143

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

published version 3.0.0, 5 years ago1839 dependents licensed under $MIT
283,615,812