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).
the example in the pool that maximizes the disagreement among the predictions of the committee members is selected.