[PDF] Top 20 Syntactic Tree based Relation Extraction Using a Generalization of Collins and Duffy Convolution Tree Kernel

... every relation type separately, and type compatible annotated and constructed relation instances are used to train ...each relation type, only type compatible relation instances are exploited ... See full document

... & Tree Kernels In this section, we first give the intuition that guides us in designing the proposed ...the syntactic seman- tic tree kernel presented in Plank and Moschitti (2013) ...the ... See full document

... a convolution tree kernel-based approach for relation extraction where the parse tree is expanded with entity features such as entity type, subtype, and mention level ... See full document

... composite kernel, we incorporate the EST into the DSPT to pro- duce a Unified Parse and Semantic Tree (UPST) to investigate the contribution of the EST to rela- tion ...and Duffy, 2001) to compute ... See full document

... a tree kernel with context- sensitive structured parse tree information for re- lation ...previous tree kernels for relation extraction in two ...context-sensitive tree ... See full document

... A convolution kernel (Haussler ...specialized convolution kernel, the convolution tree kernel, proposed in Collins and Duffy (2001), counts the number of ... See full document

... integrate syntactic structures in machine learning algorithms is the use of tree ker- nel (TK) functions (Collins and Duffy, 2002), which have been successfully applied to question classifi- ... See full document

... of kernel-based machine learning method that can implicitly ex- plore (structured) features in a high dimensional feature space (Vapnik, 1995), in this paper we propose using convolution ... See full document

... proposed syntactic tree kernels enriched by lexical semantic similarity to tackle the portabil- ity of a relation extractor to different ...lexical generalization is very promising for domain ... See full document

... a generalization of the feature-based methods by replacing the dot-product with a kernel func- tion between two vectors, or even between two ...A kernel function is a similarity function ... See full document

... Relation Extraction (RE) aims to identify a set of predefined relations between pairs of entities in ...years, relation extraction has re- ceived considerable research ...the tree ... See full document

... Many kernel functions have been proposed in machine learning community and have been ap- plied to NLP ...of convolution kernels, more and more kernels for restricted syntaxes or specific do- mains, such as ... See full document

... Recently kernel-based methods have become a state-of-art technique and been widely used in natural language processing ...proper kernel function in terms of dif- ferent data ...hand, kernel ... See full document

... parse tree should contrib- ute much more to performance improvement for relation ...tured syntactic features contributes less to per- formance ...the syntactic structure information in a parse ... See full document

... Second, SK is 2.56 percent points below the state- of-the-art achieved in (Brown et al., 2011) (BR), i.e, 82.08 vs. 84.64. In contrast, STK applied to our rep- resentation (CT, GRCT and LCT) produces compa- rable ... See full document

... explicit syntactic features of- ten outperformed tree kernels in accuracy, and even where they did not, the cost was multiple orders of magnitude increase in both training and testing ... See full document

... determination using the tree kernel on DET Finally, we evaluate the effect of LP-based anaphoricity determination on coreference reso- lution by including it as a preprocessing step to a ... See full document

... similar syntactic structure. For example in the MSRvid dataset, a sentence pair is given by The man are playing soccer and A man is riding a mo- torcycle, that are strictly syntactically correlated. As a side ... See full document

... new tree kernel for node relation labeling, as which SRL can be ...This kernel is defined on marked ordered la- beled trees, where a node can have a mark to indicate the existence of a ...this ... See full document

... the relation tag ‘R’ and the entity tags ‘NE’ are the terminal nodes attached to their re- spective POS ...dependency tree for our example sentence. Our lexicalized tree representation is derived ... See full document