Search results
178 packages found
Levenshtein distance implementation, with benchmarks, without dependencies
@magic library to calculate levenshtein distances.
Finds degree of similarity between two strings, based on Dice's Coefficient and Levenshtein Distance.
Ensemble de methodes prototypes utiles
Efficient implementation of Levenshtein algorithm with locale-specific collator support.
Distance between given email and popular domains
Compare Strings Similarity Based on Levenshtein Distance Algorithm
- leven
- levenshtein
- algo
- algorithm
- string
- strings
- difference
- diff
- similar
- similarity
- compare
- comparison
- match
- matching
To find similarity between two words/string
- similarity
- words
- string
- string-smiliarity
- word-similarity
- words-similarity
- strings-similarity
- levenshtein
- damerau
- damerau-levenshtein
- compare
- compare-strings
- compare-string
- compare-words
Suggest fixing misspelled, typos, matching human-quality input
- didyoumean
- string similarity
- spelling
- levenshtein
- typo
- similar
- matching
- suggestion
- spelling correction
- text correction
Use Levenshtein distance alg to find the most similar word in an array to the target word Edit
Auto Correct City names (AutoCorrects Top Indian Cities, for Now), Give a incorrect city name and get the most relevant city name
- leven
- levenshtein
- algo
- algorithm
- string
- strings
- difference
- diff
- Cities
- city
- Indian cities
- Indian city
- India
- similar
- View more
Word compare gives you the most closely related words to an input string. If you have a list of strings, word compare can give you the most closely related list elements to a string input.
Potsiu! is a simple utility function that allows you to update indexes of specific positions on a string after you apply some transformation to it. It is quite handy if you have data in which string indexes are specified, but for some reason you want to p
- potsiu
- transform
- string
- index
- updater
- utility
- string manipulation
- algorithm
- levenshtein
- context
- surroundings
- similarity
this library implements the edit distance algorithm (levenshtein original operation) to predict the correct spelling
Suggests which tasks you wanted to call unless you made a typo
Fast search for big arrays
A simple fuzzy search algorithm that uses the Levenshtein distance algorithm to find the closest match to a given string.
A Javascript library for fuzzy substring searches.
Compute the Levenshtein distance between two strings.
Calculate the Levenshtein distance between two strings.