Ambiguous noun phrases in logical form
Mary P. Harper · 1992
In this paper, we describe how to represent pronouns, singular definite noun phrases, and singular indefinite noun phrases in logical form given their parse trees, while obeying our computational constraints. Initially, the noun phrases are represented using a composite representation for their possible meanings, in keeping with the compactness constraint. The initial representation is specified using only syntactic and sentence level information, obeying our modularity constraint. Finally, when ambiguity is resolved, the precise behavior of the noun phrases is pinpointed in a way compatible with the initial representation in order to obey the formal consistency constraint. 1 Introduction A goal of natural language research is to provide a computer model capable of understanding English sentences. This model must be able to generate an unambiguous internal representation for each sentence processed. The building of this representation can be approached in two different ways. The first...