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

Data structures for fuzzy string search

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

Erlang BK-Tree

Burkhard-Keller trees implementation

implementation of bk-tree for golang

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.

BK-tree implementation for spell checking

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

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

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

Elixir BK tree

A python implementation of bk trees and Levenshtein distances

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.