There are 0 repository under bk-tree topic.
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!
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
BK-tree implementation for spell checking
An application to suggest best matched places from OpenStreetMap, for your input place name.
Simple spell checker using Levenshtein Distance and BK Trees
Spell checker in C based on bk-tree and levenshtein distance
A python implementation of bk trees and Levenshtein distances
An implementation of a BK-tree (metric tree) for spell checking. It presents a fast lookup for words within a specified 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.
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.