Search results
93 packages found
Distance between two strings using the levenshtein algorithm
Customizable comparison of a string against another full string or substring.
Calculate the Hamming distance between two equal-length strings.
Calculates the Levenshtein (edit) distance between two strings.
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
A collection of common string functions.
- extra
- string
- at
- infix
- isInfix
- isPrefix
- isSuffix
- left
- prefix
- right
- size
- suffix
- CompareFunction
- MapFunction
- View more
A collection of common string functions {web}.
- extra
- string
- at
- infix
- isInfix
- isPrefix
- isSuffix
- left
- prefix
- right
- size
- suffix
- CompareFunction
- MapFunction
- View more
Implementations of various string similarity metrics.
String utilities.
this library implements the edit distance algorithm (levenshtein original operation) to predict the correct spelling
lightweight npm package to calculate string similarity
Fast string matcher conceived for quick replies chat and multiple choice scenario.
provides functions for comparing and calculating the similarity between two strings using various methods.
- compare
- comparison
- didyoumean
- diff
- difference
- distance
- edit
- find
- fuzzy
- leven
- levenshtein
- match
- matching
- similar
- View more
The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.
Fuzzy Matching Library with Levenshtein Edit Distance, Tailored for Korean Language Support
The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.
[](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
How similar are these two strings?
Finds degree of similarity in list of array of objects , based on Dice's Coefficient, which is mostly better than Levenshtein distance.