|July 20th, 2012|
|algorithms, tech [html]|
for each comment A: for each later comment B: for each word X in A: for each word Y in B: do A and B match for N words starting at X and Y?This is psuedocode for an
Update 2012-07-21: Several commenters suggested a better
algorithm: to find all quotes of length N, build a dictionary from all
sequences of N words to a list of comments in which they appeared.
O(n*m) and running it it's much faster. I tested it
in IE8, and it loaded
quickly instead of freezing the
browser. I thought briefly about doing something like this
earlier, but wrote it off as using insane amounts of memory. After
more people suggested it, I realized it only uses N times as much
memory as just storing the comments.