Search results
126 packages found
Compute the Levenshtein distance between two strings.
provides functions for comparing and calculating the similarity between two strings using various methods.
- compare
- comparison
- didyoumean
- diff
- difference
- distance
- edit
- find
- fuzzy
- leven
- levenshtein
- match
- matching
- similar
- View more
QWERTY-Adjusted Levenshtein Distance computation on JS
The Levenshtein distance metric for node and browser.
The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.
- levenshtein
- distance
- algorithm
- in
- veritatis
- culpa
- diff
- fast
- fuzzy
- similar
- similarity
- compare
- comparison
- edit
- View more
The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.
A Levenshtein algorithm implementation written in ES6
Finds degree of similarity between strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.
Compute the edit distance between strings by approximate matching.
Fuzzy Matching Library with Levenshtein Edit Distance, Tailored for Korean Language Support
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
[![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)
- leven
- levenshtein
- distance
- array
- string
- algorithm
- algo
- difference
- diff
- fast
- fuzzy
- similar
- similarity
- compare
- View more
How similar are these two strings?
An efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.
A minimal algorithm for computing Levenshtein distance in JavaScript.
Wrapper for edlib sequence alignment library
Super-fast Levenshtein edit distance with a maximum
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
Finds measure of similarity/distance between two input sets.
- set
- sorensen
- dice
- jaccard
- ochiai
- otsuka
- barkman
- overlap
- levenshtein
- edit-distance
- euclidean
- distance
- coefficient
- algorithm
- View more
A much faster than the naïve Levenshtein distance algoritme