is-arrayish
Determines if an object can be used as an array
Determines if an object can be used as an array
Measure the difference between two strings using the Levenshtein distance algorithm
[![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)
Fastest Levenshtein distance implementation in JS.
The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.
Finds degree of similarity between strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.
Object properties matcher for Chai
a library for matching human-quality input to a list of potential matches using the Levenshtein distance algorithm
Propse a word when the input word is not in the dictionary
library for simularity identification
The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.
A collection of string matching algorithms built with React Select in mind
Extends Chai with an assertion for deeply matching objects (i.e. subset equality checking)
A library implementing different string similarity
Find the closest CSS color keyword for a given HEX color value.
Simply sort by similarity, starring Levenshtein via leven
A quick and easy Damerau Levenshtein implementation (not a Levenshtein only operation which doesn't do look aheads or transpositions).
Fastest Levenshtein distance implementation in JS.
It accespts two arrays and in response returns unique values from it
Search for a malformed string. Think of Levenshtein distance but in search.