... aswell as the tags of their left- and rightmost chil-dren, plus the root tag of the third tree s2, and fi-nally the word and tag of the queue head q0 and the1079state form ℓ : i, j, sd ... identical (proof omitted).Figure 3 shows the new deductive system with dynamic programming and GSS. A new state hasthe formℓ : i, j, sd s0where [i j] is the span of the top tree s0, and sd ... areoften caused by previous ones, and are irrelevantwhen the parser is on the wrong track. Dynamic programming turns out to be a great fit for earlyupdating (see Section 4.3 for details).3 Dynamic...