Search results
48 packages found
Fastest Levenshtein distance implementation in JS.
- levenshtein
- distance
- fast
- fastest
- edit
- string
- similarity
- algorithm
- match
- comparison
- fuzzy
- search
- matching
- similar
- View more
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
Fastest Levenshtein distance implementation in JS.
- levenshtein
- distance
- fast
- fastest
- edit
- string
- similarity
- algorithm
- match
- comparison
- fuzzy
- search
- matching
- similar
- 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
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
All mismatch between two strings
A light weight package for object and array manipulation. As well as some utilities for matching text.
Return the index of first difference occurence between given string, number or array
Diff any array-like object, including strings
A module that calculates and returns the differences between two input 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
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
Find the symmetric difference of two string arrays.
The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.
This lib is forked from [mscdex/ssh2](https://github.com/mscdex/ssh2), The main difference is that the cpu-feature dependency is removed.
- streams
- importexport
- stable
- fast-clone
- getopt
- handlers
- cors
- minimal
- identifiers
- getter
- full
- agent
- stylesheet
- make
- View more
[![npm-version](https://img.shields.io/npm/v/levenary.svg)](https://www.npmjs.com/package/levenary) [![github-actions](https://github.com/tanhauhau/levenary/workflows/CI/badge.svg)](https://github.com/tanhauhau/levenary/actions)
- leven
- levenshtein
- distance
- array
- string
- algorithm
- algo
- difference
- diff
- fast
- fuzzy
- similar
- similarity
- compare
- View more
The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.
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
this package lets you compare two strings and give you how much percent they are similar
- strings
- similar
- difference
- similarity
- compare
- comparison
- degree
- match
- matching
- dice
- levenshtein
- percentage
- score
- algorithm
- View more