1. Transition Mechanisms (60 points)
(a) (10 pts) Given a sentence "I parsed this sentence correctly" with the transitions, complete the following
table. The first three steps are provided in the table, showing the configuration of the stack and buffer,
as well as the transition and the new dependency (if has) for the following steps.
ROOT
parsed this
sentence correctly
Stack
Buffer
New dependency Transition
[ROOT]
[I, parsed, this, sentence, correctly]
Initial Configuration
[ROOT, I]
[parsed, this, sentence, correctly]
SHIFT
[ROOT, I, parsed]
[this, sentence, correctly]
SHIFT
[ROOT, parsed]
[this, sentence, correctly]
parsed
I
LEFT-ARC
(b) (10 pts) A sentence containing n words will be parsed in how many steps (in terms of n)? Briefly
explain in 1-2 sentences why.
(c) (20 pts) Implement the transition mechanisms, SHIFT, LEFT-ARC, and RIGHT-ARC.
(d) (20 pts) Implement Minibatch Dependency Parsing based on the following algorithm.
Algorithm Minibatch Dependency Parsing
Input: sentences, a list of sentences to be parsed and model, our model that makes parse decisions