Computational studies consistently demonstrate that addressing syntactic discontinuity and nonprojectivity is essential for accurate and efficient dependency parsing.
The retrieved papers ([0], [1], [2], [3], [7], [9], [10]) specifically focus on developing and evaluating parsing algorithms for non-projective and discontinuous structures, showing that handling nonprojectivity is important for improving both accuracy and efficiency in computational parsing. There are no papers refuting this claim.