a library for matching human-quality input to a list of potential matches using the Levenshtein distance algorithm
-
Updated
Jul 17, 2024 - TypeScript
a library for matching human-quality input to a list of potential matches using the Levenshtein distance algorithm
🤠A library implementing different string similarity using JavaScript.
Implementation of correct path suggestion using Levenshtein distance algorith
An experimental lightning-fast Wasm-compiled levenshtein library.
Implementation of some known string algorithmn and data structures like: Rope, Trie, Knuth Morris Pratt, Boyer Moore, Levenshtein
Compare the sameness of two strings
react hook for automated fallback/redirection based on fast-lev
A VS Code extension that allows you to run a fuzzy search across all file contents in your project.
qlamda: txt2ques generation model
Simple package to implement levenshtein distance algorithm in typescript
Various string search and Fuzzy String Matching algorithms. It contains implementations of Horspool, Boyer-Moore, Rabin-Karp as well as Brute Force algorithms for exact string matching. For Fuzzy Matching, it contains Hamming and Levenshtein Distance algorithms.
Add a description, image, and links to the levenshtein-distance topic page so that developers can more easily learn about it.
To associate your repository with the levenshtein-distance topic, visit your repo's landing page and select "manage topics."