❤
npm
Sign UpSign In

Search results

18 packages found

Sort by: Default
  • Default
  • Most downloaded this week
  • Most downloaded this month
  • Most dependents
  • Recently published

leven

Measure the difference between two strings using the Levenshtein distance algorithm

sindresorhus
published version 4.0.0, 4 years ago1610 dependents licensed under $MIT
139,129,123

levenary

[![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 version 1.1.1, 5 years ago87 dependents licensed under $MIT
3,996,228

didyoumean2

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

foray1010
published version 7.0.4, 8 months ago49 dependents licensed under $MIT
782,748

closest-match

Uses Levenshtein Distance to find the closest string match or matches in an array

plebus_supremus
published version 1.3.3, 4 years ago23 dependents licensed under $ISC
35,427

leven-sort

Simply sort by similarity, starring Levenshtein via leven

doesdev
published version 4.0.0, 3 years ago1 dependents licensed under $MIT
2,594

onp

Text diff algorithm based on 'An O(NP) Sequence Comparison Algorithm' from Sun Wu, Udi Manber and Gene Myers

hacker.stanislav
published version 2.0.4, 3 years ago1 dependents licensed under $MIT
1,541

find-similar

Finds similar word(s) in a list of words

bent10
published version 1.2.6, 9 months ago5 dependents licensed under $MIT
290

diff-leven

Git like diff between two strings, using the Levenshtein distance algorithm

kushalshit27
published version 0.3.0, 2 days ago0 dependents licensed under $MIT
206

@hidden-finder/didyoumean

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

arugaz
published version 1.1.0, 2 years ago0 dependents licensed under $MIT
115

array-edit-steps

Find the difference between two arrays and compute the minimal steps to transform one array to another.

klo112358
published version 0.1.4, 5 years ago0 dependents licensed under $MIT
32

similarity-matrix

Calculates the similarity of 2 string arrays and sorts the seconds one by similarity to first

bargom
published version 0.1.9, 8 years ago0 dependents licensed under $MIT
21

similarity-string

String's percent similarity

efraespada
published version 1.0.1, 7 years ago0 dependents licensed under $MIT
16

strings-similarity

Compare Strings Similarity Based on Levenshtein Distance Algorithm

sarathdamaraju
published version 1.1.0, 8 years ago0 dependents licensed under $MIT
19

cities-auto-correct

Auto Correct City names (AutoCorrects Top Indian Cities, for Now), Give a incorrect city name and get the most relevant city name

sarathdamaraju
published version 1.2.1, 8 years ago0 dependents licensed under $MIT
17

leven-cli

Measure the difference between two strings using the Levenshtein distance algorithm

sindresorhus
published version 2.0.0, 4 years ago1 dependents licensed under $MIT
12

fuzzy-dist

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

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

spelling-suggestion

Given a name and a list of names that are not equal to the name, return a spelling suggestion if there is one that is close enough.

bubkoo
published version 1.0.1, 2 years ago0 dependents licensed under $MIT
9

levenjs

Fast implementation of the Levenshtein edit distance

mammothb
published version 0.2.0, 3 years ago0 dependents licensed under $MIT
5