127 packages found

M
Q
P

Description

Damerau - Levenshtein distance by The Spanish Inquisition + relative distance

Keywords

Publisher

published 1.0.621 days 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.010 months ago
M
Q
P

Description

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

Keywords

Publisher

published 2.0.63 years 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 4.0.1a month ago
M
Q
P

Description

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

Keywords

Publisher

published 1.1.120 days 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.6a year ago
M
Q
P

Description

Levenshtein edit distance. No cruft. Real fast.

Keywords

Publisher

published 2.0.516 days 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 4.0.011 days ago
M
Q
P

Description

Fastest Levenshtein distance implementation.

Keywords

Publisher

published 2.0.134 months ago
M
Q
P

Description

findsuggestions searches haystacks for needles and nails.

Keywords

Publisher

published 1.0.0a year ago
M
Q
P
M
Q
P

Description

Distance between two strings using the levenshtein algorithm

Keywords

Publisher

published 1.0.15 days ago
M
Q
P

Description

An implementation of weighted Damerau–Levenshtein distance.

Keywords

Publisher

published 0.1.25 months ago
M
Q
P

Description

Fast and easy to use module that calculates synchronously and asynchronously (promises) the Damerau-Levenshtein distance between strings. For example, it can help in detecting fake celebrities accounts created for scamming.

Keywords

Publisher

published 1.1.56 months ago
M
Q
P

Description

Distance between given email and popular domains

Keywords

Publisher

published 1.0.35 months ago
M
Q
P

Description

library for simularity identification

Keywords

Publisher

published 0.1.47 months ago
M
Q
P

Description

A Javascript library for fuzzy substring searches.

Keywords

Publisher

published 0.1.02 months ago
M
Q
P

Description

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

Keywords

Publisher

published 1.2.15 years ago
M
Q
P

Description

Ukkonens approximate string matching algorithm for finding edit distance similar to Levenshtein

Keywords

Publisher

published 1.4.02 years ago
M
Q
P

Description

Fast and tiny fuzzy-search utility

Keywords

Publisher

published 1.9.13 months ago