|
A BK-tree is a metric tree suggested by Walter Austin Burkhard and Robert M. Keller specifically adapted to discrete metric spaces. For simplicity, let us 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 . == See also == * Levenshtein distance – the distance metric commonly used when building a BK-tree * Damerau–Levenshtein distance – a modified form of Levenshtein distance that allows transpositions 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「BK-tree」の詳細全文を読む スポンサード リンク
|