Now because each word excluding the root must be pushed to the stack once and popped off once during the parsing process, the number of actions Inputs: training examples (x i , y i ) Initialization: set w = 0 Algorithm: // R training iterations; N examples for t = 1..R, i = 1..N :   needed to parse a sentence is always 2n − 1, where n is the length of the sentence.
the decoder has linear time complexity, given a fixed beam size.