Top all-time · #25135
Xenopax's Blog
Personal blog · nullwords.wordpress.comprogrammingdata
Xenopax's Blog is a personal blog at nullwords.wordpress.com about programming and data. Since 2013, 3 different Hacker News readers have linked it 3 times, most often “The BK-Tree – A Data Structure for Spell Checking”. The last post was in 2013, but the archive is still widely read.
Too few sampled comments (1) to say how often HN recommends it.?
Why HN links it
Linked as a post on fast fuzzy string matching with Levenshtein distance using a trie. One commenter points to the blog's BK-tree post as a related approach, so the blog covers string-matching data structures.
Summarised by Claude from a sample of 1 HN comments that link here. Each comment is marked recommending, critical or neutral (citing without judging); how this works.
Routing words to /dev/null
Most-linked posts?
- The BK-Tree – A Data Structure for Spell Checking2 people · 2 mentions · first linked 2013-03-14
What Hacker News says?
Either it's not that well known or I'm missing the point, but the BK Tree [1] seems relevant here. Haven't seem it mentioned yet. [1]: http://nullwords.wordpress.com/2013/03/13/the-bk-tree-a-data...
Comment linking /2013/03/13/the-bk-tree-a-data-structure-for-spell-checking/
on “Fast and easy Levenshtein distance using a trie (2011)”Submitted The BK-Tree – A Data Structure for Spell Checking as a story · 2 points
HN discussionSubmitted The Bloom Filter as a story · 1 points
HN discussion