For each language, we decided to use the most constrained combination of bounded block degree constraints and well-nestedness which covers over 99% of the data.
transition-based algorithms offer low space and time complexity, typically linear in the length of sentences usually by relying on local predictors and beam strategies and thus do not provide any optimality guarantee on the produced structures.