Dependency Chart Parsing Algorithm Based on Ternary-Span Combination

Meixun JIN, Yong-Hun LEE, Jong-Hyeok LEE
2013 IEICE transactions on information and systems  
This paper presents a new span-based dependency chart parsing algorithm that models the relations between the left and right dependents of a head. Such relations cannot be modeled in existing spanbased algorithms, despite their popularity in dependency corpora. We address this problem through ternary-span combination during the subtree derivation. By modeling the relations between the left and right dependents of a head, our proposed algorithm provides a better capability of coordination
more » ... guation when the conjunction is annotated as the head of the left and right conjuncts. This eventually leads to state-of-the-art performance of dependency parsing on the Chinese data of the CoNLL shared task. key words: dependency chart parsing, span-based parsing, factor-based parsing, dependency parsing algorithm, averaged perceptron, syntactic analysis * We say a word dominates a string, if it is possible for the word to reach any other words in the string by following the paths of dependency arcs.
doi:10.1587/transinf.e96.d.93 fatcat:fur4nuvsw5aqzj2indccggnhji