Abductive Matching in Question Answering

09/10/2017
by   Kedar Dhamdhere, et al.
0

We study question-answering over semi-structured data. We introduce a new way to apply the technique of semantic parsing by applying machine learning only to provide annotations that the system infers to be missing; all the other parsing logic is in the form of manually authored rules. In effect, the machine learning is used to provide non-syntactic matches, a step that is ill-suited to manual rules. The advantage of this approach is in its debuggability and in its transparency to the end-user. We demonstrate the effectiveness of the approach by achieving state-of-the-art performance of 40.42 benchmark dataset over tables from Wikipedia.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/03/2015

Compositional Semantic Parsing on Semi-Structured Tables

Two important aspects of semantic parsing for question answering are the...
research
02/12/2019

Table2answer: Read the database and answer without SQL

Semantic parsing is the task of mapping natural language to logic form. ...
research
04/04/2016

Character-Level Question Answering with Attention

We show that a character-level encoder-decoder framework can be successf...
research
05/04/2022

Compositional Task-Oriented Parsing as Abstractive Question Answering

Task-oriented parsing (TOP) aims to convert natural language into machin...
research
09/04/2002

Question answering: from partitions to Prolog

We implement Groenendijk and Stokhof's partition semantics of questions ...
research
01/13/2022

Towards Automated Error Analysis: Learning to Characterize Errors

Characterizing the patterns of errors that a system makes helps research...
research
09/05/2018

Policy Shaping and Generalized Update Equations for Semantic Parsing from Denotations

Semantic parsing from denotations faces two key challenges in model trai...

Please sign up or login with your details

Forgot password? Click here to reset