A hyperintensional theory of intelligent question answering in TIL

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F21%3A10246702" target="_blank" >RIV/61989100:27240/21:10246702 - isvavai.cz</a>

Result on the web

<a href="https://www.semanticscholar.org/paper/A-Hyperintensional-Theory-of-Intelligent-Question-Duz%C3%AD-Fait/5e782e85b644979d3279bc4ecc229cd129c6912c" target="_blank" >https://www.semanticscholar.org/paper/A-Hyperintensional-Theory-of-Intelligent-Question-Duz%C3%AD-Fait/5e782e85b644979d3279bc4ecc229cd129c6912c</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-030-63787-3_3" target="_blank" >10.1007/978-3-030-63787-3_3</a>

Result language

angličtina

Original language name

A hyperintensional theory of intelligent question answering in TIL

Original language description

The paper deals with natural language processing and question answering over large corpora of formalised natural language texts. Our background theory is the system of Transparent Intensional Logic (TIL) which is a partial, hyperintensional, typed lambda-calculus. Having a fine-grained analysis of natural language sentences in the form of TIL constructions, we apply Gentzen&apos;s system of natural deduction adjusted for TIL to answer questions in an &apos;intelligent&apos; way. It means that our system derives logical consequences entailed by the input sentences rather than merely searching answers by keywords. The theory of question answering must involve special rules rooted in the rich semantics of a natural language, and the TIL system makes it possible to formalise all the semantically salient features of natural languages in a fine-grained way. In particular, since TIL is a logic of partial functions, it is apt for dealing with non-referring terms and sentences with truth-value gaps. It is important because sentences often come attached with a presupposition that must be true so that a given sentence had any truth-value. And since answering is no less important than raising questions,we also propose a method of adequate unambiguous answering questions with presuppositions. In case the presupposition of a question is not true (because either false or &apos;gappy&apos;), there is no unambiguous direct answer, and an adequate complete answer is instead a negated presupposition. There are two novelties; one is the analysis and answering of Wh-questions that transform into lambda-terms referring to alpha-objects where alpha is not the type of a truth-value. The second is integration of special rules rooted in the semantics of natural language into Gentzen&apos;s system of natural deduction, together with a heuristic method of searching relevant sentences in the labyrinth of input text data that is driven by constituents of a given question.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

—

OECD FORD branch

10200 - Computer and information sciences

Project

<a href="/en/project/GA18-23891S" target="_blank" >GA18-23891S: Hyperintensional Reasoning over Natural Language Texts</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2021

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

Studies in Computational Intelligence. Volume 939

ISBN

978-3-030-63786-6

ISSN

1860-949X

e-ISSN

—

Number of pages

36

Pages from-to

69-104

Publisher name

Springer

Place of publication

Cham

Event location

Valletta

Event date

Feb 22, 2020

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

—