However, finding the top-k nearest nodes to each node requires considering its similarity to all the other nodes which requires O(n 2 ) computations and since n is usually very large, doing such is practically intractable.
we wordaligned the dev/test sets by concatenating them to a large parallel corpus and running GIZA++ on the whole set.