{"id":41,"date":"2002-03-12T14:13:00","date_gmt":"2002-03-12T22:13:00","guid":{"rendered":"http:\/\/www.netjeff.com\/wp\/?p=41"},"modified":"2007-12-30T22:13:50","modified_gmt":"2007-12-31T06:13:50","slug":"googlewhacking","status":"publish","type":"post","link":"https:\/\/www.netjeff.com\/wp\/?p=41","title":{"rendered":"Googlewhacking"},"content":{"rendered":"<p>As reported in various media (CNet, Wired, etc) there is a new sport called &#8220;googlewhacking&#8221; where you try to use Google to find <strong>exactly one<\/strong> web page that has a pair of words.  If more than one page matches, or no pages matches, the pair of words does not count.<\/p>\n<p>For some examples, see <a href=\"http:\/\/www.googlewhack.com\/tally.pl\">http:\/\/www.googlewhack.com\/tally.pl<\/a><\/p>\n<p><wbr><\/wbr>Of course, once you post your googlewhack on a web page that google can find, it will no longer be a googlewhack; google will find two hits, the &#8220;original&#8221; and your page with the results of your search.<\/p>\n<p>Hmm, now that I think about it, you can also cheat if you&#8217;re patient enough. If you find a pair of words that get zero hits. Create a web page (maybe an anonymous slashdot post) that contains the pair of words, wait for google to find it, then you &#8220;win&#8221;. But I&#8217;m sure that any judges would get suspicious if they could trace the page back to you, or if the page did not use words in a &#8220;reasonable&#8221; way.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>As reported in various media (CNet, Wired, etc) there is a new sport called &#8220;googlewhacking&#8221; where you try to use Google to find exactly one web page that has a pair of words. If more than one page matches, or&#8230; <a href=\"https:\/\/www.netjeff.com\/wp\/?p=41\" class=\"readmore\">Read more<span class=\"screen-reader-text\">Googlewhacking<\/span><span class=\"fa fa-angle-double-right\" aria-hidden=\"true\"><\/span><\/a><\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[5],"tags":[],"class_list":["post-41","post","type-post","status-publish","format-standard","hentry","category-tech","content-layout-full"],"_links":{"self":[{"href":"https:\/\/www.netjeff.com\/wp\/index.php?rest_route=\/wp\/v2\/posts\/41","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.netjeff.com\/wp\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.netjeff.com\/wp\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.netjeff.com\/wp\/index.php?rest_route=\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/www.netjeff.com\/wp\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=41"}],"version-history":[{"count":0,"href":"https:\/\/www.netjeff.com\/wp\/index.php?rest_route=\/wp\/v2\/posts\/41\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.netjeff.com\/wp\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=41"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.netjeff.com\/wp\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=41"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.netjeff.com\/wp\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=41"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}