a library for matching human-quality input to a list of potential matches using the Levenshtein distance algorithm
-
Updated
Jun 11, 2024 - TypeScript
a library for matching human-quality input to a list of potential matches using the Levenshtein distance algorithm
A little library to calculate the edit distance between 2 strings.
Group similar items together.
A Typescript library to find the minimal edit path between two generic arrays.
Add a description, image, and links to the edit-distance topic page so that developers can more easily learn about it.
To associate your repository with the edit-distance topic, visit your repo's landing page and select "manage topics."