In this case, to produce a constituent tree from the spinal forest, we promote the last tree and place the rest of trees as children of its top node.
in this section we describe the performance of the transition-based spinal parser by running it with different sizes of the beam and by comparing it 2 this is not always the case.