Results 1  10
of
156
The Constraint Language for Lambda Structures
, 2000
"... This paper presents the Constraint Language for Lambda Structures (CLLS), a firstorder language for semantic underspecification that conservatively extends dominance constraints. It is interpreted over lambda structures, treelike structures that encode terms. Based on CLLS, we present an underspe ..."
Abstract

Cited by 97 (34 self)
 Add to MetaCart
This paper presents the Constraint Language for Lambda Structures (CLLS), a firstorder language for semantic underspecification that conservatively extends dominance constraints. It is interpreted over lambda structures, treelike structures that encode terms. Based on CLLS, we present an underspecified, uniform analysis of scope, ellipsis, anaphora, and their interactions. CLLS solves a variable capturing problem that is omnipresent in scope underspecification and can be processed efficiently.
On Semantic Underspecification
, 1999
"... . 1 Another important source for the interest in underspecification is lexical semantics. Example (2) is a representative for a large field of ambiguity phenomena, which are conventionally classified as lexical ambiguities, but differ from trivial cases like the homonyms bank or pen in several imp ..."
Abstract

Cited by 70 (2 self)
 Add to MetaCart
. 1 Another important source for the interest in underspecification is lexical semantics. Example (2) is a representative for a large field of ambiguity phenomena, which are conventionally classified as lexical ambiguities, but differ from trivial cases like the homonyms bank or pen in several important ways. 1 Earlier, but less influential research on underspecification was performed in the phliqa project at Philips Research Labs, where it seems that the concept of `metavariables' was actually discovered; see e.g. Bronnenberg et al. (1979); Landsbergen & Scha (1979); Bunt (1984; 1985). boekpinkal.tex; 27/08/1999; 13:09; p.1 33 H. Bunt and R. Muskens (eds.) Computing Meaning. Kluwer Academic Press, Dordrecht 1999, 3355.. 34 MANFRED PINKAL (2) John began the book Rather than locating the source of ambiguity of sentence (2) in the verb b
Factoring predicate argument and scope semantics: Underspecified semantics with LTAG
 12th Amsterdam Colloquium. Proceedings
, 1999
"... Abstract. In this paper we propose a compositional semantics for lexicalized treeadjoining grammar (LTAG). Treelocal multicomponent derivations allow separation of the semantic contribution of a lexical item into one component contributing to the predicate argument structure and a second component ..."
Abstract

Cited by 59 (13 self)
 Add to MetaCart
(Show Context)
Abstract. In this paper we propose a compositional semantics for lexicalized treeadjoining grammar (LTAG). Treelocal multicomponent derivations allow separation of the semantic contribution of a lexical item into one component contributing to the predicate argument structure and a second component contributing to scope semantics. Based on this idea a syntaxsemantics interface is presented where the compositional semantics depends only on the derivation structure. It is shown that the derivation structure (and indirectly the locality of derivations) allows an appropriate amount of underspecification. This is illustrated by investigating underspecified representations for quantifier scope ambiguities and related phenomena such as adjunct scope and island constraints. Key words: computational semantics, lexicalized treeadjoining grammar, quantifier scope, underspecification 1.
Generating Copies: An investigation into structural identity in language and grammar
, 2006
"... ..."
An Efficient Graph Algorithm for Dominance Constraints
 JOURNAL OF ALGORITHMS
, 2003
"... Dominance constraints are logical descriptions of trees that are widely used in computational linguistics. Their general satisfiability problem is known to be NPcomplete. Here we identify normal dominance constraints and present an efficient graph algorithm for testing their satisfiablity in dete ..."
Abstract

Cited by 41 (17 self)
 Add to MetaCart
(Show Context)
Dominance constraints are logical descriptions of trees that are widely used in computational linguistics. Their general satisfiability problem is known to be NPcomplete. Here we identify normal dominance constraints and present an efficient graph algorithm for testing their satisfiablity in deterministic polynomial time. Previously, no polynomial time algorithm was known.
Constraints over lambdastructures in semantic underspecification
 In Proc. of COLING/ACL
, 1998
"... niehren0ps, unisb, de We introduce a firstorder language for semantic underspecification that we call Constraint Language for LambdaStructures (CLLS). A Astructure can be considered as a Aterm up to consistent renaming of bound variables (aequality); a constraint of CLLS is an underspecified ..."
Abstract

Cited by 40 (15 self)
 Add to MetaCart
niehren0ps, unisb, de We introduce a firstorder language for semantic underspecification that we call Constraint Language for LambdaStructures (CLLS). A Astructure can be considered as a Aterm up to consistent renaming of bound variables (aequality); a constraint of CLLS is an underspecified description of a Astructure. CLLS solves a capturing problem omnipresent in underspecified scope representations. CLLS features constraints for dominance, lambda binding, parallelism, and anaphoric links. Based on CLLS we present a simple, integrated, amt underspecified treatment of scope, parallelism, and anaphora. 1
Dominance Constraints: Algorithms and Complexity
 IN PROCEEDINGS OF THE THIRD CONFERENCE ON LOGICAL ASPECTS OF COMPUTATIONAL LINGUISTICS
, 1998
"... Dominance constraints for finite tree structures are widely used in several areas of computational linguistics including syntax, semantics, and discourse. In this paper, we investigate algorithmic and complexity questions for dominance constraints and their firstorder theory. We present two NP algo ..."
Abstract

Cited by 39 (20 self)
 Add to MetaCart
Dominance constraints for finite tree structures are widely used in several areas of computational linguistics including syntax, semantics, and discourse. In this paper, we investigate algorithmic and complexity questions for dominance constraints and their firstorder theory. We present two NP algorithms for solving dominance constraints, which have been implemented in the concurrent constraint programming language Oz. The main result of this paper is that the satisfiability problem of dominance constraints is NPcomplete. Despite this intractability result, the more sophisticated of our algorithms performs well in an application to scope underspecification. We also show that the existential fragment of the firstorder theory of dominance constraints is NPcomplete and that the full firstorder theory has nonelementary complexity.
Basic Concepts of Lexical Resource Semantics
 THE SERIES OF THE KURT GÖDEL SOCIETY
, 2003
"... ..."
Som å kappete med trollet?  Towards MRSBased NorwegianEnglish Machine Translation
 In Proceedings of the 10th International Conference on Theoretical and Methodological Issues in Machine Translation
, 2004
"... We present a relatively largescale initiative in highquality MT based on semantic transfer, reviewing the motivation for this approach, general architecture and components involved, and preliminary experience from a first round of system integration (to be accompanied by a handson system demon ..."
Abstract

Cited by 28 (14 self)
 Add to MetaCart
(Show Context)
We present a relatively largescale initiative in highquality MT based on semantic transfer, reviewing the motivation for this approach, general architecture and components involved, and preliminary experience from a first round of system integration (to be accompanied by a handson system demonstration, if appropriate).
Bridging the Gap Between Underspecification Formalisms: Hole Semantics as Dominance Constraints
 In Proceedings of the 11th EACL
, 2003
"... We define a backandforth translation between Hole Semantics and dominance constraints, two formalisms used in underspecified semantics. There are fundamental differences between the two, but we show that they disappear on practically useful descriptions. Our encoding bridges a gap between t ..."
Abstract

Cited by 25 (10 self)
 Add to MetaCart
(Show Context)
We define a backandforth translation between Hole Semantics and dominance constraints, two formalisms used in underspecified semantics. There are fundamental differences between the two, but we show that they disappear on practically useful descriptions. Our encoding bridges a gap between two underspecification formalisms, and speeds up the processing of Hole Semantics.