Levenshtein Packages

library to measure levenshtein distance between words

Fastest Levenshtein distance implementation in JS.

A library for comparing strings and determining their similarity.

provides functions for comparing and calculating the similarity between two strings using various methods.

Levenshtein distance is a measure of the similarity between two strings, which takes into account the number of insertion, deletion and substitution operations needed to transform one string into the other.

A simple, optimized JS library & node.js module for matching short, human-quality input to a list of possibilities.

@magic library to calculate levenshtein distances.

Collection of string utilities. Edit-Distances, Search and Data structures. Offers for example trie, levenshtein distance.

Calculates the Levenshtein (edit) distance between two strings.

A fork of js-levenshtein by gustf adding a limit to the distance calculation.

Standalone package designed as helper for on-lang. Fetches catalog from SchemStore (www.schemastore.org) and categorises it into different entities based on similarity.

A TypeScript package for fuzzy string search

Fast and tiny fuzzy-search utility