An experimental lightning-fast Wasm-compiled levenshtein library.
-
Updated
Mar 6, 2023 - TypeScript
An experimental lightning-fast Wasm-compiled levenshtein library.
A tiny implementation of the Levenshtein edit distance algorithm.
provides functions for comparing and calculating the similarity between two strings using various methods.
A Typescript library to find the minimal edit path between two generic arrays.
Group similar items together.
Finds similar word(s) in a list of words.
Simple package to implement levenshtein distance algorithm in typescript
Add a description, image, and links to the levenshtein topic page so that developers can more easily learn about it.
To associate your repository with the levenshtein topic, visit your repo's landing page and select "manage topics."