Paper: Two Theories For Computing The Logical Form Of Mass Expressions

ACL ID P84-1025
Title Two Theories For Computing The Logical Form Of Mass Expressions
Venue Annual Meeting of the Association of Computational Linguistics
Session Main Conference
Year 1984
Authors

Applying the rules of translation is even simpler. In essence, all that is needed is a mechanism for arranging There are various difficulties in accomodating the traditional logical expressions into larger expressions in conformity with mass/count distinction into a grammar for English which the semantic rules. (For examples of parsers see Thompson has a goal the production of "logical form" semantic translations of the initial English sentences, The present paper surveys some of these difficulties. One puzzle is whether the distinction is a syntactic one or a semantic one, i.e., whether it is a well-formedness constraint or whether it is a description of the semantic translations produced. Another puzzle is whether it should be applied to simple words (as they occur in the lexicon) or whe...