... [i|λ2], [j|β], E )default transition Table 1: Transitions in our algorithm. For each row, the first line shows a transition and the second line showspreconditions of the transition. 2 Reducing search ... algorithm (Nivre, 2008). The main difference between these two approaches is intheir implementation of the SHIFT transition. Choi-Nicolov’s approach divides the SHIFT transition intotwo, deterministic ... indices of their corresponding wordtokens. The initial state is ([0], [ ], [1,. . . ,n], ∅). The 0 identifier corresponds to an initial token, w0, intro-duced as the root of the sentence. The...