Search results
79 packages found
Fastest Levenshtein distance implementation in JS.
- levenshtein
- distance
- fast
- fastest
- edit
- string
- similarity
- algorithm
- match
- comparison
- fuzzy
- search
- matching
- similar
- View more
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
Calculates similarity between two strings
- fuzzy search
- string similarity
- dice coefficient
- dice's
- sorenson-dice
- fuzzy
- string match
- string
- typos
- misspell
- misspelling
- compare strings
A fast, accurate and multilingual fuzzy search library.
A pure (functional) version of Joshaven Potter's string_score package which doesn't alter the String prototype.
Intuitive approximate string matching (i.e. fuzzy searches)
Calculates similarity between two strings
- aspernatur
- string similarity
- dice coefficient
- facilis
- sorenson-dice
- fuzzy
- string match
- necessitatibus
- quisquam
- ut
- numquam
- compare strings
Fastest Levenshtein distance implementation in JS.
- levenshtein
- distance
- fast
- fastest
- edit
- string
- similarity
- algorithm
- match
- comparison
- fuzzy
- search
- matching
- similar
- View more
Calculates similarity between two strings
- fuzzy search
- string similarity
- dice coefficient
- dice's
- sorenson-dice
- fuzzy
- string match
- string
- illo
- aut
- misspelling
- compare strings
Fastest Levenshtein distance implementation in JS.
Search for a malformed string. Think of Levenshtein distance but in search.
Yet another javascript fuzzy matching library
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
Yet another javascript fuzzy matching library
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
Approximate (fuzzy) string matching just like you are used to from Sublime Text and others.
Removes fuzzy characters from semver string
Search for a given subsequence in a list of strings and transform the resulting list as required
FuzzyJSONParser is a robust JSON parser designed to handle and recover data from JSON strings with extraneous text and incomplete structures. It can parse JSON strings that include redundant pre/post content and recover from missing closing characters lik
Search some text and receive a search score using configurable parameters