Classifying Relations via Long Short Term Memory Networks along Shortest Dependency Paths

By Yan Xu, Lili Mou, Ge Li, Yunchuan Chen, Hao Peng, Zhi Jin. 2015

691 citations recorded by the source corpus.

Relation classification is an important research arena in the field of natural language processing (NLP). In this paper, we present SDP-LSTM, a novel neural network to classify the relation of two entities in a sentence. Our neural architecture leverages the shortest dependency path (SDP) between two entities; multichannel recurrent neural networks, with long short term memory (LSTM) units, pick up heterogeneous information along the SDP. Our proposed model has several distinct features: (1) The shortest dependency paths retain most relevant information (to relation classification), while eliminating irrelevant words in the sentence. (2) The multichannel LSTM networks allow effective information integration from heterogeneous sources over the dependency paths. (3) A customized dropout strategy regularizes the neural network to alleviate overfitting. We test our model on the SemEval 2010 relation classification task, and achieve an $F_1$-score of 83.7\%, higher than competing methods in the literature.

Subfields: Artificial Intelligence, Natural Language Processing, Model Architectures

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Zhiyuan Liu
  2. Maosong Sun
  3. Minlie Huang
  4. Mohit Bansal
  5. Jianfeng Gao
  6. Graham Neubig
  7. Xu Han
  8. Erik Cambria

In Natural Language Processing

  1. Zhiyuan Liu
  2. Maosong Sun
  3. Mohit Bansal
  4. Jianfeng Gao
  5. Minlie Huang
  6. Graham Neubig
  7. Luke S. Zettlemoyer
  8. Yejin Choi

In Model Architectures

  1. Dongxu Zhang
  2. Zhiyuan Liu
  3. Thien Huu Nguyen
  4. Ruslan Salakhutdinov
  5. Meishan Zhang
  6. Jie Zhou
  7. Maosong Sun
  8. Claire Cardie

Citations in the corpus