Damn Cool Algorithms: Levenshtein Automata - Nick's Blog
Posted by Nick Johnson | Filed under python, tech, coding, damn-cool-algorithms In a previous Damn Cool Algorithms post, I talked about BK-trees, a clever indexing structure that makes it possible to search for fuzzy matches on a text string based on Levenshtein distance - or any other metric that obeys the triangle inequality. Today, I'm going to describe an alternative approach, which makes it p
A Guide to Analyzing Python Performance
Introduction Coarse grain timing with time Fine grain timing with a timing context manager Line-by-line timing and execution frequency with a profiler How much memory does it use? IPython shortcuts for line_profiler and memory_profiler Where’s the memory leak? Which objects are the most common? Which objects have been added or deleted? What is referencing this leaky object? Effort vs precision Ref
What the heck is an xrange? « late.am
by Dan Crosta Pop quiz: how would you implement Python's xrange (known in Python 3.x as range) in Python and without making a list or any other sequence type? If you answered "with a generator," you'd be wrong! And it's likely because you've only ever used an xrange in code like: In this case (where the xrange is only used as an "argument" to a for loop), a generator would probably suffice. But, i
1
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
処理を実行中です
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
Dropbox Tech Blog
