Abstract

We present and implement a fourth-order projective dependency parsing algorithm that effectively utilizes both “grand-sibling” style and “tri-sibling” style interactions of third-order and “grand-tri-sibling” style interactions of forth-order factored parts for performance enhancement. This algorithm requires O (n5) time and O (n4) space. We implement and evaluate the parser on two languages—English and Chinese, both achieving state-of-the-art accuracy. This results show that a higher-order (≥ 4) dependency parser gives performance improvement over all previous lower-order parsers.

Date

2012

Authors

Xuezhe Ma, Hai Zhao

Conference

Proceedings of the 24th International Conference on Computational Linguistics (COLING 2012)

Pages

785-796

Publisher

The COLING 2012 Organizing Committee