Search results
47 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
A Node.js package to calculate string similarity.
- string
- matching
- comparison
- similarity
- algorithm
- node
- node.js
- npm
- package
- library
- util
- utility
- tool
- spell correction
- 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
Simple fuzzy matching
Given a name and a list of names that are not equal to the name, return a spelling suggestion if there is one that is close enough.
- spelling-suggestion
- spelling
- suggestion
- levenshtein
- leven
- compare
- algorithm
- match
- matching
- search
- comparison
- similarity
- similar
- diff
Generic implementation of the Gale-Shapley matching algorithm
A JavaScript implementation of the Caverphone 2.0 (aka Caverphone Revised) phonetic matching algorithm.
A javascript implementation of stable marriage problem
string similarity scoring algorithm
A lightweight Node.js module that implements the most common Approximate String Matching algorithms
[![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
Compare two string/text and find their similarity
The brand new, more generic matching algorithm used by Corona School.
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
Group similar items together.
- algorithm
- cluster
- compare
- comparison
- disjoint-set
- edit-distance
- fuzzy
- group
- group-similar
- grouping
- levenshtein
- match
- matching
- merge-find
- View more