Compare Strings Similarity Based on Levenshtein Distance Algorithm

Git like diff between two strings, using the Levenshtein distance algorithm

Finds degree of similarity between two strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.

Measures the straight-line distance between two points, like cities or landmarks.

TypeScript definitions for fast-levenshtein

Measure the difference between two strings using the Levenshtein distance algorithm

A highly efficient, isomorphic, full-featured, multilingual text search engine library, providing full-text search, fuzzy matching, phonetic scoring, document indexing and more, with micro JSON state hydration/dehydration in-browser and server-side.

levenshtein distance measurements in vanilla ESM

Complete string distance and similarity algorithms package with WebAssembly and JavaScript implementations

small module to calculate if 2 images look alike using perceptual hash Hamming distance and Levenshtein distance

Library for NLU (Natural Language Understanding) done in Node.js

Calculates the distance along a rhumb line between two points.

Calculate the influence or weight of points over an area based on their distances.

Calculates the distance between a given point and the nearest point on a line.

The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.

use levenshtein-distance to correct spelling of some data in result ~~~~ npm install car-registration-distance ~~~~ ~~~~ import { improveResult } from 'car-registration-distance'; const a = { result: { vehicle_license_province: 'กรุงเทพมคร',

A powerful text classification library using Damerau-Levenshtein distance algorithm

Compute the euclidean distance between two vectors

mirror of js-levenshtein, bundled and exposed as ES module

TypeScript definitions for damerau-levenshtein