However, Kneser-Ney smoothing (Kneser and Ney, 1995) conditions lower-order probabilities on backing off.
lower-order counts are adjusted to represent the number of unique extensions an n-gram has: where c(w n 1 ) is the number of times w n 1 appears in the training data 3 .