Adjustment of goal-driven resolution for natural language processing in TIL

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F19%3A10243177" target="_blank" >RIV/61989100:27240/19:10243177 - isvavai.cz</a>

Result on the web

<a href="https://nlp.fi.muni.cz/raslan/raslan19.pdf" target="_blank" >https://nlp.fi.muni.cz/raslan/raslan19.pdf</a>

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Adjustment of goal-driven resolution for natural language processing in TIL

Original language description

The paper deals with natural language reasoning and question answering. Having a fine-grained analysis of natural language sentences in the form of TIL (Transparent Intensional Logic) constructions, we apply the General Resolution Method (GRM) with its goal-driven strategy to answer the question (goal) raised on the natural language data. Not only that, we want to answer in an &apos;intelligent&apos; way, so that to provide logical consequences entailed by the data. From this point of view, GRM appears to be one of the most plausible proof techniques. There are two main new results presented here. First, we found out that it is not always possible to apply all the necessary adjustments of the input constructions first, and then to go on in a standard way by applying the algorithm of the transformation of propositional constructions into the Skolem clausal form followed by the GRM goal-driven resolution techniques. There are plenty of features special for the rich natural language semantics that are dealt with by TIL technical rules and these rules must be integrated with the process of the goal-driven resolution technique rather than separated from it. Second, the strategy of generating resolvents from a given knowledge base cannot be strictly goal-driven. Though we start with a given goal/question, it may happen that there is a point at which we have to make a step aside. We have to apply those special TIL technical rules on another clause first, and only then it is possible to go on with the process of resolving clauses with a given goal. Otherwise our inference machine would be heavily underinferring, which is not desirable, of course. We demonstrate these new results by two simple examples. The first one deals with property modifiers and anaphoric references. Anaphoric references are dealt with by our substitution method, and the second example demonstrates reasoning with factive verbs like &apos;knowing&apos; together with definite descriptions and anaphoric references again. Since the definite description occurs de re here, we substitute a pointer to the individual referred to for the respective anaphoric pronoun.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

—

OECD FORD branch

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project

Result was created during the realization of more than one project. More information in the Projects tab.

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Publication year

2019

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

Thirteenth workshop on Recent Advances in Slavonic Natural Language Processing, RASLAN 2019 : Karlova Studánka, Czech Republic, December 6-8, 2019 : proceedings

ISBN

978-80-263-1530-8

ISSN

2336-4289

e-ISSN

—

Number of pages

12

Pages from-to

71-82

Publisher name

Tribun EU

Place of publication

Brno

Event location

Karlova Studánka

Event date

Dec 6, 2019

Type of event by nationality

EUR - Evropská akce

UT code for WoS article

000604899800009