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

[hiratara]

思ったより簡単なんだなあ。「> … approach, which makes it possible to do fuzzy text search in a regular index: Levenshtein automata.」

[fcicq]

approximate search. see also http://blog.notdot.net/tag/damn-cool-algorithms

[agw]

ノードがとても立体的に見える。

[suu-g]

あとでよめばいいんじゃない