Switch to: References

Citations of:

Order-independence and Underspecification

In Hans Kamp & Barbara Hall Partee (eds.), Context-Dependence in the Analysis of Linguistic Meaning. Elsevier. pp. 11--239 (2004)

Add citations

You must login to add citations.
  1. Talking About Trees and Truth-Conditions.Reinhard Muskens - 2001 - Journal of Logic, Language and Information 10 (4):417-455.
    We present Logical Description Grammar (LDG), a model ofgrammar and the syntax-semantics interface based on descriptions inelementary logic. A description may simultaneously describe the syntacticstructure and the semantics of a natural language expression, i.e., thedescribing logic talks about the trees and about the truth-conditionsof the language described. Logical Description Grammars offer a naturalway of dealing with underspecification in natural language syntax andsemantics. If a logical description (up to isomorphism) has exactly onetree plus truth-conditions as a model, it completely specifies thatgrammatical (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Construction by Description in Discourse Representation.Noor van Leusen & Reinhard Muskens - 2003 - In Jaroslav Peregrin (ed.), Meaning: The Dynamic Turn. Elsevier. pp. 33-65.
    This paper uses classical logic for a simultaneous description of the syntax and semantics of a fragment of English and it is argued that such an approach to natural language allows procedural aspects of linguistic theory to get a purely declarative formulation. In particular, it will be shown how certain construction rules in Discourse Representation Theory, such as the rule that indefinites create new discourse referents and definites pick up an existing referent, can be formulated declaratively if logic is used (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Underspecified Semantics.Reinhard Muskens - 2000 - In Klaus von Heusinger & Urs Egli (eds.), Reference and Anaphoric Relations. Kluwer Academic Publishers. pp. 311--338.
    Ambiguities in natural language can multiply so fast that no person or machine can be expected to process a text of even moderate length by enumerating all possible disambiguations. A sentence containing $n$ scope bearing elements which are freely permutable will have $n!$ readings, if there are no other, say lexical or syntactic, sources of ambiguity. A series of $m$ such sentences would lead to $(n!)^m$ possibilities. All in all the growth of possibilities will be so fast that generating readings (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Computational Semantics.Patrick Blackburn & Johan Bos - 2003 - Theoria 18 (1):27-45.
    In this article we discuss what constitutes a good choice of semantic representation, compare different approaches of constructing semantic representations for fragments of natural language, and give an overview of recent methods for employing inference engines for natural language understanding tasks.
    Download  
     
    Export citation  
     
    Bookmark  
  • Description Theory, LTAGs and Underspecified Semantics.Reinhard Muskens & Emiel Krahmer - 1998 - In Anne AbeillĂ©, Tilman Becker, Giorgio Satta & K. Vijay-Shanker (eds.), Fourth International Workshop on Tree Adjoining Grammars and Related Frameworks. Philadelphia, PA: Institute for Research in Cognitive Science. pp. 112-115.
    An attractive way to model the relation between an underspecified syntactic representation and its completions is to let the underspecified representation correspond to a logical description and the completions to the models of that description. This approach, which underlies the Description Theory of Marcus et al. 1983 has been integrated in Vijay-Shanker 1992 with a pure unification approach to Lexicalized Tree-Adjoining Grammars (Joshi et al. 1975, Schabes 1990). We generalize Description Theory by integrating semantic information, that is, we propose to (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • The Constraint Language for Lambda Structures.Markus Egg, Alexander Koller & Joachim Niehren - 2001 - Journal of Logic, Language and Information 10 (4):457-485.
    This paper presents the Constraint Language for Lambda Structures(CLLS), a first-order language for semantic underspecification thatconservatively extends dominance constraints. It is interpreted overlambda structures, tree-like structures that encode -terms. Based onCLLS, we present an underspecified, uniform analysis of scope,ellipsis, anaphora, and their interactions. CLLS solves a variablecapturing problem that is omnipresent in scope underspecification andcan be processed efficiently.
    Download  
     
    Export citation  
     
    Bookmark   11 citations