2015 · 62 citations · 28 references
ComputingComputer ScienceLinguisticsComputational LinguisticsMachine LearningNatural Language ProcessingConstituent StructureDeep LearningDependency ParsingParsingRelation ExtractionSyntactic AnalysisDependency Graph AnalysisDependency Graph ModelingDependency GraphsParse TreesRelation Classification
We present a novel approach for relation classification, using a recursive neural network (RNN), based on the shortest path between two entities in a dependency graph. Previous works on RNN are based on constituencybased parsing because phrasal nodes in a parse tree can capture compositionality in a sentence. Compared with constituency-based parse trees, dependency graphs can represent relations more compactly. This is particularly important in sentences with distant entities, where the parse tree spans words that are not relevant to the relation. In such cases RNN cannot be trained effectively in a timely manner. However, due to the lack of phrasal nodes in dependency graphs, application of RNN is not straightforward. In order to tackle this problem, we utilize dependency constituent units called chains. Our experiments on two relation classification datasets show that Chain based RNN provides a shallower network, which performs considerably faster and achieves better classification results.
28
A Fast Learning Algorithm for Deep Belief Nets
Geoffrey E. Hinton, Simon Osindero, Yee‐Whye Teh · Neural Computation · 2006 · 16.4K citations
Recursive Deep Models for Semantic Compositionality Over a Sentiment Treebank
Richard Socher, Alex Perelygin, Jean Y. Wu et al. · 2013 · 6.8K citations · Full text
A unified architecture for natural language processing
Ronan Collobert, Jason Weston · 2008 · 5.2K citations
Open information extraction from the web
Michele Banko, Michael Cafarella, Stephen Soderland et al. · 2007 · 1.3K citations
Semantic Compositionality through Recursive Matrix-Vector Spaces
Richard Socher, Brody Huval, Christopher D. Manning et al. · 2012 · 1.3K citations