Simple package to implement levenshtein distance algorithm in typescript
-
Updated
Apr 28, 2024 - TypeScript
Simple package to implement levenshtein distance algorithm in typescript
Finds similar word(s) in a list of words.
A Typescript library to find the minimal edit path between two generic arrays.
Group similar items together.
provides functions for comparing and calculating the similarity between two strings using various methods.
A tiny implementation of the Levenshtein edit distance algorithm.
An experimental lightning-fast Wasm-compiled levenshtein library.
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."