Search results
129 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
Damerau - Levenshtein distance by The Spanish Inquisition + relative distance
Fastest Levenshtein distance implementation in JS.
- levenshtein
- distance
- fast
- fastest
- edit
- string
- similarity
- algorithm
- match
- comparison
- fuzzy
- search
- matching
- similar
- View more
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
Levenshtein edit distance
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
library to measure levenshtein distance between words
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
Search for a malformed string. Think of Levenshtein distance but in search.
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
Calculates the Levenshtein (edit) distance between two strings.
Finds degree of similarity between strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.
Simple package to implement levenshtein distance algorithm in typescript
Finds similar word(s) in a list of words
- leven
- levenshtein
- distance
- string
- difference
- diff
- suggest
- fuzzy
- similar
- similarity
- compare
- comparison
- edit
- text
- View more
How similar are these two strings?
[![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