Training a Ranking Function for Open-Domain Question Answering
Phu Mon Affiliation: Center for Data ScienceNew York University60 Fifth AvenueNew York, NY 10011 Samuel R. Affiliation: Center for Data ScienceNew York University60 Fifth AvenueNew York, NY 10011 Affiliation: Dept. of LinguisticsNew York University10 Washington PlaceNew York, NY 10003 Affiliation: Dept. of Computer ScienceNew York University60 Fifth AvenueNew York, NY 10011 Kyunghyun Affiliation: Center for Data ScienceNew York University60 Fifth AvenueNew York, NY 10011 Affiliation: Dept. of Computer ScienceNew York University60 Fifth AvenueNew York, NY 10011
Abstract
In recent years, there have been amazing advances in deep learning methods for machine reading. In machine reading, the machine reader has to extract the answer from the given ground truth paragraph. Recently, the state-of-the-art machine reading models achieve human level performance in SQuAD which is a reading comprehension-style question answering (QA) task. The success of machine reading has inspired researchers to combine information retrieval with machine reading to tackle open-domain QA. However, these systems perform poorly compared to reading comprehension-style QA because it is difficult to retrieve the pieces of paragraphs that contain the answer to the question. In this study, we propose two neural network rankers that assign scores to different passages based on their likelihood of containing the answer to a given question. Additionally, we analyze the relative importance of semantic similarity and word level relevance matching in open-domain QA.
原文 arXiv:1804.04264;中英对照 + 大白话阅读 https://aha.fim.ai/paper/1804.04264v1