A Dependency-Based Neural Network for Relation Classification
Published 1 January 2015Open access
Yang Liu, Furu Wei, Sujian Li, Heng Ji, Ming Zhou, Houfeng Wang
Citations201
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
A new structure, termed augmented dependency path (ADP), is proposed, which is composed of the shortest dependency path between two entities and the subtrees attached to the shortest path, and a dependency-based neural networks (DepNN) are developed to exploit the semantic representation behind the ADP.
Abstract
Yang Liu, Furu Wei, Sujian Li, Heng Ji, Ming Zhou, Houfeng Wang. Proceedings of the 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing (Volume 2: Short Papers). 2015.
Keywords
Computer ScienceBiochemistry, Genetics and Molecular Biology
NatureLearning representations by back-propagating errors
30,885 Citations1986David E. Rumelhart, Geoffrey E. Hinton +1 more
Back-propagation repeatedly adjusts the weights of the connections in the network so as to minimize a measure of the difference between the actual output vector of the net and the desired output vector, which helps to represent important features of the task domain.
arXiv (Cornell University)Natural Language Processing (almost) from Scratch
5,172 Citations2011Ronan Collobert, Jason Weston +4 more
Natural Language Processing (almost) from Scratch
3,987 Citations2011Ronan Collobert, Jason Weston +4 more
Accurate unlexicalized parsing
3,055 Citations2003Dan Klein, Christopher D. Manning
It is demonstrated that an unlexicalized PCFG can parse much more accurately than previously shown, by making use of simple, linguistically motivated state splits, which break down false independence assumptions latent in a vanilla treebank grammar.
Relation Classification via Convolutional Deep Neural Network
1,412 Citations2014Daojian Zeng, Kang Liu +3 more
This paper exploits a convolutional deep neural network (DNN) to extract lexical and sentence level features from the output of pre-existing natural language processing systems and significantly outperforms the state-of-the-art methods.
Semantic Compositionality through Recursive Matrix-Vector Spaces
1,297 Citations2012Richard Socher, Brody Huval +2 more
A recursive neural network model that learns compositional vector representations for phrases and sentences of arbitrary syntactic type and length and can learn the meaning of operators in propositional logic and natural language is introduced.
A shortest path dependency kernel for relation extraction
971 Citations2005Răzvan Bunescu, Raymond J. Mooney
Experiments on extracting top-level relations from the ACE (Automated Content Extraction) newspaper corpus show that the new shortest path dependency kernel outperforms a recent approach based on dependency tree kernels.
Transactions of the Association for Computational LinguisticsGrounded Compositional Semantics for Finding and Describing Images with Sentences
831 Citations2014Richard Socher, Andrej Karpathy +3 more
The DT-RNN model, which uses dependency trees to embed sentences into a vector space in order to retrieve images that are described by those sentences, outperform other recursive and recurrent neural networks, kernelized CCA and a bag-of-words baseline on the tasks of finding an image that fits a sentence description and vice versa.
Dependency tree kernels for relation extraction
825 Citations2004Aron Culotta, Jeffrey Sorensen
This work extends previous work on tree kernels to estimate the similarity between the dependency trees of sentences, and uses this kernel within a Support Vector Machine to detect and classify relations between entities in the Automatic Content Extraction (ACE) corpus of news articles.
arXiv (Cornell University)SemEval-2010 Task 8: Multi-Way Classification of Semantic Relations Between Pairs of Nominals
447 Citations2019Iris Hendrickx, Su‐Nam Kim +7 more
This paper defines the task, describes the training and test data and the process of their creation, lists the participating systems (10 teams, 28 runs), and discusses their results.
UTD: Classifying Semantic Relations by Combining Lexical and Semantic Resources
219 Citations2010Bryan Rink, Sanda M. Harabagiu
This paper describes the system for SemEval-2010 Task 8 on multi-way classification of semantic relations between nominals using SVM classifiers and a number of features that capture the context, semantic role affiliation, and possible pre-existing relations of the nominals.
Combining linguistic and statistical analysis to extract relations from web documents
187 Citations2006Fabian M. Suchanek, Georgiana Ifrim +1 more
It is shown that this approach profits significantly when deep linguistic structures are used instead of surface text patterns, and the benefits of this approach are shown by extensive experiments with the prototype system LEILA.
National Conference on Artificial IntelligenceRelation extraction from wikipedia using subtree mining
96 Citations2007Dat Nguyen, Yutaka Matsuo +1 more
This study addresses the problem of extracting relations among entities from Wikipedia's English articles, which in turn can serve for intelligent systems to satisfy users' information needs.
Communications in computer and information scienceA Survey on Relation Extraction
48 Citations2017Meiji Cui, Li Li +2 more
The paper reviews relation extraction mainly concentrating on its mainstream methods, and open information extraction (OIE), as a different relation extraction paradigm, is introduced as well.
A Re-examination of Dependency Path Kernels for Relation Extraction
45 Citations2008Mengqiu Wang
It is shown that relation extraction can benefit from increasing the feature space through convolution kernel and introducing bias towards more syntactically meaningful feature space, and a new convolution dependency path kernel is proposed that combines the above two benefits.