From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

A BK-tree is a metric tree suggested by Walter Austin Burkhard and Robert M. Keller[1] specifically adapted to discrete metric spaces. For simplicity, consider integer discrete metric . Then, BK-tree is defined in the following way. An arbitrary element a is selected as root node. The root node may have zero or more subtrees. The k-th subtree is recursively built of all elements b such that . BK-trees can be used for approximate string matching in a dictionary.[2][example needed]

See also[edit]


External links[edit]

  • A BK-tree implementation in Common Lisp with test results and performance graphs.
  • An explanation of BK-Trees and their relationship to metric spaces [3]
  • An explanation of BK-Trees with an implementation in C#[4]
  • A BK-tree implementation in Lua [5]
  • A BK-tree implementation in Python [6]