Search results
178 packages found
Finds degree of similarity between strings, based on Dice's Coefficient.
Fast and tiny fuzzy-search utility
Calculates the Levenshtein (edit) distance between two strings.
Compare strings with best suitable algorithm for your need
[](https://www.npmjs.com/package/levenary) [](https://github.com/tanhauhau/levenary/actions)
- leven
- levenshtein
- distance
- array
- string
- algorithm
- algo
- difference
- diff
- fast
- fuzzy
- similar
- similarity
- compare
- View more
Simple package to implement levenshtein distance algorithm in typescript
How similar are these 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
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.
An efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.
Collection of usefull methods for testing on the browser console
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
QWERTY-Adjusted Levenshtein Distance computation on JS
Over simplistic fuzzy search library using Damerau-Levenshtein and optionally the keyboard layout to calculate distances.
Fuzzy Matching Library with Levenshtein Edit Distance, Tailored for Korean Language Support
MAM Helpers
Ukkonens approximate string matching algorithm for finding edit distance similar to Levenshtein
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
A lightweight, rule-based text similarity calculator that selects the most appropriate comparison algorithm based on input string lengths.