Based on the assumption that querying a (pre-indexed) document collection is relatively simple, we generate a range of queries of decreasing length and increasing likelihood of term co-occurrence in standard documents, and query until a non-empty set of results is returned.
the modified support formulation is as follows: is a Boolean function which evaluates to true iff w i and w j co-occur in document d. we reject any combinations of words which are found to co-occur in Wikipedia documents for that language.