Sort strings based on spaces in string and then run edit distance to decrease false negatives.
Match human-quality input to potential matches by edit distance.
Levenshtein edit distance
Fastest Levenshtein distance implementation in JS.
A JS library for finding optimal label position inside a polygon
Maintain and search through a sorted array using some low level functions
Measures the straight-line distance between two points, like cities or landmarks.
A library implementing different string similarity
A skip list implementation inspired by the Sorted Set in Redis.
The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.
Fast and tiny fuzzy-search utility
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.
Measure the difference between two strings using the Levenshtein distance algorithm
library for simularity identification
Calculates the distance between a given point and the nearest point on a line.
A sorted list of key-value pairs in a fast, typed in-memory B+ tree with a powerful API.
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.