Resolving Relative Time Expressions in Dutch Text with Constraint Handling Rules [chapter]

Matje van de Camp, Henning Christiansen
2013 Lecture Notes in Computer Science  
We discuss the semantics of NL coordination in modern type theories (MTTs) with coercive subtyping. The issue of conjoinable types is handled by means of a type universe of linguistic types. We discuss quantifier coordination, arguing that they should be allowed in principle and that the semantic infelicity of some cases of quantifier coordination is due to the incompatible semantics of the relevant quantifiers. Non-Boolean collective readings of conjunction are also discussed and, in
more » ... , treated as involving the vectors of type V ec(A, n), an inductive family of types in an MTT. Lastly, the interaction between coordination and copredication is briefly discussed, showing that the proposed account of coordination and that of copredication by means of dot-types combine consistently as expected. This work is supported by the research grant F/07-537/AJ of the Leverhulme Trust in the U.K. 3 Examples of modern type theories include Martin-Löf's type theory [21, 26], the Unifying Theory of dependent Types (UTT) [15] and the type theory implemented in the Coq proof assistant (pCIC) [7]. Abstract Constraint-based approaches to pragmatics have customarily focused on the hearer, and aim to identify the optimal interpretation of utterances. Blutner (2006 i.a.) has argued that it is necessary also to consider the role of the speaker, and thus motivates a bidirectional Optimality Theory (OT) pragmatics. However, as he notes, this may have limited explanatory potential from a processing standpoint. A recent account, focusing on expressions of quantity, proposes instead to model the speaker's choice of expression by unidirectional OT. In this paper I discuss the merits of this versus the bidirectional account, and in particular explore the implications for the hearer, who is required to solve the problem of utterance interpretation by different means in the two models. I consider the predictions arising from the unidirectional account, with reference to interpretation and processing, and discuss its theoretical implications for pragmatics in general. grammar Abstract. We introduce a method for data-driven learning of lexical entries in an inherently incremental semantic grammar formalism, Dynamic Syntax (DS). Lexical actions in DS are constrained procedures for the incremental projection of compositional semantic structure. Here, we show how these can be induced directly from sentences paired with their complete propositional semantic structures. Checking induced entries over an artificial dataset generated using a known grammar demonstrates that the method learns lexical entries compatible with those defined by linguists, with different versions of the DS framework induced by varying only general tree manipulation rules. This is achieved without requiring annotation at the level of individual words, via a method compatible with work on linguistic change and routinisation. Abstract. We present a formal model for natural language semantics using Type Theory with Records (TTR) and argue that it is better suited for representing the meaning of spatial descriptions than traditional formal semantic models. Spatial descriptions include perceptual, conceptual and discourse knowledge which we represent all in a single framework. Being a computational framework TTR is suited for modelling language and cognition of conversational agents in robotics and virtual environments where interoperability between language, action and perception is required. The perceptual systems gain access to abstract conceptual meaning representations of language while the latter can be justified in action and perception. Abstract. This paper aims to show metagrammars are not only suited for large grammars development, but can also deal with other types of descriptions. We give the example of musical chords, that can be quite naturally described within the modular scope offered by eXtensible Meta-Grammar. Abstract. We present in this paper a technique aiming at estimating constraint weights from treebanks. After a presentation of constraint-based treebank acquisition, a method assigning weights to individual constraint is proposed. An experiment by means of human acceptability judgments gives a first validation of the approach.
doi:10.1007/978-3-642-41578-4_10 fatcat:rvzj2l4fnvg77aepokghncuhui