❤

npm

Search results

170 packages found

levenshtein6

A Levenshtein algorithm implementation written in ES6

published 0.1.4 8 years ago

M

Q

P

levenshtein-metric

The Levenshtein distance metric for node and browser.

published 0.0.3 9 years ago

M

Q

P

editdistance

A much faster than the naïve Levenshtein distance algoritme

published 0.2.2 10 years ago

M

Q

P

kled

Fuzzy Matching Library with Levenshtein Edit Distance, Tailored for Korean Language Support

published 0.1.6 6 months ago

M

Q

P

flex-json-searcher

FJS é uma biblioteca JavaScript que permite fazer buscas em um array de objetos com base em critérios de consulta flexíveis. Com o FJS, você pode realizar buscas complexas e precisas em seus dados usando operadores atômicos e operadores de busca avançados

published 1.0.7 5 months ago

M

Q

P

string-compare-score

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

published 1.0.1 2 years ago

M

Q

P

similarity

How similar are these two strings?

published 1.2.1 4 years ago

M

Q

P

find-similar

Finds similar word(s) in a list of words

published 1.2.5 10 months ago

M

Q

P

phishy

Check the phishy equality of a string

published 0.0.1 7 years ago

M

Q

P

mam-helpers

MAM Helpers

published 0.0.4 3 months ago

M

Q

P

group-similar

Group similar items together.

published 1.0.4 a year ago

M

Q

P

node-edlib

Wrapper for edlib sequence alignment library

published 1.1.2 7 years ago

M

Q

P

js-levenshtein-esm

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

published 1.2.0 5 years ago

M

Q

P

listenshtein

Filter a list based on Levenshtein distances

published 0.0.0 11 years ago

M

Q

P

simtext

A lightweight, rule-based text similarity calculator that selects the most appropriate comparison algorithm based on input string lengths.

published 0.1.7 8 months ago

M

Q

P

clustring

Algorithms for clustering strings

published 0.0.10 6 years ago

M

Q

P

edit-distance-search

Compute the edit distance between strings by approximate matching.

published 0.2.3 4 years ago

M

Q

P

levdist

A minimal algorithm for computing Levenshtein distance in JavaScript.

published 2.2.10 4 years ago

M

Q

P

bounded-levenshtein

Super-fast Levenshtein edit distance with a maximum

published 0.0.1 6 years ago

M

Q

P

levsimilarity

similarity based on Levenshtein distance

published 0.1.0 7 years ago

M

Q

P