Entity

Time filter

Source Type


Kong F.,Soochow University of China | Kong F.,Key Laboratory of Computer Information Processing Technology of Jiangsu Province | Zhou G.-D.,Soochow University of China | Zhou G.-D.,Key Laboratory of Computer Information Processing Technology of Jiangsu Province
Ruan Jian Xue Bao/Journal of Software | Year: 2012

This paper proposes a tree kernel method to anaphora resolution of pronouns in both English and Chinese. First, several basic structured tree spans are proposed according to linguistic intuition. The similarity between two structured objects is computed directly using SVMLight. Then, a dynamic-expansion scheme is proposed to automatically determine a proper tree span for pronoun resolution by the centering theory, antecedent competitor-related information, and semantic role-related information. Evaluation on both the ACE 2004 English NWIRE corpus and the ACE 2005 Chinese NWIRE corpus justified the effectiveness of this method. © 2012 ISCAS. Source


Kong F.,Soochow University of China | Kong F.,Key Laboratory of Computer Information Processing Technology of Jiangsu Province | Zhu Q.,Soochow University of China | Zhu Q.,Key Laboratory of Computer Information Processing Technology of Jiangsu Province | And 2 more authors.
Jisuanji Yanjiu yu Fazhan/Computer Research and Development | Year: 2012

This paper systematically explores noun phrase anaphoricity determination for coreference resolution in both English and Chinese languages in various ways. Firstly, a rule-based method is used to detect the non-anaphors which are insensitive to the context or have some obvious patterns. Then, both flat feature-based and structured tree kernel-based methods are used to determinate the non-anaphors sensitive to the context. Finally, a composite kernel is proposed to combine the flat features with structured ones to further improve the performance. Experimental results on both the ACE 2003 English corpus and the ACE 2005 Chinese corpus show that all the proposed methods perform well on anaphoricity determination. In addition, the anaphoricity determination module is applied to coreference resolution systematically. Experimental also results show that proper anaphoricity determination can significantly improve the performance of coreference resolution in both English and Chinese languages. Source


Chen Z.,Soochow University of China | Chen Z.,Key Laboratory of Computer Information Processing Technology of Jiangsu Province | Zou B.,Soochow University of China | Zou B.,Key Laboratory of Computer Information Processing Technology of Jiangsu Province | And 4 more authors.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2013

Negative and uncertain expressions widely exist in natural language. Negation and uncertainty identification has become an important task in computational linguistics community. Lacking of corpus hinders the development of Chinese negation and uncertainty identification. This paper reports on a corpus annotation project for Chinese negation and uncertainty identification on scientific literature. We introduce several important aspects during our annotation, such as selection of raw text, framework of annotation, guidelines, data consistency and statistic data summarized from corpus. In this corpus, we annotate negation and uncertainty cues and their corresponding scopes. Statistic for corpus shows that there are a certain proportion of negative and uncertain expressions in Chinese scientific literature. Accordingly, this corpus is able to support the research of Chinese negation and uncertainty identification in the future. © 2013 Springer-Verlag. Source


Qin K.,Soochow University of China | Qin K.,Key Laboratory of Computer Information Processing Technology of Jiangsu Province | Kong F.,Soochow University of China | Kong F.,Key Laboratory of Computer Information Processing Technology of Jiangsu Province | And 4 more authors.
Advances in Intelligent and Soft Computing | Year: 2011

A rule-based approach for Chinese zero anaphor detection is proposed. Given a parse tree, the smallest IP sub-tree covering the current predicate is captured. Based on this IP sub-tree, some rules are proposed for detecting whether a Chinese zero anaphor exists. This paper also systematically evaluates the rule-based method on OntoNotes corpus. 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. © 2011 Springer-Verlag Berlin Heidelberg. Source

Discover hidden collaborations