Search results for "dist:Tree-BK Matching"
Tree::BK - Structure for efficient fuzzy matching
The Burkhard-Keller, or BK tree, is a structure for efficiently performing fuzzy matching. By default, this module assumes string input and uses "distance" in Text::Levenshtein::XS to compare items and build the tree. However, a subroutine giving the...
NGLENN/Tree-BK-0.02 - 11 Oct 2014 08:52:11 UTC