Get Hamming distance between arrays.
Calculate the hamming distance of two hex strings or buffers
Match human-quality input to potential matches by edit distance.
Fastest Levenshtein distance implementation in JS.
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
Finds the nearest point on a line to a given point
library for simularity identification
Browser-side SDF font generator
Measures the straight-line distance between two points, like cities or landmarks.
fs-extra contains methods that aren't included in the vanilla Node.js fs package. Such as recursive mkdir, copy, and remove.
JavaScript porting of the ArUco library supporting multiple dictionaries including ARUCO_MIP_36h12 and custom dictionaries for augmented reality marker detection
Estimate points on a bezier curve or a set of connexted bezier curves
A JS library for finding optimal label position inside a polygon
SDK for Hamming Evals Framework
A Javascript implementation of Charikar's hash for identification of similar documents.
Calculates the distance along a rhumb line between two points.
Calculate the influence or weight of points over an area based on their distances.
RaBitQ 1-bit quantized vector index in WebAssembly — 32× embedding compression with high-recall rerank, for browsers, Cloudflare Workers, Deno, and Bun
Provides helper functions to create GeoJSON features, like points, lines, or areas on a map.
Unopinionated, no-frills CLI argument parser
Estimate points on a SVG path
Uses Levenshtein Distance to find the closest string match or matches in an array
A string similarity function using the Jaro-Winkler distance metric.