Comments on: Burkhard-Keller (BK) Trees In Python http://hupp.org/adam/weblog/2007/10/28/burkhard-keller-bk-trees-in-python/ The blog of Adam Hupp Sun, 23 Nov 2008 14:20:37 +0000 http://wordpress.org/?v=2.6 By: adam http://hupp.org/adam/weblog/2007/10/28/burkhard-keller-bk-trees-in-python/#comment-69 adam Mon, 29 Oct 2007 17:18:35 +0000 http://hupp.org/adam/weblog/2007/10/28/burkhard-keller-bk-trees-in-python/#comment-69 <p>Thanks for the pointer. I'll take a 50X speedup any day:</p> <pre><code class="prettyprint">>>> timeof(BKTree, levenshtein, w) time: 147.626706839 >>> timeof(BKTree, clevenshtein, w) time: 2.95655703545 >>> </code></pre> Thanks for the pointer. I’ll take a 50X speedup any day:

>>> timeof(BKTree, levenshtein, w)
time:  147.626706839
>>> timeof(BKTree, clevenshtein, w)
time:  2.95655703545
>>>
]]> By: ginstrom http://hupp.org/adam/weblog/2007/10/28/burkhard-keller-bk-trees-in-python/#comment-68 ginstrom Mon, 29 Oct 2007 14:48:17 +0000 http://hupp.org/adam/weblog/2007/10/28/burkhard-keller-bk-trees-in-python/#comment-68 <p>Interesting article! I don't have your data so I can't compare, but I'm sure that if you used the Levenshtein C extension module here: http://trific.ath.cx/resources/python/levenshtein/ your tree-building time would be much shorter.</p> Interesting article! I don’t have your data so I can’t compare, but I’m sure that if you used the Levenshtein C extension module here:
http://trific.ath.cx/resources/python/levenshtein/
your tree-building time would be much shorter.

]]>