Minimally Supervised Novel Relation Extraction Using a Latent Relational Mapping

2013 ◽  
Vol 25 (2) ◽  
pp. 419-432 ◽  
Author(s):  
D. Bollegala ◽  
Y. Matsuo ◽  
M. Ishizuka
2011 ◽  
Vol 18 (1) ◽  
pp. 21-59 ◽  
Author(s):  
B. HACHEY ◽  
C. GROVER ◽  
R. TOBIN

AbstractA vast amount of usable electronic data is in the form of unstructured text. The relation extraction task aims to identify useful information in text (e.g. PersonW works for OrganisationX, GeneY encodes ProteinZ) and recode it in a format such as a relational database or RDF triplestore that can be more effectively used for querying and automated reasoning. A number of resources have been developed for training and evaluating automatic systems for relation extraction in different domains. However, comparative evaluation is impeded by the fact that these corpora use different markup formats and notions of what constitutes a relation. We describe the preparation of corpora for comparative evaluation of relation extraction across domains based on the publicly available ACE 2004, ACE 2005 and BioInfer data sets. We present a common document type using token standoff and including detailed linguistic markup, while maintaining all information in the original annotation. The subsequent reannotation process normalises the two data sets so that they comply with a notion of relation that is intuitive, simple and informed by the semantic web. For the ACE data, we describe an automatic process that automatically converts many relations involving nested, nominal entity mentions to relations involving non-nested, named or pronominal entity mentions. For example, the first entity is mapped from ‘one’ to ‘Amidu Berry’ in the membership relation described in ‘Amidu Berry, one half of PBS’. Moreover, we describe a comparably reannotated version of the BioInfer corpus that flattens nested relations, maps part-whole to part-part relations and maps n-ary to binary relations. Finally, we summarise experiments that compare approaches to generic relation extraction, a knowledge discovery task that uses minimally supervised techniques to achieve maximally portable extractors. These experiments illustrate the utility of the corpora.1


Author(s):  
Prachi Jain ◽  
Shikhar Murty ◽  
Mausam . ◽  
Soumen Chakrabarti

This paper analyzes the varied performance of Matrix Factorization (MF) on the related tasks of relation extraction and knowledge-base completion, which have been unified recently into a single framework of knowledge-base inference (KBI) [Toutanova et al., 2015]. We first propose a new evaluation protocol that makes comparisons between MF and Tensor Factorization (TF) models fair. We find that this results in a steep drop in MF performance. Our analysis attributes this to the high out-of-vocabulary (OOV) rate of entity pairs in test folds of commonly-used datasets. To alleviate this issue, we propose three extensions to MF. Our best model is a TF-augmented MF model. This hybrid model is robust and obtains strong results across various KBI datasets.


2014 ◽  
Author(s):  
Miao Fan ◽  
Deli Zhao ◽  
Qiang Zhou ◽  
Zhiyuan Liu ◽  
Thomas Fang Zheng ◽  
...  

2009 ◽  
Vol 19 (11) ◽  
pp. 2843-2852 ◽  
Author(s):  
Jin-Xiu CHEN ◽  
Dong-Hong JI
Keyword(s):  

2012 ◽  
Vol 23 (10) ◽  
pp. 2572-2585 ◽  
Author(s):  
Yu CHEN ◽  
De-Quan ZHENG ◽  
Tie-Jun ZHAO
Keyword(s):  

2010 ◽  
Vol 18 (2) ◽  
pp. 414-429 ◽  
Author(s):  
Kristin Andersson ◽  
Johan Richardsson ◽  
Bengt Lennartson ◽  
Martin Fabian

Sign in / Sign up

Export Citation Format

Share Document