The graph G D (s) contains a (directed) edge from a node w 1 , w 1 to a node w 2 , w 2 if w 2 immediately follows w 1 in q ; in other words, G D (s) has an edge from w 1 , w 1 to w 2 , w 2 whenever there exist indices i, j and k, such that w 1 = s [i,j) and w 2 = s [j,k) .
we were not able to do so with Google, as we used remote access via its Java API (Google, 2010); hence, the Google tool is un-aware of our domain, but is rather based on its own statistics (from the World Wide Web).