Results 1  10
of
15
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.
Minimal Recursion Semantics as Dominance Constraints: Translation, Evaluation, and Analysis. ACL04
, 2004
"... We show that a practical translation of MRS descriptions into normal dominance constraints is feasible. We start from a recent theoretical translation and verify its assumptions on the outputs of the English Resource Grammar (ERG) on the Redwoods corpus. The main assumption of the translation— th ..."
Abstract

Cited by 19 (4 self)
 Add to MetaCart
(Show Context)
We show that a practical translation of MRS descriptions into normal dominance constraints is feasible. We start from a recent theoretical translation and verify its assumptions on the outputs of the English Resource Grammar (ERG) on the Redwoods corpus. The main assumption of the translation— that all relevant underspecified descriptions are nets—is validated for a large majority of cases; all nonnets computed by the ERG seem to be systematically incomplete. 1
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 9 (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.
An Efficient Enumeration Algorithm for Canonical Form Underspecified Semantic Representations
"... Abstract. We give polynomialtime algorithms for satisfiability and enumeration of underspecified semantic representations in a canonical form. This canonical form brings several underspecification formalisms together into a uniform framework (Manshadi et al., 2008), so the algorithms can be applied ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. We give polynomialtime algorithms for satisfiability and enumeration of underspecified semantic representations in a canonical form. This canonical form brings several underspecification formalisms together into a uniform framework (Manshadi et al., 2008), so the algorithms can be applied to any underspecified representation that can be converted to this form. In particular, our algorithm can be applied to Canonical Form Minimal Recursion Semantics (CFMRS). An efficient satisfiability and enumeration algorithm has been found for a subset of MRS (Niehren and Thater, 2003). This subset, however, is not broad enough to cover all the meaningful MRS structures occurring in practice. CFMRS, on the other hand, provably covers all MRS structures generated by the MRS semantic composition process.
Bridging the Gap Between Underspecification Formalisms: Minimal Recursion Semantics as . . .
"... Minimal Recursion Semantics (MRS) is the standard formalism used in largescale HPSG grammars to model underspecified semantics. We present the first provably efficient algorithm to enumerate the readings of MRS structures. It is obtained by translating MRS into normal dominance constraints f ..."
Abstract
 Add to MetaCart
Minimal Recursion Semantics (MRS) is the standard formalism used in largescale HPSG grammars to model underspecified semantics. We present the first provably efficient algorithm to enumerate the readings of MRS structures. It is obtained by translating MRS into normal dominance constraints for which efficient algorithms exist.
unknown title
"... The evolution of dominance constraint solvers We describe the evolution of solvers for dominance constraints, a formalism used in underspecified semantics, and present a new graphbased solver using charts. An evaluation on realworld data shows that each solver (including the new one) is significan ..."
Abstract
 Add to MetaCart
(Show Context)
The evolution of dominance constraint solvers We describe the evolution of solvers for dominance constraints, a formalism used in underspecified semantics, and present a new graphbased solver using charts. An evaluation on realworld data shows that each solver (including the new one) is significantly faster than its predecessors. We believe that our strategy of successively tailoring a powerful formalism to the actual inputs is more generally applicable. 1
unknown title
"... The evolution of dominance constraint solvers We describe the evolution of solvers for dominance constraints, a formalism used in underspecified semantics, and present a new graphbased solver using charts. An evaluation on realworld data shows that each solver (including the new one) is significan ..."
Abstract
 Add to MetaCart
(Show Context)
The evolution of dominance constraint solvers We describe the evolution of solvers for dominance constraints, a formalism used in underspecified semantics, and present a new graphbased solver using charts. An evaluation on realworld data shows that each solver (including the new one) is significantly faster than its predecessors. We believe that our strategy of successively tailoring a powerful formalism to the actual inputs is more generally applicable. 1
1 Solving Unrestricted Dominance Graphs
, 2007
"... We present the first ever algorithm for solving unrestricted dominance graphs. The algorithm extends existing polynomial solvers for restricted classes of dominance graphs, which are not sufficient to model newer theories of scope ambiguity. Using the new solver, these theories now have access to an ..."
Abstract
 Add to MetaCart
(Show Context)
We present the first ever algorithm for solving unrestricted dominance graphs. The algorithm extends existing polynomial solvers for restricted classes of dominance graphs, which are not sufficient to model newer theories of scope ambiguity. Using the new solver, these theories now have access to an efficient solver for the first time. The solver runs in cubic time; for those graph classes that could be solved in the past, the runtime is reduced to the same quadratic time that the most efficient previous solvers achieved. 1.1