Search results
179 packages found
Efficient implementation of Levenshtein algorithm with locale-specific collator support.
Maintenance: None. Quality: 62%. Popularity: 49%.
Fastest Levenshtein distance implementation in JS.
- levenshtein
- distance
- fast
- fastest
- edit
- string
- similarity
- algorithm
- match
- comparison
- fuzzy
- search
- matching
- similar
- View more
Maintenance: None. Quality: 63%. Popularity: 38%.
Damerau - Levenshtein distance by The Spanish Inquisition + relative distance
Maintenance: None. Quality: 61%. Popularity: 39%.
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
Maintenance: 33%. Quality: 65%. Popularity: 14%.
Match human-quality input to potential matches by edit distance.
Maintenance: None. Quality: 51%. Popularity: 39%.
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
Maintenance: None. Quality: 54%. Popularity: 35%.
Array / Arraylike utilities
Maintenance: 33%. Quality: 56%. Popularity: 11%.
Finds and fixes common and not so common broken named HTML entities, returns ranges array of fixes
Maintenance: 32%. Quality: 62%. Popularity: 3%.
Fuzzy string matching algorithms and utilities, port of the TheFuzz Python library.
Maintenance: 33%. Quality: 52%. Popularity: 8%.
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
Maintenance: 20%. Quality: 65%. Popularity: 9%.
Library to interact con azure services
Maintenance: 33%. Quality: 64%. Popularity: 1%.
library to measure levenshtein distance between words
Maintenance: 33%. Quality: 64%. Popularity: 0%.
Search for a malformed string. Think of Levenshtein distance but in search.
Maintenance: 32%. Quality: 62%. Popularity: 2%.
Morph one word into another, one letter at a time
Maintenance: 29%. Quality: 64%. Popularity: 2%.
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
Maintenance: None. Quality: 63%. Popularity: 21%.
All mismatch between two strings
Maintenance: 33%. Quality: 62%. Popularity: 1%.
Standalone package designed as helper for on-lang. Fetches catalog from SchemStore (www.schemastore.org) and categorises it into different entities based on similarity.
- onlang
- onlang-schema
- json
- onl
- schemastore
- natural
- similarity
- search
- schema
- cli
- onst-schemastore
- onst
- levenshtein
Maintenance: 32%. Quality: 61%. Popularity: 2%.
Finds degree of similarity between strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.
Maintenance: 33%. Quality: 61%. Popularity: 0%.
Levenshtein edit distance
Maintenance: None. Quality: 64%. Popularity: 15%.
A library for comparing strings and determining their similarity.
Maintenance: 33%. Quality: 52%. Popularity: 1%.