a library for matching human-quality input to a list of potential matches using the Levenshtein distance algorithm
-
Updated
Jun 4, 2024 - TypeScript
a library for matching human-quality input to a list of potential matches using the Levenshtein distance algorithm
Наш проект направлен на изучение фамилий болгаро-гагаузского происхождения. Пользователи смогут проанализировать свои фамилии и больше узнать о своей идентичности. Кроме того, инструмент позволит исследователям изучать целый пул фамилий одновременно.
strcompare is a library for comparing strings using Hamming, Levenshtein, and Damerau-Levenshtein metrics.
Проект по курсу "Анализ данных"
Rapid fuzzy string matching in Python using various string metrics
Set of tools for implementing approximate search
Generic algorithms and data structures for Lazarus/Free Pascal
Simple chatbot (NLP ONLY without machine learning) using Levenshtein Distance + TF-IDF + Cosine Similiarity :D
A search engine made from scratch using Kotlin, Kobweb, Compose Runtime, Ktor, Coroutines, Exposed, and more.
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
Fast fuzzy regex matcher: specify max edit distance to find approximate matches
qlamda: txt2ques generation model
原神双语字幕 (暂时仅支持中日)
🐍📦 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
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."