keywords:string difference

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

maxmin

Get a pretty output of the original, minified, gzipped size of a string or buffer: 130 B → 91 B → 53 B (gzip)

sindresorhus

published 4.1.0 4 months ago

M

Q

P

string-mismatch

All mismatch between two strings

wil92

published 3.0.2 5 months 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

find-similar

Finds similar word(s) in a list of words

bent10

published 1.2.6 a month ago

M

Q

P

string-differencer

A module that calculates and returns the differences between two input strings.

fayssal-el-majjouti

published 1.0.2 10 months 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

quidemeos

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

avayost

published 1.9.1 6 months ago

M

Q

P

dice-coefficient

Sørensen–Dice coefficient

wooorm

published 2.1.1 2 years ago

M

Q

P

voluptatesea

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

gailjones

published 1.5.0 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

esc-fmt-same-string-edges

Format 2 strings, human readable, easy compare, highlight beginning/middle/end (if applicable) same/different parts, algorithm/function, visualize/highlight, match unchanged context. Fast and minimal, zero dependencies, supply your own formatting function