Higher number of bits are needed to encode these improbable n-grams which results in increased perplexity.
the upper bound UB on the score of Q is Let Q * be the question in C having the maximum score.