Dependency Chart Parsing Algorithm Based on Ternary-Span Combination
SCIE
SCOPUS
- Title
- Dependency Chart Parsing Algorithm Based on Ternary-Span Combination
- Authors
- Jin, M; Lee, YH; Lee, JH
- Date Issued
- 2013-01
- Publisher
- IEICE
- Abstract
- 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 span-based 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 disambiguation 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.
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/10401
- DOI
- 10.1587/TRANSINF.E96.D.93
- ISSN
- 1745-1361
- Article Type
- Article
- Citation
- IEICE Transactions on Information and Systems, vol. E96-D, no. 1, page. 93 - 101, 2013-01
- Files in This Item:
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.