A Seq2seq-Based Approach to Question Answering over Knowledge Bases

2020 ◽  
pp. 170-181
Author(s):  
Linjuan Wu ◽  
Peiyun Wu ◽  
Xiaowang Zhang
Keyword(s):  
Question Answering ◽  
Knowledge Bases

scholarly journals Formal Query Building with Query Structure Prediction for Complex Question Answering over Knowledge Base

2020 ◽  
Author(s):  
Yongrui Chen ◽  
Huiying Li ◽  
Yuncheng Hua ◽  
Guilin Qi
Keyword(s):  
Knowledge Base ◽  
Structure Prediction ◽  
Question Answering ◽  
State Transition ◽  
Knowledge Bases ◽  
Second Stage ◽  
Transition Strategy ◽  
Query Structure ◽  
Two Stages ◽  
Complex Question

Formal query building is an important part of complex question answering over knowledge bases. It aims to build correct executable queries for questions. Recent methods try to rank candidate queries generated by a state-transition strategy. However, this candidate generation strategy ignores the structure of queries, resulting in a considerable number of noisy queries. In this paper, we propose a new formal query building approach that consists of two stages. In the first stage, we predict the query structure of the question and leverage the structure to constrain the generation of the candidate queries. We propose a novel graph generation framework to handle the structure prediction task and design an encoder-decoder model to predict the argument of the predetermined operation in each generative step. In the second stage, we follow the previous methods to rank the candidate queries. The experimental results show that our formal query building approach outperforms existing methods on complex questions while staying competitive on simple questions.

Data mining for building knowledge bases: techniques, architectures and applications

2016 ◽  
Vol 31 (2) ◽  
pp. 97-123 ◽  
Author(s):  
Alfred Krzywicki ◽  
Wayne Wobcke ◽  
Michael Bain ◽  
John Calvo Martinez ◽  
Paul Compton
Keyword(s):  
Data Mining ◽  
Knowledge Base ◽  
Question Answering ◽  
Knowledge Bases ◽  
Event Extraction ◽  
Data Sources ◽  
Small Scale ◽  
Knowledge Mining ◽  
Practical Applications ◽  
Unstructured Text

AbstractData mining techniques for extracting knowledge from text have been applied extensively to applications including question answering, document summarisation, event extraction and trend monitoring. However, current methods have mainly been tested on small-scale customised data sets for specific purposes. The availability of large volumes of data and high-velocity data streams (such as social media feeds) motivates the need to automatically extract knowledge from such data sources and to generalise existing approaches to more practical applications. Recently, several architectures have been proposed for what we callknowledge mining: integrating data mining for knowledge extraction from unstructured text (possibly making use of a knowledge base), and at the same time, consistently incorporating this new information into the knowledge base. After describing a number of existing knowledge mining systems, we review the state-of-the-art literature on both current text mining methods (emphasising stream mining) and techniques for the construction and maintenance of knowledge bases. In particular, we focus on mining entities and relations from unstructured text data sources, entity disambiguation, entity linking and question answering. We conclude by highlighting general trends in knowledge mining research and identifying problems that require further research to enable more extensive use of knowledge bases.

An Overview of Utilizing Knowledge Bases in Neural Networks for Question Answering

2020 ◽  
Vol 22 (5) ◽  
pp. 1095-1111 ◽  
Author(s):  
Sabin Kafle ◽  
Nisansa de Silva ◽  
Dejing Dou
Keyword(s):  
Neural Networks ◽  
Question Answering ◽  
Knowledge Bases

Question Answering in Restricted Domains: An Overview

2007 ◽  
Vol 33 (1) ◽  
pp. 41-61 ◽  
Author(s):  
Diego Mollá ◽  
José Luis Vicedo
Keyword(s):  
Research And Development ◽  
Historical Perspective ◽  
Question Answering ◽  
Knowledge Bases ◽  
Specific Information ◽  
Research Issues ◽  
Computing Power ◽  
Domain Specific ◽  
Text Collections ◽  
Restricted Domains

Automated question answering has been a topic of research and development since the earliest AI applications. Computing power has increased since the first such systems were developed, and the general methodology has changed from the use of hand-encoded knowledge bases about simple domains to the use of text collections as the main knowledge source over more complex domains. Still, many research issues remain. The focus of this article is on the use of restricted domains for automated question answering. The article contains a historical perspective on question answering over restricted domains and an overview of the current methods and applications used in restricted domains. A main characteristic of question answering in restricted domains is the integration of domain-specific information that is either developed for question answering or that has been developed for other purposes. We explore the main methods developed to leverage this domain-specific information.

scholarly journals Differentiable Reasoning on Large Knowledge Bases and Natural Language

2020 ◽  
Vol 34 (04) ◽  
pp. 5182-5190
Author(s):  
Pasquale Minervini ◽  
Matko Bošnjak ◽  
Tim Rocktäschel ◽  
Sebastian Riedel ◽  
Edward Grefenstette
Keyword(s):  
Natural Language ◽  
Link Prediction ◽  
Question Answering ◽  
Knowledge Bases ◽  
Small Scale ◽  
Reasoning Systems ◽  
Novel Approach ◽  
Real World Datasets ◽  
Interpretable Models ◽  
Machine Reading

Reasoning with knowledge expressed in natural language and Knowledge Bases (KBs) is a major challenge for Artificial Intelligence, with applications in machine reading, dialogue, and question answering. General neural architectures that jointly learn representations and transformations of text are very data-inefficient, and it is hard to analyse their reasoning process. These issues are addressed by end-to-end differentiable reasoning systems such as Neural Theorem Provers (NTPs), although they can only be used with small-scale symbolic KBs. In this paper we first propose Greedy NTPs (GNTPs), an extension to NTPs addressing their complexity and scalability limitations, thus making them applicable to real-world datasets. This result is achieved by dynamically constructing the computation graph of NTPs and including only the most promising proof paths during inference, thus obtaining orders of magnitude more efficient models 1. Then, we propose a novel approach for jointly reasoning over KBs and textual mentions, by embedding logic facts and natural language sentences in a shared embedding space. We show that GNTPs perform on par with NTPs at a fraction of their cost while achieving competitive link prediction results on large datasets, providing explanations for predictions, and inducing interpretable models.

scholarly journals CoRg: Commonsense Reasoning Using a Theorem Prover and Machine Learning

10.29007/lt5p ◽  
2019 ◽  
Author(s):  
Sophie Siebert ◽  
Frieder Stolzenburg
Keyword(s):  
Machine Learning ◽  
Question Answering ◽  
Learning Algorithms ◽  
Knowledge Bases ◽  
Black Box ◽  
Machine Learning Algorithms ◽  
Theorem Prover ◽  
Commonsense Reasoning ◽  
Probable Answer ◽  
Everyday Task

Commonsense reasoning is an everyday task that is intuitive for humans but hard to implement for computers. It requires large knowledge bases to get the required data from, although this data is still incomplete or even inconsistent. While machine learning algorithms perform rather well on these tasks, the reasoning process remains a black box. To close this gap, our system CoRg aims to build an explainable and well-performing system, which consists of both an explainable deductive derivation process and a machine learning part. We conduct our experiments on the Copa question-answering benchmark using the ontologies WordNet, Adimen-SUMO, and ConceptNet. The knowledge is fed into the theorem prover Hyper and in the end the conducted models will be analyzed using machine learning algorithms, to derive the most probable answer.

scholarly journals PullNet: Open Domain Question Answering with Iterative Retrieval on Knowledge Bases and Text

2019 ◽  
Author(s):  
Haitian Sun ◽  
Tania Bedrax-Weiss ◽  
William Cohen
Keyword(s):  
Question Answering ◽  
Knowledge Bases ◽  
Open Domain

scholarly journals Simulation-Based Approach to Efficient Commonsense Reasoning in Very Large Knowledge Bases

2019 ◽  
Vol 33 ◽  
pp. 1360-1367
Author(s):  
Abhishek Sharma ◽  
Keith M. Goolsbey
Keyword(s):  
Machine Learning ◽  
Question Answering ◽  
Knowledge Bases ◽  
Cognitive Systems ◽  
General Knowledge ◽  
Commonsense Reasoning ◽  
Selection Methods ◽  
Monte Carlo Simulation Technique ◽  
Simulation Based ◽  
Limited Reasoning

Cognitive systems must reason with large bodies of general knowledge to perform complex tasks in the real world. However, due to the intractability of reasoning in large, expressive knowledge bases (KBs), many AI systems have limited reasoning capabilities. Successful cognitive systems have used a variety of machine learning and axiom selection methods to improve inference. In this paper, we describe a search heuristic that uses a Monte-Carlo simulation technique to choose inference steps. We test the efficacy of this approach on a very large and expressive KB, Cyc. Experimental results on hundreds of queries show that this method is highly effective in reducing inference time and improving question-answering (Q/A) performance.

scholarly journals Introducing External Knowledge to Answer Questions with Implicit Temporal Constraints over Knowledge Base

2020 ◽  
Vol 12 (3) ◽  
pp. 45
Author(s):  
Wenqing Wu ◽  
Zhenfang Zhu ◽  
Qiang Lu ◽  
Dianyuan Zhang ◽  
Qiangqiang Guo
Keyword(s):  
Natural Language ◽  
Knowledge Base ◽  
Question Answering ◽  
Knowledge Bases ◽  
Temporal Information ◽  
Temporal Constraints ◽  
External Knowledge ◽  
Question Answering Systems ◽  
Natural Language Question ◽  
Applied Knowledge

Knowledge base question answering (KBQA) aims to analyze the semantics of natural language questions and return accurate answers from the knowledge base (KB). More and more studies have applied knowledge bases to question answering systems, and when using a KB to answer a natural language question, there are some words that imply the tense (e.g., original and previous) and play a limiting role in questions. However, most existing methods for KBQA cannot model a question with implicit temporal constraints. In this work, we propose a model based on a bidirectional attentive memory network, which obtains the temporal information in the question through attention mechanisms and external knowledge. Specifically, we encode the external knowledge as vectors, and use additive attention between the question and external knowledge to obtain the temporal information, then further enhance the question vector to increase the accuracy. On the WebQuestions benchmark, our method not only performs better with the overall data, but also has excellent performance regarding questions with implicit temporal constraints, which are separate from the overall data. As we use attention mechanisms, our method also offers better interpretability.

Sign in / Sign up

Export Citation Format

Share Document