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

implementation of bk-tree for golang

Burkhard-Keller trees implementation

Rust implementation of a BK-tree datastructure

Data structures for fuzzy string search

Erlang BK-Tree

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.

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

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

Elixir BK tree

Spell checker written in Kotlin

String metrics function in golang (levenshtein, damerau-levenshtein, jaro, jaro-winkler and additionally bk-tree) for autocorrect

An implementation of the BK-tree data structure in Go.

Simple spell checker using Levenshtein Distance and BK Trees

Simple implementation of Burkhard Keller Trees in Kotlin

An implementation of a BK-tree (metric tree) for spell checking. It presents a fast lookup for words within a specified distance.

Spell checker in C based on bk-tree and levenshtein distance