Applying Tree Kernel to Chinese Syntactic Parsing Reranking

摘要：

Chinese Syntactic Parsing is often divided into two stages, basic model to generate k-best candidate parsing trees and reranking stage to find the best one in these trees, and we focus on the second stage-reranking. Tree kernel has been used in Syntactic parsing in English(Collins 2002) which makes a good improvement in performance. This paper makes tree kernel method practical for Chinese Syntactic Parsing, and improves tree kernel from three points: the first is introducing rules weights rw to distinct different rules, the second is introducing similar rules converging, and the third is introducing a parameter λ to scale the relative importance of tree fragments with their size and solve the peak problem which is a common kernel. Experiments show that these three adjustments to tree kernel increase reranking performance a lot.

关键词： Tracking Chinese Syntactic Parsing Reranking Tree Kernel

作者: Xiaodong ZHENG Liang CHEN Baobao CHANG

作者单位: Institute of Computational Linguistics, Peking University, Beijing 100871, China

会议类型: 国际会议

会议名称: International Conference on Natural Language Processing and Knowledge Engineering(IEEE自然语言处理与知识工程国际会议 IEEE NLP-KE 2009)

会议地点: 大连

会议语种:英文

页码: 1-6

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