Therefore we approximate H with a graph H that only contains nodes "near" to the node representing the query phrase.
we perform breadthfirst search starting from the query node up to a depth d, or until the number of nodes visited in the search has reached a maximum of n nodes.