I don't see why this would be much better than simply doing fuzzy match on a tri... | Hacker News

Hacker News .hnnew | past | comments | ask | show | jobs | submit

		enonko on Oct 20, 2007 \| parent \| context \| favorite \| on: Damn Cool Algorithms: BK-Trees I don't see why this would be much better than simply doing fuzzy match on a trie.

aswanson on Oct 20, 2007 [–]

How do you do a fuzzy match? Are there any sites out there that deal with all the text matching algorithms? I need to do this for a project.

aston on Oct 21, 2007 | [–]

No websites, probably, but lots of papers. A good start might be http://courses.csail.mit.edu/6.851/spring07/lec.html (lectures 8 and 9 or so).

aswanson on Oct 21, 2007 | | [–]

Thanks.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact