This paper presents and implements an approach to parallel ACO algorithms. The principal idea is to make multiple ant colonies share and utilize only one pheromone matrix. We call it SHOP (SHaring One Pheromone matrix...
详细信息
Knowledge of noun phrase anaphoricity might be profitably exploited in coreference resolution to bypass the resolution of non-anaphoric noun phrases. However, it is surprising to notice that recent attempts to incorpo...
详细信息
This paper presents a topic-driven framework for generating a generic summary from multi-documents. Our approach is based on the intuition that, from the statistical point of view, the summary's probability distri...
详细信息
In this paper, we employ the centering theory in pronoun resolution from the semantic perspective. First, diverse semantic role features with regard to different predicates in a sentence are explored. Moreover, given ...
详细信息
作者：
Tang, YuanYou, RonghuiSchool of Computer Science
School of Software Fudan University Shanghai Key Lab. of Intelligent Information Processing State Key Lab. of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences China
It's important to hit a space-time balance for a real-world algorithm to achieve high performance on modern shared-memory multi-core or many-core systems. However, a large class of dynamic programs with more than ...
详细信息
Recent kernel-based PPI extraction systems achieve promising performance because of their capability to capture structural syntactic information, but at the expense of computational complexity. This paper incorporates...
详细信息
Recent kernel-based PPI extraction systems achieve promising performance because of their capability to capture structural syntactic information, but at the expense of computational complexity. This paper incorporates dependency information as well as other lexical and syntactic knowledge in a feature-based framework. Our motivation is that, considering the large amount of biomedical literature being archived daily, feature-based methods with comparable performance are more suitable for practical applications. Additionally, we explore the difference of lexical characteristics between biomedical and newswire domains. Experimental evaluation on the AIMed corpus shows that our system achieves comparable performance of 54.7 in F1-Score with other state-of-the-art PPI extraction systems, yet the best performance among all the feature-based ones.
This paper proposes a dependency-driven scheme to dynamically determine the syntactic parse tree structure for tree kernel- based anaphoricity determination in coreference resolution. Given a full syntactic parse tree...
详细信息
This paper proposes a dependency-driven scheme to dynamically determine the syntactic parse tree structure for tree kernel- based anaphoricity determination in coreference resolution. Given a full syntactic parse tree, it keeps the nodes and the paths related with current mention based on constituent dependencies from both syntactic and semantic perspectives, while removing the noisy information, eventually leading to a dependency-driven dynamic syntactic parse tree (D-DSPT). Evaluation on the ACE 2003 corpus shows that the D-DSPT outperforms all previous parse tree structures on anaphoricity determination, and that applying our anaphoricity determination module in coreference resolution achieves the so far best performance.
Event anaphora resolution plays an important role in discourse analysis. In comparison with general noun phrases, pronouns carry little information of themselves, resolving the event pronouns is a more difficult task....
详细信息
Coreference resolution is an important subtask in natural language processing systems. The process of it is to find whether two expressions in natural language refer to the same entity in the world. Machine learning a...
详细信息
This paper proposes a new approach to dynamically determine the tree span for tree kernel-based semantic relation extraction. It exploits constituent dependencies to keep the nodes and their head children along the pa...
详细信息
暂无评论