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

nxsearch: a full-text search engine

📸 Clean your image folder using perceptual hashing and BK-trees using Go!

Data structures for fuzzy string search

implementation of bk-tree for golang

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.

Rust implementation of a BK-tree datastructure

Burkhard-Keller trees implementation

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.

Erlang BK-Tree

A BK tree for fast, fuzzy, in-memory string matching

Spell checker written in Kotlin

BK-tree implementation for spell checking

Fuzzy Matching Code in T-SQL Using BK-Tree Structure

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