We noticed that if constant relevance values are used, the top ranked queries will consist of a rather small set of top ranked n-grams that are paired with each other in all possible combinations.
it is likely that each time an n-gram is used in a query, the need for finding more occurrences of this particular n-gram decreases.