Transition-based dependency parsing with long distance collocations

2Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Long distance dependency relation is one of the main challenges for the state-of-the-art transition-based dependency parsing algorithms. In this paper, we propose a method to improve the performance of transition-based parsing with long distance collocations. With these long distance collocations, our method provides an approximate global view of the entire sentence, which is a little bit similar to top-down parsing. To further improve the accuracy of decision, we extend the set of parsing actions with two more fine-grained actions based on the types of arcs. Experimental results show that our method improve the performance of parsing effectively, especially for long sentence.

Cite

CITATION STYLE

APA

Zhu, C., Qiu, X., & Huang, X. (2015). Transition-based dependency parsing with long distance collocations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9362, pp. 12–24). Springer Verlag. https://doi.org/10.1007/978-3-319-25207-0_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free