Distance Packages

Efficient implementation of Levenshtein algorithm with locale-specific collator support.

Measure the difference between two strings using the Levenshtein distance algorithm

Damerau - Levenshtein distance by The Spanish Inquisition + relative distance

[](https://www.npmjs.com/package/levenary) [](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.

Match human-quality input to potential matches by edit distance.

turf distance module

turf rhumb-distance module

turf destination module

turf length module

turf along module

turf point-to-line-distance module

gl-matrix's vec3, split into smaller pieces

turf rhumb-destination module

turf line-slice module

Get signed distance field for a svg path

Levenshtein edit distance

A minimal algorithm for computing Levenshtein distance in JavaScript.

a library for matching human-quality input to a list of potential matches using the Levenshtein distance algorithm