Tool for managing data-deduplication within extant compressed archive files, along with a relatively performant BK tree implementation for fuzzy image searching.
-
Updated
Aug 26, 2023 - Python
Tool for managing data-deduplication within extant compressed archive files, along with a relatively performant BK tree implementation for fuzzy image searching.
A BK tree implementation for fast fuzzy string matching
String metrics function in golang (levenshtein, damerau-levenshtein, jaro, jaro-winkler and additionally bk-tree) for autocorrect
📸 Clean your image folder using perceptual hashing and BK-trees using Go!
nxsearch: a full-text search engine
This application is an implementation of a spell checker for English text. The spell checker incorporates a database of known words, which is built from a simple word list. The Burkhard-Keller Tree (BK-Tree for short) organizes the word list for efficient 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.
A BK tree for fast, fuzzy, in-memory string matching
Spell checker written in Kotlin
Simple spell checker using Levenshtein Distance and BK Trees
An application to suggest best matched places from OpenStreetMap, for your input place name.
A BK Tree using the Levenshtein Distence as metric to impliment a spell checker
Fuzzy Matching Code in T-SQL Using BK-Tree Structure
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."