Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
102 tokens/sec
GPT-4o
59 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
50 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Multi-turn Inference Matching Network for Natural Language Inference (1901.02222v1)

Published 8 Jan 2019 in cs.CL

Abstract: Natural Language Inference (NLI) is a fundamental and challenging task in NLP. Most existing methods only apply one-pass inference process on a mixed matching feature, which is a concatenation of different matching features between a premise and a hypothesis. In this paper, we propose a new model called Multi-turn Inference Matching Network (MIMN) to perform multi-turn inference on different matching features. In each turn, the model focuses on one particular matching feature instead of the mixed matching feature. To enhance the interaction between different matching features, a memory component is employed to store the history inference information. The inference of each turn is performed on the current matching feature and the memory. We conduct experiments on three different NLI datasets. The experimental results show that our model outperforms or achieves the state-of-the-art performance on all the three datasets.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (4)
  1. Chunhua Liu (10 papers)
  2. Shan Jiang (61 papers)
  3. Hainan Yu (1 paper)
  4. Dong Yu (329 papers)
Citations (9)