• Aucun résultat trouvé

Recognizing Textual Entailment, QA4MRE, and Machine Reading

N/A
N/A
Protected

Academic year: 2022

Partager "Recognizing Textual Entailment, QA4MRE, and Machine Reading"

Copied!
1
0
0

Texte intégral

(1)

Recognizing Textual Entailment, QA4MRE, and Machine Reading

Peter Clark

Vulcan Inc. Seattle, WA, 98104, USA peterc@vulcan.com

Abstract

Machine Reading remains one of the Grand Challenges of Artificial Intelligence, and also one of the most difficult. Machine Reading requires more than just parsing a text;

it requires constructing a coherent internal model of the world which that text is describing, including inferring facts that are implicit in the text. One basic operation required for this is to infer or recognize Textual Entailment (TE), i.e., recognize plausible implications of a fragment of text. In this talk I will discuss the overall goal of Machine Reading, and the role of Recognizing Textual Entailment (RTE) within it.

I will describe how we modified an RTE system for the QA4MRE challenge, and illustrate where it worked, where it failed but could be fixed, and where it has fundamental limitations. I will then turn to the larger task of Machine Reading in the context of QA4MRE, and discuss two major challenges it elicits, namely the requirement for knowledge, and the requirement for evidential reasoning. Finally I will offer some reflections on how these might be addressed, with the aim of moving from sentence-matching strategies towards model-building strategies, and ultimately towards machines that can read.

Références

Documents relatifs

Our system for the CLEF Question Answering for Machine Reading Evaluation (QA4MRE) this year is based on these two principles, devising a number of features that provide useful

The Entrance Exams task at CLEF 2013 QA4MRE is focused on solv- ing Reading Comprehension tests of English examinations.. Reading Comprehension tests are routinely used to assess

This report describes the task Machine reading of biomedical texts about Alzheimer’s disease, which is a pilot task of the Question An- swering for Machine Reading Evaluation

While not all question types require inference based on the background collection, all of them required some form of textual and linguistic knowledge, such as the ability to

The exercise Processing modality and negation is defined as an annotation task in which systems have to determine whether an event mentioned in a text is presented as negated,

1 We assume that (the target of) a question or answer is expressed in a single sentence, although the expression of the two together may span multiple sentences... For example we

The rest of the paper is structured as follows: Section 2 details the general architecture of our Question Answering system for Machine Reading Evaluation and the new

Thus, we decided to convert each pair of a question and a potential answer into the best supporting declarative sentence.. In our case this was done manually, but in future