... Linguistics Getting the Most out of Transition-based Dependency ParsingJinho D. ChoiDepartment of Computer ScienceUniversity of Colorado at Boulderchoijd@colorado.eduMartha PalmerDepartment of LinguisticsUniversity ... of the 49th Annual Meeting of the Association for Computational Linguistics:shortpapers, pages 687–692,Portland, Oregon, June 19-24, 2011.c2011 Association for Computational Linguistics Getting ... worst-case complexity of O(n),which is faster than any non-projective parsing al-gorithm. Since the number of non-projective depen-dencies is much smaller than the number of projec-tive dependencies...