Search results

179 packages found

Efficient implementation of Levenshtein algorithm with locale-specific collator support.

published version 3.0.0, 4 years ago

Maintenance: None. Quality: 62%. Popularity: 49%.

Fastest Levenshtein distance implementation in JS.

published version 1.0.16, 2 years ago

Maintenance: None. Quality: 63%. Popularity: 38%.

Damerau - Levenshtein distance by The Spanish Inquisition + relative distance

published version 1.0.8, 3 years ago

Maintenance: None. Quality: 61%. Popularity: 39%.

a library for matching human-quality input to a list of potential matches using the Levenshtein distance algorithm

published version 7.0.4, 2 months ago

Maintenance: 33%. Quality: 65%. Popularity: 14%.

Match human-quality input to potential matches by edit distance.

published version 1.2.2, 3 years ago

Maintenance: None. Quality: 51%. Popularity: 39%.

Measure the difference between two strings using the Levenshtein distance algorithm

published version 4.0.0, 3 years ago

Maintenance: None. Quality: 54%. Popularity: 35%.

Array / Arraylike utilities

published version 2.10.5, 11 days ago

Maintenance: 33%. Quality: 56%. Popularity: 11%.

Finds and fixes common and not so common broken named HTML entities, returns ranges array of fixes

published version 7.0.17, 10 months ago

Maintenance: 32%. Quality: 62%. Popularity: 3%.

Fuzzy string matching algorithms and utilities, port of the TheFuzz Python library.

published version 2.1.3, 2 months ago

Maintenance: 33%. Quality: 52%. Popularity: 8%.

Maintenance: 20%. Quality: 65%. Popularity: 9%.

Library to interact con azure services

published version 1.0.8, 2 months ago

Maintenance: 33%. Quality: 64%. Popularity: 1%.

library to measure levenshtein distance between words

published version 1.0.1, 3 months ago

Maintenance: 33%. Quality: 64%. Popularity: 0%.

Search for a malformed string. Think of Levenshtein distance but in search.

published version 4.0.17, 10 months ago

Maintenance: 32%. Quality: 62%. Popularity: 2%.

Morph one word into another, one letter at a time

published version 2.0.0, 5 years ago

Maintenance: 29%. Quality: 64%. Popularity: 2%.

The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.

published version 1.1.6, 6 years ago

Maintenance: None. Quality: 63%. Popularity: 21%.

All mismatch between two strings

published version 3.0.2, 7 months ago

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.

published version 1.2.2, 8 months ago

Maintenance: 32%. Quality: 61%. Popularity: 2%.

Finds degree of similarity between strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.

published version 4.0.4, 6 months ago

Maintenance: 33%. Quality: 61%. Popularity: 0%.

Levenshtein edit distance

published version 3.0.1, 2 years ago

Maintenance: None. Quality: 64%. Popularity: 15%.

A library for comparing strings and determining their similarity.

published version 1.0.1, 5 months ago

Maintenance: 33%. Quality: 52%. Popularity: 1%.