%0 Journal Article
%T Rule-based Identification of Chinese zero Anaphora
基于规则的中文零指代项识别研究
%A QIN Kai-wei
%A KONG Fang
%A LI Pei-feng
%A ZHU Qiao-ming
%A
秦凯伟
%A 孔芳
%A 李培峰
%A 朱巧明
%J 计算机科学
%D 2012
%I
%X A rule-based approach for Chinese zero anaphor detection was proposed. Given a parse tree, the smallest IP sub-tree covering the current predicate was captured. Based on this IP sub-tree, some rules were proposed for detecting whether a Chinese zero anaphor exists. I}his paper also systematically evaluated the rulcbased method on OntoNotescorpus. Using golden parse tree, our method achieves 82. 45 in F-measure. And the F-measure is 63. 84 using automatic parser. The experiment results show that our method is very effective on Chinese zero anaphor detection.
%K Natural language processing
%K Chinese zero anaphora
%K Parsing tree
%K Rulcbased
%K Ontonotc3
%K 0
自然语言处理
%K 中文零指代
%K 句法分析树
%K 基于规则
%K Ontonotes3.0
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=A97816070393C02678B10AFFBB7A1E50&yid=99E9153A83D4CB11&vid=7C3A4C1EE6A45749&iid=F3090AE9B60B7ED1&sid=B4E8EA49DAAEB84F&eid=C1B34927D429E92F&journal_id=1002-137X&journal_name=计算机科学&referenced_num=0&reference_num=0