Syntax-based Deep Matching of Short Texts

By Mingxuan Wang, Zhengdong Lu, Hang Li, Qun Liu. 2015

87 citations recorded by the source corpus.

Many tasks in natural language processing, ranging from machine translation to question answering, can be reduced to the problem of matching two sentences or more generally two short texts. We propose a new approach to the problem, called Deep Match Tree (DeepMatch$_{tree}$), under a general setting. The approach consists of two components, 1) a mining algorithm to discover patterns for matching two short-texts, defined in the product space of dependency trees, and 2) a deep neural network for matching short texts using the mined patterns, as well as a learning algorithm to build the network having a sparse structure. We test our algorithm on the problem of matching a tweet and a response in social media, a hard matching problem proposed in [Wang et al., 2013], and show that DeepMatch$_{tree}$ can outperform a number of competitor models including one without using dependency trees and one based on word-embedding, all with large margins

Subfields: Artificial Intelligence, Natural Language Processing

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. Jamie Callan
  2. Jiafeng Guo
  3. W. Bruce Croft
  4. Qingyao Ai
  5. Yixing Fan
  6. Wayne Xin Zhao
  7. Zhuyun Dai
  8. Jimmy J. Lin

In Natural Language Processing

  1. Jiafeng Guo
  2. Yixing Fan
  3. Qingyao Ai
  4. W. Bruce Croft
  5. Wayne Xin Zhao
  6. Xiaorui Liu
  7. Jiliang Tang
  8. Lu Li

Citations in the corpus