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