a library for matching human-quality input to a list of potential matches using the Levenshtein distance algorithm
-
Updated
May 26, 2024 - TypeScript
a library for matching human-quality input to a list of potential matches using the Levenshtein distance algorithm
Fuzzy search strings in strings in dotnet
String metrics library written in Go.
Massively import songs to Spotify!
Fuzzy string matching, grouping, and evaluation.
spell corrector using bst and levenshtein distance
Rapid fuzzy string matching in Python using various string metrics
Fast fuzzy regex matcher: specify max edit distance to find approximate matches
qlamda: txt2ques generation model
Generic algorithms and data structures for Lazarus/Free Pascal
原神双语字幕 (暂时仅支持中日)
🐍📦 Rapidly calculate and analyze the Word Error Rate (WER) with this powerful yet lightweight Python package.
Fuzzy Matching Code in T-SQL Using BK-Tree Structure
Algorithms and Data Structures
Simple package to implement levenshtein distance algorithm in typescript
📐 Compute distance between sequences. 30+ algorithms, pure python implementation, common interface, optional external libs usage.
A Twitter-like app that incorporates a feature to detect and warn users about potential cyberbullying in their text before posting. The app will also delete the post if it contains cyberbullying content after being posted.
standard spell-checker with perfect accuracy. no neural networks straight algorithms + leetcode
A collection of string comparisons 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."