Rapid fuzzy string matching in Python using various string metrics
-
Updated
Jun 27, 2024 - C++
Rapid fuzzy string matching in Python using various string metrics
A CLI spelling corrector for when you're unsure
Levenshtein edit distance in Rust
Generic algorithms and data structures for Lazarus/Free Pascal
A Speech-to-text transcription Model
Compare the sameness of two strings
a library for matching human-quality input to a list of potential matches using the Levenshtein distance algorithm
Web-based text aligner and comparator
Massively import songs to Spotify!
Less-wrong single-file Numba-accelerated Python implementation of Gotoh affine gap penalty extensions for the Needleman–Wunsch, Smith-Waterman, and Levenshtein algorithms for sequence alignment
Calculate various string metrics efficiently in Haskell
🐍📦 Rapidly calculate and analyze the Word Error Rate (WER) with this powerful yet lightweight Python package.
Implemented various spellcheck techniques like cosine similarity, jaccard similarity and levenshtein distance. Open to any further contributions.
Fast fuzzy regex matcher: specify max edit distance to find approximate matches
A .NET port of java-string-similarity
Наш проект направлен на изучение фамилий болгаро-гагаузского происхождения. Пользователи смогут проанализировать свои фамилии и больше узнать о своей идентичности. Кроме того, инструмент позволит исследователям изучать целый пул фамилий одновременно.
strcompare is a library for comparing strings using Hamming, Levenshtein, and Damerau-Levenshtein metrics.
Проект по курсу "Анализ данных"
Set of tools for implementing approximate search
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."