First, we crawled G e = (V e , E e ) and G c = (V c , E c ) from English and Chinese EntityCubes.
we built a graph pairs (G e , G c ) expanding from a "seed pair" of nodes s e ∈ V e and s c ∈ V c until the number of nodes for each graph becomes 1,000 6 .