Search results
47 packages found
String difference with colour for Node.js and ANSI formatting. [FREE]
Text diff algorithm based on 'An O(NP) Sequence Comparison Algorithm' from Sun Wu, Udi Manber and Gene Myers
Fastest Levenshtein distance implementation in JS.
- levenshtein
- distance
- fast
- fastest
- edit
- string
- similarity
- algorithm
- match
- comparison
- fuzzy
- search
- matching
- similar
- View more
Get a pretty output of the original, minified, gzipped size of a string or buffer: 130 B → 91 B → 53 B (gzip)
A light weight package for object and array manipulation. As well as some utilities for matching text.
String's percent similarity
A lightning-fast implementation of the Levenshtein distance algorithm. Written in AssemblyScript, compiled to WebAssembly, and optimized for speed.
- levenshtein
- levenshtein-wasm
- levenshtein-distance
- distance
- algorithm
- assemblyscript
- wasm
- webassembly
- string
- compare
- fast
- fastest
- match
- difference
Finds degree of similarity between strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.
- strings
- similar
- difference
- similarity
- compare
- comparison
- degree
- match
- matching
- dice
- levenshtein
- percentage
- score
- algorithm
- View more
Return the index of first difference occurence between given string, number or array
Uses cache to save already computed levenshtein distance. If the strings you compare often repeat, this will save you a lot of compotation power
Diff any array-like object, including strings
A lightweight (~1.2kB gzipped) library to format date strings based on time difference.
Measure the difference between two strings using the Levenshtein distance algorithm
- cli-app
- cli
- leven
- levenshtein
- distance
- algorithm
- string
- difference
- diff
- fast
- fuzzy
- similar
- similarity
- compare
- View more
A fork of js-levenshtein by gustf adding a limit to the distance calculation.
- levenshtein
- distance
- algorithm
- algo
- string
- difference
- diff
- fast
- fuzzy
- similar
- similarity
- compare
- comparison
- edit
- View more
Basic usage. Basic scope. Easy to use.
Computes differences between two arrays, buffers or strings
Finds measure of similarity/distance between two input sets.
- set
- sorensen
- dice
- jaccard
- ochiai
- otsuka
- barkman
- overlap
- levenshtein
- edit-distance
- euclidean
- distance
- coefficient
- algorithm
- View more
Returns a difference between two strings using soundex, levenshtein distance or both.
Compare Strings Similarity Based on Levenshtein Distance Algorithm
- leven
- levenshtein
- algo
- algorithm
- string
- strings
- difference
- diff
- similar
- similarity
- compare
- comparison
- match
- matching
Auto Correct City names (AutoCorrects Top Indian Cities, for Now), Give a incorrect city name and get the most relevant city name
- leven
- levenshtein
- algo
- algorithm
- string
- strings
- difference
- diff
- Cities
- city
- Indian cities
- Indian city
- India
- similar
- View more