In other words, we can build a corpus that considers most cases of additional information.
we design the following simple heuristic: let F i and F j be the largest not aligned (possibly discontinuous) word sequences appearing in the sentence pair (S i , S j ), where F i ∈ S i and F j ∈ S j .