It is quite reasonable to say, the larger n is, the closer the n-gram model is to naturalness.
the conjecture is affirmatively substantiated within the scope of our computational studies, if we find at least one network parameter whose values for the n-gram models show a strictly monotonous convergence behavior towards the value for natural language, and this behavior is consistent throughout all languages.