Each state is represented by c = (s, b, A) where s, b, and A denote the stack, buffer and set of dependency relations derived so far.
our objective is to predict a transition operation given the configuration set c. The initial configuration is defined as s , and A = ∅ where n is the number of tokens in the sentence w 1 w 2 • • • w n .