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
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.
📸 Clean your image folder using perceptual hashing and BK-trees using Go!
nxsearch: a full-text search engine
A BK tree for fast, fuzzy, in-memory string matching
String metrics function in golang (levenshtein, damerau-levenshtein, jaro, jaro-winkler and additionally bk-tree) for autocorrect
Spell checker written in Kotlin
Simple implementation of Burkhard Keller Trees in Kotlin
Simple spell checker using Levenshtein Distance and BK Trees
A python implementation of bk trees and Levenshtein distances
An application to suggest best matched places from OpenStreetMap, for your input place name.
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."