Simple breadth-first early terminating Levenshtein distance auto correcter for small sets of possible resulting strings.

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

Fastest Levenshtein distance implementation in JS.

Wrap words to a specified length.

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.

Measure the difference between two strings using the Levenshtein distance algorithm

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

Compute the euclidean distance between two vectors

A set of tools to calculate edit distance and scores on a per word basis

A string similarity function using the Jaro-Winkler distance metric.

Calculates the distance from a point to the edges of a polygon or multi-polygon.

Provides helper functions to create GeoJSON features, like points, lines, or areas on a map.

Fast and tiny fuzzy-search utility

Levenshtein edit distance

Distance and similarity functions to compare vectors

Wrap words to a specified length.

[](https://npm.im/@dnd-kit/geometry)

Estimate points on a bezier curve or a set of connexted bezier curves