- Submit
-
Browse
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- More
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.
|
|
|
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 (...) |
|
|
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. |
|
|
|
|
|
We define and prove a formal semantics divided into two complementary interacting components: the strictly linguistic semantics, we call linguistic agent, and the strictly logical and referential semantics, we call rational agent. This Linguistic \ Rational Agents’ Semantics applies to Deep Dependency trees or more generally, to discourses, i.e. sequences of DD-trees, and interprets them by functional structures we call Meaning Representation Structures, similar to the DRT, but interpreted very differently. LRA semantics incrementally interprets the discourses by minimal finite models, (...) |
|
|
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. |
|
|
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 (...) |
|
|
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 (...) |
|
|
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 (...) |
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-6d9b7f7c4c-v4fj8 uwo