Search results
178 packages found
Efficient implementation of Levenshtein algorithm with locale-specific collator support.
Measure the difference between two strings using the Levenshtein distance algorithm
- leven
- levenshtein
- distance
- algorithm
- string
- difference
- diff
- fast
- fuzzy
- similar
- similarity
- compare
- comparison
- edit
- View more
Fastest Levenshtein distance implementation in JS.
- levenshtein
- distance
- fast
- fastest
- edit
- string
- similarity
- algorithm
- match
- comparison
- fuzzy
- search
- matching
- similar
- View more
Damerau - Levenshtein distance by The Spanish Inquisition relative distance
a library for matching human-quality input to a list of potential matches using the Levenshtein distance algorithm
- closest
- compare
- comparison
- didyoumean
- diff
- difference
- distance
- edit
- find
- fuzzy
- leven
- levenshtein
- match
- matching
- View more
Match human-quality input to potential matches by edit distance.
Array / Arraylike utilities
Finds and fixes common and not so common broken named HTML entities, returns ranges array of fixes
Library to interact con azure services
library to measure levenshtein distance between words
Search for a malformed string. Think of Levenshtein distance but in search.
Standalone package designed as helper for on-lang. Fetches catalog from SchemStore (www.schemastore.org) and categorises it into different entities based on similarity.
- onlang
- onlang-schema
- json
- onl
- schemastore
- natural
- similarity
- search
- schema
- cli
- onst-schemastore
- onst
- 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
All mismatch between two strings
A library implementing different string similarity
- strings
- compare similarity
- similarity
- Dice's Coefficient
- Cosine
- Jaccard Index
- Levenshtein
- Longest Common Subsequence
- Metric Longest Common Subsequence
- difference
- compare
- comparision
- similar
- distance
- View more
A package for playing around with different dictionaries. Supports Swedish and English.
- swedish
- english
- german
- french
- spanish
- levenshtein
- levenshtein distance
- palindrome
- palindromes
- anagram
- anagrams
- word
- words
- similarity
- View more
Finds degree of similarity between strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.
Levenshtein edit distance
Este pacote oferece uma coleção de algoritmos úteis relacionados ao cálculo de similaridade de strings utilizando o algoritmo de Levenshtein. Ideal para desenvolvedores que precisam comparar strings de forma eficiente e precisa, ele inclui funções avançad
Fast and tiny fuzzy-search utility