Such an approach is only tractable for small bilingual parallel corpora that would result in a small H, but not for large corpora containing millions of sentences, such as those described in Section 4.1.
we approximate H with a graph H that only contains nodes "near" to the node representing the query phrase.