keywords:string difference

fastest-levenshtein

Fastest Levenshtein distance implementation in JS.

ka-weihe

published 1.0.16 2 years ago

M

Q

P

leven

Measure the difference between two strings using the Levenshtein distance algorithm

sindresorhus

published 4.0.0 3 years ago

M

Q

P

@doubletrade/fastest-levenshtein

Fastest Levenshtein distance implementation in JS.

roxus

published 1.0.14 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 6.0.1 9 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 5 years ago

M

Q

P

string-mismatch

All mismatch between two strings

wil92

published 3.0.2 a month ago

M

Q

P

@ukon1990/js-utilities

A light weight package for object and array manipulation. As well as some utilities for matching text.

ukon1990

published 1.9.3 4 years ago

M

Q

P

diff-at

Return the index of first difference occurence between given string, number or array

cht8687

published 1.0.5 8 years 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 6 months ago

M

Q

P

generic-diff

Diff any array-like object, including strings

lucthev

published 1.0.1 8 years ago

M

Q

P

qlevens

A lightning-fast implementation of the Levenshtein distance algorithm. Written in AssemblyScript, compiled to WebAssembly, and optimized for speed.

hex2w

published 1.0.3 2 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 8 months ago

M

Q

P

symmetric-difference-strings

Find the symmetric difference of two string arrays.

girkovarpa

published 0.0.4 4 years 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 4 years 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 2 months ago

M

Q

P

@f1stnpm3/quibusdam-eligendi-soluta

This lib is forked from [mscdex/ssh2](https://github.com/mscdex/ssh2), The main difference is that the cpu-feature dependency is removed.

sinhatminh11

published 1.0.0 25 days ago

M

Q

P

ochiai-string-similarity

Finds measure of similarity between two strings using Ochiai coefficient.

varad11

published 1.0.6 5 years ago

M

Q

P

@hishprorg/ad-dolore

Fork of [Color Thief](https://github.com/lokesh/color-thief) v2.4.0, with the only difference being increasing the maximum number of colors in a palette from 20 to 50.