Transition-based Chinese Semantic Dependency Graph Parsing

摘要：

　　Chinese semantic dependency graph is extended from semantic dependency tree,which uses directed acyclic graphs to capture richer latent semantics of sentences.In this paper,we propose two approaches for Chinese semantic dependency graph parsing.In the first approach,we build a non-projective transition-based dependency parser with the Swap-based algorithm.Then we use a classifier to add arc candidates generated by rules to the tree,forming a graph.In the second approach,we build a transition-based graph parser directly using a variant of the list-based transition system.For both approaches,neural networks are adopted to represent the parsing states.Both approaches yield significantly better results than the top systems in the SemEval-2016 Task 9: Chinese Semantic Dependency Parsing.

作者: Yuxuan Wang Jiang Guo Wanxiang Che Ting Liu

作者单位: School of Computer Science and Technology Harbin Institute of Technology,Harbin,China,150001

会议类型: 国内会议

会议名称: 第十五届全国计算语言学学术会议(CCL2016)暨第四届基于自然标注大数据的自然语言处理国际学术研讨会(NLP-NABD-2016)

会议地点: 烟台

会议语种:英文

页码: 1-12

在线出版日期: 2016-10-14（万方平台首次上网日期，不代表论文的发表时间）