The general tree-growing algorithm has no notion of the letter distance, but instead chooses the letters on the ba-sis of their estimated information gain (Manning and Schütze, 1999).
it will sometimes query a letter at position +3 (denoted l 3 ), for example, before examining the letters that are closer to the center of the context window.