Abstract
In this paper, logical form representations for pronouns, singular definite noun phrases (NPs), and singular indefinite NPs are developed. These representations allow decisions about the precise meaning of a sentence to be postponed until the required information becomes available. Three computational constraints for this logical form are proposed: compactness, modularity, and formal consistency. Initially, NPs are represented using a composite representation for all allowable meanings, conforming with the compactness constraint. This representation is provided using only syntactic and sentence level information, consistent with the modularity constraint. When an ambiguity can be resolved, the precise behavior is specified in a way compatible with the initial representation, conforming with the formal consistency constraint. The scope of this approach is demonstrated by using a wide variety of examples, and a computer implementation is described. Related approaches are also discussed.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
