∆T N (e E , e C )= ∑ where B * is a subset of B ⊂ S i E ×S j C such that the connected statements mention e E and e C , and B is the greedy approximate solution of maximum bipartite matching for the set S i E of statements of d i E and the set S j C of statements of d j C .
b * is a set of matching statement pairs mentioning the translation target e E and e C in the document pair.