Search results
94 packages found
Fastest Levenshtein distance implementation in JS.
- levenshtein
- distance
- fast
- fastest
- edit
- string
- similarity
- algorithm
- match
- comparison
- fuzzy
- search
- matching
- similar
- View more
Provides mapping between country codes and provides default country locales. Includes optional fuzzy matching for country name.
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
Intuitive approximate string matching (i.e. fuzzy searches)
A fast, accurate and multilingual fuzzy search library.
Return all word matches between two arrays within given Levenshtein distance
Calculates similarity between two strings
- aspernatur
- string similarity
- dice coefficient
- facilis
- sorenson-dice
- fuzzy
- string match
- necessitatibus
- quisquam
- ut
- numquam
- compare strings
Calculates similarity between two strings
- fuzzy search
- string similarity
- dice coefficient
- dice's
- sorenson-dice
- fuzzy
- string match
- string
- typos
- misspell
- misspelling
- compare strings
Utility functions to mark and/or highlight character matches in texts
Fastest Levenshtein distance implementation in JS.
- levenshtein
- distance
- fast
- fastest
- edit
- string
- similarity
- algorithm
- match
- comparison
- fuzzy
- search
- matching
- similar
- View more
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
Fastest Levenshtein distance implementation in JS.
Calculates similarity between two strings
- fuzzy search
- string similarity
- dice coefficient
- dice's
- sorenson-dice
- fuzzy
- string match
- string
- illo
- aut
- misspelling
- compare strings
Yet another javascript fuzzy matching library
A tiny, efficient fuzzy matcher that doesn't suck
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
Minimal trie datastructure representation
- trie
- trie-d
- auto complete
- near match
- search
- hashmatch
- node-trie
- trie-search
- keywords-search
- dynamic trie
- word search
- word
- autocomplete
- autosearch
- View more
Search for a malformed string. Think of Levenshtein distance but in search.