test suite for tree-edit-distance algorithms
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.
Ukkonens approximate string matching algorithm for finding edit distance similar to Levenshtein
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
library for simularity identification
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
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.
TypeScript definitions for js-levenshtein
Distance and similarity functions to compare vectors
Image Quantization Library in **TypeScript** *(MIT Licensed)*
TypeScript definitions for jaro-winkler