Search results
36 packages found
A javascript text diff implementation.
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
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
line by line diff of two large files
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
Assert functions for comparing texts line by line
A javascript text diff implementation.
A light weight package for object and array manipulation. As well as some utilities for matching text.
A line-by-line diffing tool that returns adjusted comparison text
A javascript text diff implementation.
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 similar word(s) in a list of words
- leven
- levenshtein
- distance
- string
- difference
- diff
- suggest
- fuzzy
- similar
- similarity
- compare
- comparison
- edit
- text
- View more
[](https://www.npmjs.com/package/levenary) [](https://github.com/tanhauhau/levenary/actions)
- leven
- levenshtein
- distance
- array
- string
- algorithm
- algo
- difference
- diff
- fast
- fuzzy
- similar
- similarity
- compare
- View more
Text diff library exported from monaco-editor-core, which is core of VS Code.
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
Finds measure of similarity between two strings using Ochiai coefficient.
- ochihai
- otsuka
- barkman
- distance
- coefficient
- algo
- algorithm
- string
- strings
- difference
- diff
- similar
- similarity
- compare
- View more
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
String directory
Simply sort by similarity, starring Levenshtein via leven
- sort
- leven
- levenshtein
- distance
- algorithm
- algo
- string
- difference
- diff
- fast
- fuzzy
- similar
- similarity
- compare
- View more