Context-Aware Representations for Knowledge Base Relation Extraction
Published 1 January 2017Open access
Daniil Sorokin, Iryna Gurevych
Citations150
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
It is demonstrated that for sentence-level relation extraction it is beneficial to consider other relations in the sentential context while predicting the target relation and to combine the context representations with an attention mechanism to make the final prediction.
Abstract
We demonstrate that for sentence-level relation extraction it is beneficial to consider other relations in the sentential context while predicting the target relation. Our architecture uses an LSTM-based encoder to jointly learn representations for all relations in a single sentence. We combine the context representations with an attention mechanism to make the final prediction.
Keywords
Computer Science
Neural ComputationLong Short-Term Memory
98,079 Citations1997Sepp Hochreiter, Jürgen Schmidhuber
A novel, efficient, gradient based method called long short-term memory (LSTM) is introduced, which can learn to bridge minimal time lags in excess of 1000 discrete-time steps by enforcing constant error flow through constant error carousels within special units.
UvA-DARE (University of Amsterdam)Adam: A Method for Stochastic Optimization
84,783 Citations2014Diederik P. Kingma, Jimmy Ba
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
50,318 Citations2021Mandi, Jayanta, Canoy, Rocsildes +2 more
A simple numeric simulation of DNA-co-polymerized hydrogel shape change and a genetic algorithm that generates and selects large batches of material designs that compete with one another to evolve and converge on optimal objective-matching designs are constructed.
Dropout: a simple way to prevent neural networks from overfitting
34,279 Citations2014Nitish Srivastava, Geoffrey E. Hinton +3 more
It is shown that dropout improves the performance of neural networks on supervised learning tasks in vision, speech recognition, document classification and computational biology, obtaining state-of-the-art results on many benchmark data sets.
Glove: Global Vectors for Word Representation
33,769 Citations2014Jeffrey Pennington, Richard Socher +1 more
A new global logbilinear regression model that combines the advantages of the two major model families in the literature: global matrix factorization and local context window methods and produces a vector space with meaningful substructure.
The Stanford CoreNLP Natural Language Processing Toolkit
7,238 Citations2014Christopher D. Manning, Mihai Surdeanu +4 more
The design and use of the Stanford CoreNLP toolkit is described, an extensible pipeline that provides core natural language analysis, and it is suggested that this follows from a simple, approachable design, straightforward interfaces, the inclusion of robust and good quality analysis components, and not requiring use of a large amount of associated baggage.
Distant supervision for relation extraction without labeled data
2,913 Citations2009Mike D. Mintz, Steven Bills +2 more
This work investigates an alternative paradigm that does not require labeled corpora, avoiding the domain dependence of ACE-style algorithms, and allowing the use of corpora of any size.
Lecture notes in computer scienceModeling Relations and Their Mentions without Labeled Text
1,331 Citations2010Sebastian Riedel, Limin Yao +1 more
A novel approach to distant supervision that can alleviate the problem of noisy patterns that hurt precision by using a factor graph and applying constraint-driven semi-supervision to train this model without any knowledge about which sentences express the relations in the authors' training KB.
End-to-End Relation Extraction using LSTMs on Sequences and Tree Structures
1,253 Citations2016Makoto Miwa, Mohit Bansal
A novel end-to-end neural model to extract entities and relations between them and compares favorably to the state-of-the-art CNN based model (in F1-score) on nominal relation classification (SemEval-2010 Task 8).
Distant Supervision for Relation Extraction via Piecewise Convolutional Neural Networks
1,215 Citations2015Daojian Zeng, Kang Liu +2 more
This paper proposes a novel model dubbed the Piecewise Convolutional Neural Networks (PCNNs) with multi-instance learning to address the problem of wrong label problem when using distant supervision for relation extraction and adopts convolutional architecture with piecewise max pooling to automatically learn relevant features.
Neural Relation Extraction with Selective Attention over Instances
1,097 Citations2016Yankai Lin, Shiqi Shen +3 more
A sentence-level attention-based model for relation extraction that achieves significant and consistent improvements on relation extraction as compared with baselines.
Knowledge-Based Weak Supervision for Information Extraction of Overlapping Relations
923 Citations2011Raphael Hoffmann, Congle Zhang +3 more
A novel approach for multi-instance learning with overlapping relations that combines a sentence-level extraction model with a simple, corpus-level component for aggregating the individual facts is presented.
Multi-instance Multi-label Learning for Relation Extraction
682 Citations2012Mihai Surdeanu, Julie Tibshirani +2 more
This work proposes a novel approach to multi-instance multi-label learning for RE, which jointly models all the instances of a pair of entities in text and all their labels using a graphical model with latent variables that performs competitively on two difficult domains.
Joint Event Extraction via Structured Prediction with Global Features
478 Citations2013Qi Li, Heng Ji +1 more
This work proposes a joint framework based on structured prediction which extracts triggers and arguments together so that the local predictions can be mutually improved, and proposes to incorporate global features which explicitly capture the dependencies of multiple triggers and argued.
Munich Personal RePEc Archive (Ludwig Maximilian University of Munich)A Linear Programming Formulation for Global Inference in Natural Language Tasks
442 Citations2004Dan Roth, Wen-tau Yih
This work develops a linear programing formulation for this problem and evaluates it in the context of simultaneously learning named entities and relations to efficiently incorporate domain and task specific constraints at decision time, resulting in significant improvements in the accuracy and the "human-like" quality of the inferences.
Fact Checking: Task definition and dataset construction
406 Citations2014Andreas Vlachos, Sebastian Riedel
The task of fact checking is introduced and the construction of a publicly available dataset using statements fact-checked by journalists available online is detailed, including baseline approaches for the task and the challenges that need to be addressed.
Question Answering on Freebase via Relation Extraction and Textual Evidence
288 Citations2016Kun Xu, Siva Reddy +3 more
This work first presents a neural network based relation extractor to retrieve the candidate answers from Freebase, and then infer over Wikipedia to validate these answers, a substantial improvement over the state-of-the-art.
Language Resources and EvaluationMultilingual and cross-domain temporal tagging
214 Citations2012Jannik Strötgen, Michael Gertz
The authors' publicly available temporal tagger HeidelTime is presented, which is easily extensible to further languages due to its strict separation of source code and language resources like patterns and rules.
arXiv (Cornell University)Self-Adaptive Hierarchical Sentence Model
52 Citations2015Han Zhao, Zhengdong Lu +1 more