Minimal recursion semantics as dominance constraints

Ruth Fuchss · Alexander Koller · Joachim Niehren · Stefan Thater

26 citations0/0 files storedProceedings of the conference - Association for Computational Linguistics. Meeting

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Syntax, Semantics, Linguistic Variation Natural Language Processing Techniques Logic, Reasoning, and Knowledge

Abstract

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 non-nets computed by the ERG seem to be systematically incomplete.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 26 citations exist upstream.

References

2005Minimal Recursion Semantics: An Introduction 2001Implementing typed feature structure grammars 1993Dealing with Ambiguities by Underspecification: Construction, Representation and Deduction 2001An algebra for semantic construction in constraint-based grammars 2001The Constraint Language for Lambda Structures 1992Monotonic semantic interpretation 2006Translation using Minimal Recursion Semantics

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.