16 Question-answering in English

AI Classics/files/AI/classics/Machine Intelligence 6/MI6-Ch16-IsardLonguetHiggins.pdf 

The problem we consider in this paper is that of discovering formal rules which will enable us to decide when a question posed in English can be answered on the basis of one or more declarative English sentences. To illustrate how this may be done in very simple cases we give rules which translate certain declarative sentences and questions involving the quantifiers'some', 'every', 'any', and'no' into a modified first-order predicate calculus, and answer the questions by comparing their translated forms with those of the declaratives. We suggest that in order to capture the meanings of more complex sentences it will be necessary to go beyond the first-order predicate calculus, to a notation in which the scope of words other than quantifiers and negations is clearly indicated. We conclude by describing a notational form for connected sentences, which seems to be a natural extension of Chomsky's'deep structures'. INTRODUCTION In this paper we shall consider the problem of when an English sentence, or a series of sentences, provides enough information to answer a question, also posed in English.

Similar Docs  Excel Report  more

TitleSimilaritySource
None found