npm

88 packages found

M
Q
P

Description

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

Keywords

Publisher

published 2.0.62 years ago
M
Q
P

Description

Measure the difference between two strings using the fastest JS implementation of the Levenshtein distance algorithm

Keywords

Publisher

published 3.1.02 months ago
M
Q
P

Description

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

Keywords

Publisher

published 1.1.64 months ago
M
Q
P

Description

Damerau - Levenshtein distance by The Spanish Inquisition + relative distance

Keywords

Publisher

published 1.0.42 years ago
M
Q
P

Description

Levenshtein edit distance. No cruft. Real fast.

Keywords

Publisher

published 2.0.39 months ago
M
Q
P

Description

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

Keywords

Publisher

published 3.0.06 months ago
M
Q
P

Description

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

Keywords

Publisher

published 3.0.02 months ago
M
Q
P

Description

diff strings and lists with levenshtein distance

Keywords

Publisher

published 1.1.72 years ago
M
Q
P

Description

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.

Keywords

Publisher

published 1.0.12 years ago
M
Q
P

Description

A lightweight implementation of the Levenshtein distance algorithm.

Keywords

Publisher

published 1.0.93 years ago
M
Q
P

Description

Node.js bindings for the levenshtein-sse lib

Keywords

Publisher

published 1.1.03 years ago
M
Q
P

Description

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

Keywords

Publisher

published 1.2.05 months ago
M
Q
P

Description

The fastest JS implementation of the Damerau-Levenshtein edit distance

Keywords

Publisher

published 1.0.03 years ago
M
Q
P

Description

String and tree edit distance

Keywords

Publisher

published 1.0.26 months ago
M
Q
P

Description

Finds measure of similarity/distance between two input sets.

Keywords

Publisher

published 1.0.14 days ago
M
Q
P

Description

How similar are these two strings?

Keywords

Publisher

published 1.1.12 years ago
M
Q
P

Description

an approximate string matching algorithm

Keywords

Publisher

published 1.0.12 years ago
M
Q
P

Description

A simple ES6 proxy wrapper that enables you to make typos in property names.

Keywords

Publisher

published 2.0.03 years ago
M
Q
P

Description

Implementation of the Levenshtein algorithm used to calculate distince between strings.

Keywords

Publisher

published 1.0.02 years ago
M
Q
P

Description

Sort array of strings by Levenshtein (Sift4) distance

Keywords

Publisher

published 1.1.04 years ago