Results 1  10
of
43
The tree constraint
 In Barták and Milano [2005
"... www.it.uu.se/research/group/astra ..."
(Show Context)
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 22 (9 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.
A New Algorithm for Normal Dominance Constraints
 In Proc. SODA
, 2003
"... this paper, we propose a novel graph algorithm relying on graph connectivity, and inspired by [3]. It can enumerate all solved forms of a normal dominance constraint 2 ) per solved form, and thereby improves on the best previously known algorithm in e#ciency. # Humboldt Universitat zu Berlin, Germa ..."
Abstract

Cited by 16 (5 self)
 Add to MetaCart
(Show Context)
this paper, we propose a novel graph algorithm relying on graph connectivity, and inspired by [3]. It can enumerate all solved forms of a normal dominance constraint 2 ) per solved form, and thereby improves on the best previously known algorithm in e#ciency. # Humboldt Universitat zu Berlin, Germany + LORIA, Nancy, France # INRIA team Mostrare, Universite de Lille, France Universitat des Saarlandes, Germany Subquadratic running time can be achieved employing decremental graph biconnectivity algorithms
Combining tree partitioning, precedence, incomparability, and degree constraints, with an application to phylogenetic and orderedpath problems
, 2006
"... Abstract. The tree and path constraints, for digraph partitioning by vertexdisjoint trees and paths respectively, are unified within a single global constraint, including a uniform treatment of a variety of useful side constraints, such as precedence, incomparability, and degree constraints. The app ..."
Abstract

Cited by 16 (5 self)
 Add to MetaCart
(Show Context)
Abstract. The tree and path constraints, for digraph partitioning by vertexdisjoint trees and paths respectively, are unified within a single global constraint, including a uniform treatment of a variety of useful side constraints, such as precedence, incomparability, and degree constraints. The approach provides a sharp improvement over an existing path constraint, but can also efficiently handle tree problems, such as the phylogenetic supertree construction problem. The key point of the filtering is to take partially into account the strong interactions between the tree partitioning problem and all the side constraints. 1
An Efficient Algorithm for Weakly Normal Dominance Constraints
 In ACMSIAM Symposium on Discrete Algorithms
, 2004
"... Dominance constraints are logical descriptions of trees. E cient algorithms for the subclass of normal dominance constraints were proposed recently. We present a new and simpler graph algorithm which solves more expressive weakly normal dominance constraints. We thereby improve on the best prev ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
(Show Context)
Dominance constraints are logical descriptions of trees. E cient algorithms for the subclass of normal dominance constraints were proposed recently. We present a new and simpler graph algorithm which solves more expressive weakly normal dominance constraints. We thereby improve on the best previously known algorithm for normal dominance constraints in eciency, coverage, and applicability.
Efficient solving and exploration of scope ambiguities
 IN PROCEEDINGS OF THE ACL05 DEMO SESSION
, 2005
"... We present the currently most efficient solver for scope underspecification; it also converts between different underspecification formalisms and counts readings. Our tool makes the practical use of largescale grammars with (underspecified) semantic output more feasible, and can be used in grammar ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
(Show Context)
We present the currently most efficient solver for scope underspecification; it also converts between different underspecification formalisms and counts readings. Our tool makes the practical use of largescale grammars with (underspecified) semantic output more feasible, and can be used in grammar debugging.
Regular tree grammars as a formalism for scope underspecification
"... We propose the use of regular tree grammars (RTGs) as a formalism for the underspecified processing of scope ambiguities. By applying standard results on RTGs, we obtain a novel algorithm for eliminating equivalent readings and the first efficient algorithm for computing the best reading of a scope ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
(Show Context)
We propose the use of regular tree grammars (RTGs) as a formalism for the underspecified processing of scope ambiguities. By applying standard results on RTGs, we obtain a novel algorithm for eliminating equivalent readings and the first efficient algorithm for computing the best reading of a scope ambiguity. We also show how to derive RTGs from more traditional underspecified descriptions.
On the computational complexity of dominance links in grammatical formalisms
 In ACL
, 2010
"... Dominance links were introduced in grammars to model long distance scrambling phenomena, motivating the definition of multisetvalued linear indexed grammars (MLIGs) by Rambow (1994b), and inspiring quite a few recent formalisms. It turns out that MLIGs have since been rediscovered and reused in a v ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
(Show Context)
Dominance links were introduced in grammars to model long distance scrambling phenomena, motivating the definition of multisetvalued linear indexed grammars (MLIGs) by Rambow (1994b), and inspiring quite a few recent formalisms. It turns out that MLIGs have since been rediscovered and reused in a variety of contexts, and that the complexity of their emptiness problem has become the key to several open questions in computer science. We survey complexity results and open issues on MLIGs and related formalisms, and provide new complexity bounds for some linguistically motivated restrictions. 1
An Improved Redundancy Elimination Algorithm for Underspecified Representations
"... We present an efficient algorithm for the redundancy elimination problem: Given an underspecified semantic representation (USR) of a scope ambiguity, compute an USR with fewer mutually equivalent readings. The algorithm operates on underspecified chart representations which are derived from dominanc ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
(Show Context)
We present an efficient algorithm for the redundancy elimination problem: Given an underspecified semantic representation (USR) of a scope ambiguity, compute an USR with fewer mutually equivalent readings. The algorithm operates on underspecified chart representations which are derived from dominance graphs; it can be applied to the USRs computed by largescale grammars. We evaluate the algorithm on a corpus, and show that it reduces the degree of ambiguity significantly while taking negligible runtime.
WellNested Parallelism Constraints for Ellipsis Resolution
 IN 11TH CONFERENCE OF THE EUROPEAN CHAPTER OF THE ASSOCIATION OF COMPUTATIONAL LINGUISTICS
, 2003
"... The Constraint Language for Lambda Structures (CLLS) is an expressive tree description language. It provides a uniform framework for underspecified semantics, covering scope, ellipsis, and anaphora. Efficient algorithms exist for the sublanguage that models scope. But so far no terminating al ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
(Show Context)
The Constraint Language for Lambda Structures (CLLS) is an expressive tree description language. It provides a uniform framework for underspecified semantics, covering scope, ellipsis, and anaphora. Efficient algorithms exist for the sublanguage that models scope. But so far no terminating algorithm exists for sublanguages that model ellipsis. We introduce wellnested parallelism constraints and show that they solve this problem.