论文信息 - Bridging the Gap Between Underspecification Formalisms: Minimal Recursion Semantics as Dominance Constraints

Bridging the Gap Between Underspecification Formalisms: Minimal Recursion Semantics as Dominance Constraints

Minimal Recursion Semantics (MRS) is the standard formalism used in large-scale HPSG grammars to model underspecified semantics. We present the first provably efficient algorithm to enumerate the readings of MRS structures, by translating them into normal dominance constraints.

Joachim Niehren | Stefan Thater

[1] Kurt Mehlhorn,et al. An efficient graph algorithm for dominance constraints , 2003, J. Algorithms.

[2] Johan Bos,et al. Predicate logic unplugged , 1996 .

[3] Dan Flickinger,et al. Minimal Recursion Semantics: An Introduction , 2005 .

[4] Uwe Reyle,et al. Dealing with Ambiguities by Underspecification: Construction, Representation and Deduction , 1993, J. Semant..

[5] Joachim Niehren,et al. Bridging the gap between underspecification formalisms: hole semantics as dominance constraints , 2002 .

[6] Joachim Niehren,et al. The Constraint Language for Lambda Structures , 2001, J. Log. Lang. Inf..

[7] Joachim Niehren,et al. Dominance Constraints: Algorithms and Complexity , 1998, LACL.

[8] Dan Flickinger,et al. An Open Source Grammar Development Environment and Broad-coverage English Grammar Using HPSG , 2000, LREC.

[9] Alex Lascarides,et al. An Algebra for Semantic Construction in Constraint-based Grammars , 2001, ACL.

[10] Ivan A. Sag,et al. Book Reviews: Head-driven Phrase Structure Grammar and German in Head-driven Phrase-structure Grammar , 1996, CL.

[11] Hiyan Alshawi,et al. Monotonic Semantic Interpretation , 1992, ACL.