Customizable edit distance calculator
Match human-quality input to potential matches by edit distance.
Levenshtein edit distance
Fastest Levenshtein distance implementation in JS.
Measures the straight-line distance between two points, like cities or landmarks.
A library implementing different string similarity
The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.
Calculates the distance along a rhumb line between two points.
Calculate the influence or weight of points over an area based on their distances.
String and tree edit distance
Provides helper functions to create GeoJSON features, like points, lines, or areas on a map.
library for simularity identification
Measure the difference between two strings using the Levenshtein distance algorithm
Calculates the distance between a given point and the nearest point on a line.
A tiny implementation of the Levenshtein edit distance algorithm.
A string similarity function using the Jaro-Winkler distance metric.
Compute the euclidean distance between two vectors
Simple breadth-first early terminating Levenshtein distance auto correcter for small sets of possible resulting strings.
Calculates the distance from a point to the edges of a polygon or multi-polygon.
Distance and similarity functions to compare vectors
turf destination module
Browser-side SDF font generator
A JS library for finding optimal label position inside a polygon
[](https://npm.im/@dnd-kit/geometry)