Search results
178 packages found
Simple benchmark for levenshtein using real-life data
Efficient implementation of Levenshtein algorithm with locale-specific collator support.
Collection of string utilities. Edit-Distances, Search and Data structures. Offers for example trie, levenshtein distance.
- string
- levenshtein
- hamming distance
- rope
- longest common substring
- substring
- longest common subsequence
- trie
- boyer moore
- palindrom
A tiny implementation of the Levenshtein edit distance algorithm.
Customizable comparison of a string against another full string or substring.
Fast implementation of the Levenshtein edit distance
Find closest matches to search query based on Levenshtein distance
Distance between two strings using the levenshtein algorithm
A Javascript library to compare and transform strings.
A Search library, with integrated threshhold.
Dynamic word set with accelerated exact and fuzzy search based on trie data structure.
Returns a difference between two strings using soundex, levenshtein distance or both.
Module to compare similarity between strings / arrays.
Fast string matcher conceived for quick replies chat and multiple choice scenario.
Find alternatives to specified keyword
A simple ES6 proxy wrapper that enables you to make typos in property names.
small module to calculate if 2 images look alike using perceptual hash Hamming distance and Levenshtein distance
Wrapper for edlib sequence alignment library
A lib to compare similarity of two strings
- string similarity
- edit distance
- levenshtein
- levenshtein distance
- lcs
- longest common subsequence
- simhash
- hamming distance
JavaScript port of the fast Damerau-Levenshtein string distance calculation algorithm used in Git