All Information is Valuable: Question Matching over Full Information Transmission Network (2022.findings-naacl)
Copied to clipboard
| Challenge: | Existing methods for question matching only transmit one kind of information while failing to utilize both kinds of information simultaneously. |
| Approach: | They propose a question matching network that can transmit both representation and interactive information together in a simultaneous fashion. |
| Outcome: | The proposed approach outperforms strong baseline models on two standard benchmarks. |
Similar Papers
Context-Aware Interaction Network for Question Matching (2021.emnlp-main)
Copied to clipboard
| Challenge: | Existing models focus on word-level local matching and neglect the importance of contextual information. |
| Approach: | They propose a context-aware interaction network to properly align two sequences and infer their semantic relationship by using gate fusion layers. |
| Outcome: | The proposed model can accurately align two sequences and infer their semantic relationship on two question matching datasets. |
Transfer Learning for Context-Aware Question Matching in Information-seeking Conversations in E-commerce (P18-2)
Copied to clipboard
| Challenge: | Recent researches focus on deep learning and reinforcement learning for multi-turn information seeking conversation systems. |
| Approach: | They propose an efficient and effective multi-turn conversation model based on convolutional neural networks and extend it to adapt the knowledge learned from a resource-rich domain to enhance the performance. |
| Outcome: | The proposed model performs better than the existing model on an industrial chatbot called AliMe Assist. |
One Time of Interaction May Not Be Enough: Go Deep with an Interaction-over-Interaction Network for Response Selection in Dialogues (P19-1)
Copied to clipboard
| Challenge: | Currently, retrieval-based dialogues are performed in shallow ways . a recent study investigated the problem of context-response matching in open-domain . |
| Approach: | They propose a model that lets utterance-response interaction go deep by stacking interaction blocks. |
| Outcome: | The proposed model outperforms state-of-the-art methods on three benchmark data sets. |
Original Semantics-Oriented Attention and Deep Fusion Network for Sentence Matching (D19-1)
Copied to clipboard
| Challenge: | Sentence matching is a key issue in natural language inference and paraphrase identification. |
| Approach: | They propose a semantics-oriented attention and deep fusion network (OSOA-DFN) that is oriented to the original semantic representation of another sentence and propagates attention information at each matching layer. |
| Outcome: | The proposed model can model sentence matching more precisely on three sentence matching benchmark datasets. |
Knowledge Base Question Answering via Encoding of Complex Query Graphs (D18-1)
Copied to clipboard
| Challenge: | Existing KBQA methods focus on simpler questions and do not work well on complex questions . a knowledge-based question answering approach is able to answer complex questions using a standard knowledge base . |
| Approach: | They propose to encode query structure into a uniform vector representation of a question and its semantic components into . |
| Outcome: | The proposed approach outperforms existing methods on complex questions while staying competitive on simple questions. |
Convolutional Interaction Network for Natural Language Inference (D18-1)
Copied to clipboard
| Challenge: | Attention-based neural models have achieved great success in natural language inference (NLI). |
| Approach: | They propose a general model to capture the interaction between two sentences, which can be an alternative to the attention mechanism for NLI. |
| Outcome: | The proposed model can capture complex interactions on three large datasets. |
PullNet: Open Domain Question Answering with Iterative Retrieval on Knowledge Bases and Text (D19-1)
Copied to clipboard
| Challenge: | Experimentally PullNet improves over the prior state-of-the-art open domain question answering systems. |
| Approach: | They propose a framework for learning what to retrieve and reasoning with heterogeneous information to find the best answer. |
| Outcome: | The proposed framework improves over the prior state-of-the-art in open domain question answering . it is weakly supervised, requiring question-answer pairs but not gold inference paths . |
Hierarchical Representation-based Dynamic Reasoning Network for Biomedical Question Answering (2022.coling-1)
Copied to clipboard
Jianguo Mao, Jiyuan Zhang, Zengfeng Zeng, Weihua Peng, Wenbin Jiang, Xiangdong Wang, Hong Liu, Yajuan Lyu
| Challenge: | Existing models of biomedical question answering are limited in their ability to predict answers . a new model improves the performance of existing models, but the code will be released after the paper is published. |
| Approach: | They propose a hierarchical representation-based dynamic reasoning network to solve biomedical problems. |
| Outcome: | The proposed model significantly improves on three mainstream biomedical datasets . the code will be released after the paper is published . |
Question Answering by Reasoning Across Documents with Graph Convolutional Networks (N19-1)
Copied to clipboard
| Challenge: | Recent research in reading comprehension has focused on answering questions based on individual documents or even single paragraphs. |
| Approach: | They propose a neural model which integrates and reasons relying on information spread within documents and across multiple documents. |
| Outcome: | The proposed model achieves state-of-the-art on a multi-document question answering dataset, WikiHop. |
Matching Article Pairs with Graphical Decomposition and Convolutions (P19-1)
Copied to clipboard
| Challenge: | Existing methods for matching sentence pairs do not perform well in longer documents . Existing approaches for matching sentences do not work in longer document understanding tasks . |
| Approach: | They propose to model article pairs by comparing sentences that enclose same concept vertex . they propose to use a concept interaction graph to match articles by encoding sentences . |
| Outcome: | The proposed methods show significant improvements over existing methods . the proposed datasets consist of 30K pairs of breaking news articles . |