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.
Spell checker written in Kotlin
An implementation of a BK-tree (metric tree) for spell checking. It presents a fast lookup for words within a specified distance.
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 for fast, fuzzy, in-memory string matching
A BK tree implementation for fast fuzzy string matching
A python implementation of bk trees and Levenshtein distances
A BK Tree using the Levenshtein Distence as metric to impliment a spell checker
String metrics function in golang (levenshtein, damerau-levenshtein, jaro, jaro-winkler and additionally bk-tree) for autocorrect
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.
📸 Clean your image folder using perceptual hashing and BK-trees using Go!
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."