Instead, it can generate the same tree in different orders depending on the criterion used to choose a transition at each configuration.
the parser by Goldberg and Elhadad (2010) can be seen as an implementation of this transition system, which uses a training algorithm that assigns a weight to each of the ATTACH-RIGHT(i) EF and ATTACH-LEFT(i) EF transitions in such a way that "easier" (more reliable) attachments are performed first.