For multiword queries, the system performs a consistency check on possible combinations of words from different translation classes.
it computes the Cartesian product for pairs of translation classes T 1 and T 2 to generate the set P of word pairs, where each word (w 1 and w 2 ) comes from a different translation class: Then the system checks whether each word pair from the set P exists in the database D of discontinuous content word bi-grams which actually cooccur in the TL corpus: The database contains the set of all bi-grams that occur in the corpus with a frequency ≥ 4 within a window of 5 words (over 9M bigrams for each language).