Question Dependent Recurrent Entity Network for Question Answering
نویسندگان
چکیده
منابع مشابه
Question Dependent Recurrent Entity Network for Question Answering
Question Answering is a task which requires building models that are able to automatically reply to questions given by humans. In the recent years, growing interest has been shown in tasks that require reasoning abilities in order to answer questions. Thus, in this study, we introduced a model to accomplish different Question Answering tasks, which are: Reasoning Question Answering and Reading ...
متن کاملInvestigating Embedded Question Reuse in Question Answering
The investigation presented in this paper is a novel method in question answering (QA) that enables a QA system to gain performance through reuse of information in the answer to one question to answer another related question. Our analysis shows that a pair of question in a general open domain QA can have embedding relation through their mentions of noun phrase expressions. We present methods f...
متن کاملA Named Entity Recogniser for Question Answering
Named Entity Recognisers (NERs) are typically used by question answering (QA) systems as means to preselect answer candidates. However, there has not been much work on the formal assessment of the use of NERs for QA nor on their optimal parameters. In this paper we investigate the main characteristics of a NER for QA. The results show that it is important to maintain high recall to retain all p...
متن کاملNamed Entity Recognition for Question Answering
Current text-based question answering (QA) systems usually contain a named entity recogniser (NER) as a core component. Named entity recognition has traditionally been developed as a component for information extraction systems, and current techniques are focused on this end use. However, no formal assessment has been done on the characteristics of a NER within the task of question answering. I...
متن کاملLearning Named Entity Hyponyms for Question Answering
Lexical mismatch is a problem that confounds automatic question answering systems. While existing lexical ontologies such as WordNet have been successfully used to match verbal synonyms (e.g., beat and defeat) and common nouns (tennis is-a sport), their coverage of proper nouns is less extensive. Question answering depends substantially on processing named entities, and thus it would be of sign...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Italian Journal of Computational Linguistics
سال: 2017
ISSN: 2499-4553
DOI: 10.4000/ijcol.547