Querying each of these arrays for each n-gram requested would be inefficient and inflate the error rate since a false positive could occur on each individual array.
backoff smoothing algorithms typically request the longest n-gram supported by the model first, requesting shorter n-grams only if this is not found.