During parsing, the most frequent graph H for the given token is then chosen.
a(i) approximates ← − π (i) by means of the graph most frequently seen among all occurrences of token x i in the training set.