Pydantic extension for annotating autocorrecting fields.
-
Updated
Jun 20, 2024 - Python
Pydantic extension for annotating autocorrecting fields.
Port of SeatGeek's fuzzywuzzy
Top-k Approximate String Matching.
A BK tree implementation for fast fuzzy string matching
A fuzzy string comparison library for Elixir
Perform visual music-based fugal analysis using subjects, countersubjects, and their transformations.
A BK tree for fast, fuzzy, in-memory string matching
A library for fuzzy-string-searching using suffix trees and levenschtein automatons to perform extremely fast search queries on large data sets. Serialize and deserialize functions allow suffix trees to persist (and drastically reduce preprocessing time).
DuckDB Extension for fuzzy string matching based autocompletion
A fuzzy string dictionary based on Levenshtein automata
Fuzzy string comparison library
Fuzzy string matching in serial and parallel implementations with benchmarking in C++, C# and Python.
A project to use different computational approaches to identify natural product mentions in unstructured character strings.
HJ search is a full-stack web app. A search engine which is a real time search box where users search articles and then the search engine records and displays analytics about what users searched the most, number of times they searched a particular query and other information.
Search Approximate String Matching using multithreading
Fuzzy string algorithms for Roblox
Spell Checking for bad casing and invalid character duplication
Fuzzy String Search, developed using C++, to implement fuzzy string matching. This is done using the Data Structure, BK-Trees. Given a file containing words, the contents are extracted and inserted to the BK-Tree to enable searching and spelling corrections.
Add a description, image, and links to the fuzzy-string-matching topic page so that developers can more easily learn about it.
To associate your repository with the fuzzy-string-matching topic, visit your repo's landing page and select "manage topics."