Neural Graph Matching Networks for Chinese Short Text Matching

Lu Chen, Yanbin Zhao, Boer Lv, Lesheng Jin, Zhi Chen, Su Zhu, Kai Yu

Abstract Paper Share

Semantics: Textual Inference and Other Areas of Semantics Short Paper

Session 11A: Jul 8 (05:00-06:00 GMT)
Session 13A: Jul 8 (12:00-13:00 GMT)
Abstract: Chinese short text matching usually employs word sequences rather than character sequences to get better performance. However, Chinese word segmentation can be erroneous, ambiguous or inconsistent, which consequently hurts the final matching performance. To address this problem, we propose neural graph matching networks, a novel sentence matching framework capable of dealing with multi-granular input information. Instead of a character sequence or a single word sequence, paired word lattices formed from multiple word segmentation hypotheses are used as input and the model learns a graph representation according to an attentive graph matching mechanism. Experiments on two Chinese datasets show that our models outperform the state-of-the-art short text matching models.
You can open the pre-recorded video in a separate window.
NOTE: The SlidesLive video may display a random order of the authors. The correct author list is shown at the top of this webpage.

Similar Papers

A Relaxed Matching Procedure for Unsupervised BLI
Xu Zhao, Zihao Wang, Yong Zhang, Hao Wu,
A representative figure from paper main.274
Structural Information Preserving for Graph-to-Text Generation
Linfeng Song, Ante Wang, Jinsong Su, Yue Zhang, Kun Xu, Yubin Ge, Dong Yu,
A representative figure from paper main.712