Fuzzy Matching Code in T-SQL Using BK-Tree Structure
-
Updated
Apr 29, 2024 - TSQL
Fuzzy Matching Code in T-SQL Using BK-Tree Structure
Simple implementation of Burkhard Keller Trees in Kotlin
Tool for managing data-deduplication within extant compressed archive files, along with a relatively performant BK tree implementation for fuzzy image searching.
A highly efficient, isomorphic, full-featured, multilingual text search engine library, providing full-text search, fuzzy matching, phonetic scoring, document indexing and more, with micro JSON state hydration/dehydration in-browser and server-side.
nxsearch: a full-text search engine
Spell checker in C based on bk-tree and levenshtein distance
Inverted Search Engine implementation in C based on the Sigmod 2013 competition. Implemented complex data structures and thread synchronization to make the search engine efficient.
📸 Clean your image folder using perceptual hashing and BK-trees using Go!
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.
String metrics function in golang (levenshtein, damerau-levenshtein, jaro, jaro-winkler and additionally bk-tree) for autocorrect
A BK Tree using the Levenshtein Distence as metric to impliment a spell checker
A python implementation of bk trees and Levenshtein distances
A BK tree implementation for fast fuzzy string matching
A BK tree for fast, fuzzy, in-memory string matching
Add a description, image, and links to the bk-tree topic page so that developers can more easily learn about it.
To associate your repository with the bk-tree topic, visit your repo's landing page and select "manage topics."