Some 15 years ago someone (sorry I forgot who) in Waterloo university published a paper about how to use a search engine to discover hidden relations.<p>It was something like this:<p>1. Search for the key word "A"<p>2. Find new keywords (b,c,..) that are associated with "A" (I did this with lingpipe [0]<p>3. Search each the new keywords (b,c, ...)<p>4. Find for each of them their associated keywords (finding (s, t, ...)<p>5. Repeat 3.<p>6. repeat 4. finding (z, x, ...)<p>7. If in (z, x, ...) one of them is associated with "A" then you discovered an hidden relation between "A" and one of the members of (s, t, ...) (hidden if it did not appear in the initial search).<p>[0] <a href="http://www.alias-i.com/lingpipe/" rel="nofollow">http://www.alias-i.com/lingpipe/</a>