keywords:edit distance

leven

Measure the difference between two strings using the Levenshtein distance algorithm

sindresorhus

published 4.0.0 3 years ago

M

Q

P

fastest-levenshtein

Fastest Levenshtein distance implementation in JS.

ka-weihe

published 1.0.16 2 years ago

M

Q

P

didyoumean2

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

foray1010

published 7.0.4 9 days ago

M

Q

P

didyoumean

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

dcporter

published 1.2.2 3 years ago

M

Q

P

levenshtein-edit-distance

Levenshtein edit distance

wooorm

published 3.0.1 2 years ago

M

Q

P

js-levenshtein

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

ggustf

published 1.1.6 6 years ago

M

Q

P

@stdlib/string-base-distances-levenshtein

Calculates the Levenshtein (edit) distance between two strings.

stdlib-bot

published 0.2.2 2 months ago

M

Q

P

@stdlib/string-base-distances-hamming

Calculate the Hamming distance between two equal-length strings.

stdlib-bot

published 0.2.2 2 months ago

M

Q

P

find-similar

Finds similar word(s) in a list of words

bent10

published 1.2.6 a month ago

M

Q

P

[![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)

tanhauhau

published 1.1.1 5 years ago

M

Q

P

@hidden-finder/didyoumean

provides functions for comparing and calculating the similarity between two strings using various methods.

arugaz

published 1.1.0 a year ago

M

Q

P

quinon

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

timmykris

published 1.8.2 6 months ago

M

Q

P

asperioresodit

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

fionaswift

published 1.2.1 6 months ago

M

Q

P

teneturad

Fastest Levenshtein distance implementation in JS.

bryonschuster

published 1.1.1 6 months ago

M

Q

P

js-levenshtein-esm

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

43081j

published 1.2.0 6 years ago

M

Q

P

edit-distance

String and tree edit distance

schulzch

published 1.0.5 3 years ago

M

Q

P

minimum-edit-distance

diff strings and lists with levenshtein distance

jzwood

published 1.1.7 7 years ago

M

Q

P

@zitro/edit-distance

A tiny optimized package which finds the Levenshtein distance (edit distance) between two words. Having two strings of length N and M, the algorithm has O(N*M) complexity and uses O(N) additional space.