Constraint-Based Semantics

Montague's famous characterization of the homomorphic relation between syntax and semantics naturally gives way in computational applications to CONSTRAINT-BASED formulations. This was originally motivated by the close harmony it provides with syntax, which is universally processed in a constraint-based fashion. Employing the same processing discipline in syntax and semantics allows that their processing (and indeed other processing) can be as tightly coupled as one wishes-indeed, there needn't be any fundamental distinction between them at all. In this paper, we point out several advantages of the constraint-based view of semantics processing over standard views. These include (i) the opportunity to incorporate nonsyntactic constraints on semantics, such as those arising from phonology and context; (ii) the opportunity to formulate principles which generalize over syntax and semantics, such as those found in HEAD-DRIVEN PHRASE STRUCTURE GRAMMAR; (iii) a characterization of semantic ambiguity, which in turn provides a framework in which to describe disambiguation, and (iv) the opportunity to underspecify meanings in a way difficult to reconcile with other views. The last point is illustrated with an application to scope ambiguity in which a scheme is developed which underspecifies scope but eschews auxiliary levels of logical form.