minimum edit distance
Levenshtein edit distance
Match human-quality input to potential matches by edit distance.
Fastest Levenshtein distance implementation in JS.
String and tree edit distance
A library implementing different string similarity
The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.
Measures the straight-line distance between two points, like cities or landmarks.
Simple breadth-first early terminating Levenshtein distance auto correcter for small sets of possible resulting strings.
NPM package that calculates synchronously or asynchronously the Damerau-Levenshtein distance between strings
Measure the difference between two strings using the Levenshtein distance algorithm
Calculate the influence or weight of points over an area based on their distances.
Calculates the distance along a rhumb line between two points.
Calculates the distance between a given point and the nearest point on a line.
Get signed distance field for a svg path
Compute the euclidean distance between two vectors
Estimate points on a bezier curve or a set of connexted bezier curves
Estimate points on a SVG path
Returns the shortest path from start to end without colliding with any Feature in obstacles.
Provides helper functions to create GeoJSON features, like points, lines, or areas on a map.
library for simularity identification
An Implementation of Jaro Distance Algorithm by Matthew A. Jaro
Browser-side SDF font generator
turf destination module