However, our phrase fusion method is clever in that it probes reordering only on selected pairs of words, where reordering is likely to be useful.
our approach naturally ignores most word pairs that do not require reordering and has a time complexity of only O(K 2 n), where K is the maximum number of candidate phrases of any phrase type, and n is the number of phrase types in each sentence.