levenshtein-distance

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

Fast fuzzy string matching for Node.js and the browser

A modern web application that helps you discover recipes based on what you have in your kitchen

✦ Preact environment auditor for .env parity, missing keys, secret masking, typo detection, and redacted reports.

Git like diff between two types, using the Levenshtein distance algorithm

A high-performance TypeScript library for string similarity, distance algorithms, and text normalization utilities

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.

Adaptive language quiz app with an LLM content pipeline and model-evaluation framework

Scoring-based fuzzy search with Myers Levenshtein distance and radix/tim sort ranking. Part of the ex-* ecosystem.

Simple package to implement levenshtein distance algorithm in typescript