Question answering: from partitions to Prolog

09/04/2002
by   Balder D. ten Cate, et al.
0

We implement Groenendijk and Stokhof's partition semantics of questions in a simple question answering algorithm. The algorithm is sound, complete, and based on tableau theorem proving. The algorithm relies on a syntactic characterization of answerhood: Any answer to a question is equivalent to some formula built up only from instances of the question. We prove this characterization by translating the logic of interrogation to classical predicate logic and applying Craig's interpolation theorem.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/02/2014

Watsonsim: Overview of a Question Answering Engine

The objective of the project is to design and run a system similar to Wa...
research
09/04/2002

The partition semantics of questions, syntactically

Groenendijk and Stokhof (1984, 1996; Groenendijk 1999) provide a logical...
research
10/10/2018

The Andoni--Krauthgamer--Razenshteyn characterization of sketchable norms fails for sketchable metrics

Andoni, Krauthgamer and Razenshteyn (AKR) proved (STOC 2015) that a fini...
research
10/29/2022

Two is Better than Many? Binary Classification as an Effective Approach to Multi-Choice Question Answering

We propose a simple refactoring of multi-choice question answering (MCQA...
research
05/23/2018

A logical representation of Arabic questions toward automatic passage extraction from the Web

With the expanding growth of Arabic electronic data on the web, extracti...
research
09/10/2017

Abductive Matching in Question Answering

We study question-answering over semi-structured data. We introduce a ne...
research
03/16/2023

Secret-Keeping in Question Answering

Existing question-answering research focuses on unanswerable questions i...

Please sign up or login with your details

Forgot password? Click here to reset