Among these, we have highlighted novel algorithms that (1) increase non-projective coverage without affecting computational complexity for exact inference, and (2) improve the time and space complexity for exact inference, even while providing better coverage than the original parser.
our ALLs 0 s 1 runs in Opn 6 q time and Opn 4 q space (improving from Opn 7 q and Opn 5 q, respectively) while providing coverage of 93.16% of the non-projective sentences in UD 2.1.