Search results

string-similarity-arraylist

Finds degree of similarity in list of array of objects , based on Dice's Coefficient, which is mostly better than Levenshtein distance.

• string
• similarity
• array
• list

creatorssumit

published 1.0.3 • a year agopublished 1.0.3 a year ago

teneturad

Fastest Levenshtein distance implementation in JS.

• ut
• et
• numquam
• edit
• string
• laudantium
• algorithm
• match
• comparison
• fuzzy
• accusamus
• odio
• voluptate
• node

bryonschuster

published 1.1.1 • 6 months agopublished 1.1.1 6 months ago

js-levenshtein-esm

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

• levenshtein
• distance
• algorithm
• algo
• string
• difference
• diff
• fast
• fuzzy
• similar
• similarity
• compare
• comparison
• edit
• View more

43081j

published 1.2.0 • 6 years agopublished 1.2.0 6 years ago

ukkonen

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

• Ukkonen
• Hal
• Berghel
• Aproximate
• string
• match
• ASM
• EHD
• Levenshtein

sunesimonsen

published 2.1.0 • 2 years agopublished 2.1.0 2 years ago

edit-distance

String and tree edit distance

• string
• levenshtein
• tree
• zhang-shasha
• edit
• distance
• similarity
• algorithm
• metric

schulzch

published 1.0.5 • 3 years agopublished 1.0.5 3 years ago

sift-distance

SIFT distance algorithm

• sift
• distance
• string
• algorithm

jhermsmeier

published 4.0.0 • 10 years agopublished 4.0.0 10 years ago

@extra-string/jaccard-distance

Get Jaccard distance between strings.

• extra
• string
• standard
• utility
• method
• text
• manipulation
• function
• merferry
• jaccard
• distance

wolfram77

published 1.1.3 • 6 years agopublished 1.1.3 6 years ago

substr-distance

Get the distance of a substring from the start of a line

• substr
• substring
• string
• distance
• indent

gakimball

published 1.0.0 • 7 years agopublished 1.0.0 7 years ago

mdiff

An LCS Implementaion for Arrays and Strings

• diff
• lcs
• longest common subsequence
• edit-distance
• array
• string

tapirdata

published 1.4.2 • 3 years agopublished 1.4.2 3 years ago

@edit-distance/myers-1986

Reasonably efficient and concise exact longest common subsequence and minimum edit-distance algorithm implementation for JavaScript

• Hirschberg
• Myers
• Ukkonen
• common
• distance
• divide-and-conquer
• edit
• exact
• longest
• optimal
• string
• subsequence

aureooms

published 1.1.0 • 3 years agopublished 1.1.0 3 years ago

compute-hamming

Computes the Hamming distance between two sequences.

• compute.io
• compute
• computation
• hamming
• distance
• similarity
• information theory
• mathematics
• math
• array
• string
• dist
• information
• overlap
• View more

kgryte

published 1.1.0 • 9 years agopublished 1.1.0 9 years ago

s-sortbydistance

Sort array of strings by Levenshtein (Sift4) distance

• string
• distance
• sort
• levenshtein
• sift
• sift3
• sift4

seabass

published 1.1.0 • 9 years agopublished 1.1.0 9 years ago

levenshtein-lite

A lightweight implementation of the Levenshtein distance algorithm.

• levenshtein
• lite
• levenshtein-lite
• edit
• distance
• minimum
• soft
• string
• matching

nickzuber

published 1.0.9 • 8 years agopublished 1.0.9 8 years ago

group-similar

Group similar items together.

• algorithm
• cluster
• compare
• comparison
• disjoint-set
• edit-distance
• fuzzy
• group
• group-similar
• grouping
• levenshtein
• match
• matching
• merge-find
• View more

peterthehan

published 1.0.4 • a year agopublished 1.0.4 a year ago

compute-tversky-index

Computes the Tversky index between two sequences.

• compute.io
• compute
• computation
• similarity
• dissimilarity
• string
• array
• information theory
• distance

kgryte

published 1.0.0 • 10 years agopublished 1.0.0 10 years ago

leven-sort

Simply sort by similarity, starring Levenshtein via leven

• sort
• leven
• levenshtein
• distance
• algorithm
• algo
• string
• difference
• diff
• fast
• fuzzy
• similar
• similarity
• compare
• View more

doesdev

published 4.0.0 • 2 years agopublished 4.0.0 2 years ago

fast-levenshtein-string

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

• Levenshtein
• distance
• string
• auto-completion

edumdum

published 1.0.1 • 5 years agopublished 1.0.1 5 years ago

@doubletrade/fastest-levenshtein

Fastest Levenshtein distance implementation in JS.

• levenshtein
• distance
• fast
• fastest
• edit
• string
• similarity
• algorithm
• match
• comparison
• fuzzy
• search
• matching
• similar
• View more

roxus

published 1.0.14 • 2 years agopublished 1.0.14 2 years ago

string-compare-score

this package lets you compare two strings and give you how much percent they are similar

• strings
• similar
• difference
• similarity
• compare
• comparison
• degree
• match
• matching
• dice
• levenshtein
• percentage
• score
• algorithm
• View more

tazimnpm

published 1.0.1 • 2 years agopublished 1.0.1 2 years ago

mudder

Find lexicographical points between strings

• string
• mean
• lexicographical
• distance
• number
• radix
• base

fasiha

published 2.1.1 • 2 years agopublished 2.1.1 2 years ago