Search results

25 packages found

Damerau - Levenshtein distance by The Spanish Inquisition + relative distance

published version 1.0.8, 3 years ago559 dependents licensed under $BSD-2-Clause
68,328,481

A library implementing different string similarity

published version 1.3.0, 2 years ago19 dependents licensed under $MIT
210,315

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

published version 2.2.0, a month ago5 dependents licensed under $MIT
103,518

A collection of string matching algorithms built with React Select in mind

published version 1.3.0, 8 years ago11 dependents licensed under $MIT
9,877

A Javascript library for fuzzy substring searches.

published version 0.1.2, 5 years ago5 dependents licensed under $MIT
2,483

Easy-to-use React component for morphing one string into another.

published version 0.3.3, 6 years ago0 dependents licensed under $MIT
1,526

Calculate string distance using Damerau–Levenshtein method.

published version 1.0.0, 8 months ago0 dependents licensed under $MIT
725

Get string similarity in JavaScript or TypeScript

published version 0.3.3, 3 years ago1 dependents licensed under $MIT
711

A much faster than the naïve Levenshtein distance algoritme

published version 0.2.2, 11 years ago1 dependents licensed under $MIT
346

Measure how similar two strings are using the Sørensen–Dice Coefficient

published version 1.0.4, 5 years ago1 dependents licensed under $MIT
126

Compute the Levenshtein distance for string comparison

published version 0.1.0, 13 years ago1 dependents
94

An N-API/C++ port of the Damerau-Levenshtein implementation from natural

published version 1.0.14, 5 years ago0 dependents licensed under $MIT
40

A Search library, with integrated threshhold.

published version 1.1.3, 3 years ago0 dependents licensed under $ISC
31

JavaScript port of the fast Damerau-Levenshtein string distance calculation algorithm used in Git

published version 1.0.2, 9 years ago0 dependents licensed under $GPL-2.0
23

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

published version 1.0.1, 6 years ago0 dependents licensed under $MIT
25

Compare the difference between two strings using Levenshtein Distance. Returns a number 0 to 1 showing exactly how related the two strings are.

published version 0.0.9, 5 years ago0 dependents licensed under $MIT
27

Compute the edit distance between strings by approximate matching.

published version 0.2.3, 5 years ago0 dependents licensed under $MIT
21

Some algorithms to compare strings.

published version 0.1.2, 10 years ago2 dependents licensed under $MIT
22

similarity based on Levenshtein distance

published version 0.1.0, 8 years ago1 dependents licensed under $MIT
15

Over simplistic fuzzy search library using Damerau-Levenshtein and optionally the keyboard layout to calculate distances.

published version 0.0.2, 10 months ago0 dependents licensed under $MIT
16