More specifically, we use the formulaic similarity between He and Eu: He(p, q) ≡ Eu(x, y), when ∀i : i = 1, n of x i and y i , x i = √ p i and y i = √ q i , and compute He distance using Eu based, approximate NN computation approaches such as k-d trees 1 (Bentley, 1975).
the primary experimental comparison that we perform is between no bitext at all and a system trained with some bitext.