The bktrees package

[Tags:bsd3, library]

Burkhard-Keller trees provide an implementation of sets which apart from the ordinary operations also has an approximate member search, allowing you to search for elements that are of a certain distance from the element you are searching for.

[Skip to Readme]


Versions 0.1, 0.1.1, 0.1.2, 0.1.3, 0.2, 0.2.1, 0.2.2, 0.3, 0.3.1
Dependencies array, base (<4), containers [details]
License BSD3
Author Josef Svenningsson
Stability Unknown
Category Data Structures
Uploaded Tue Jun 29 12:07:14 UTC 2010 by JosefSvenningsson
Distributions NixOS:0.3.1
Downloads 10952 total (13 in the last 30 days)
0 []
Status Docs uploaded by user
Build status unknown [no reports yet]




splitbaseChoose the new smaller, split-up base package.EnabledAutomatic

Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info


Maintainer's Corner

For package maintainers and hackage trustees

Readme for bktrees

Readme for bktrees-0.3

This is a module I hacked together quickly after having read the following
blog post:,-Part-1-BK-Trees.html

I thought the data structure sounded cool so I thought it would be an 
interesting excerise to implement it. 

BK-trees can apparently perform very good in some circumstances. The 
paper "Fast Approximate String Matching in a Dictionary" (Baeza-Yates, 
Navarro 1998) recommends them over other structures for doing 
approximate search.

The original paper can be found here:

Henning Günter <> generously supplied two algorithms for
computing the levenshtein edit distance. The better one of the two is used in
the list instance for the Metric class.