Name
Title | ||
|---|---|---|
Bridging the gap between underspecification formalisms: minimal recursion semantics as dominance constraints |
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.3115/1075096.1075143 | ACL |
Keywords | Field | DocType |
provably efficient algorithm,minimal recursion semantics,underspecification formalisms,normal dominance constraint,mrs structure,underspecified semantics,standard formalism,large-scale hpsg grammar,formalisms | Head-driven phrase structure grammar,Rule-based machine translation,Underspecification,Computer science,Bridging (networking),Theoretical computer science,Minimal recursion semantics,Formalism (philosophy),Rotation formalisms in three dimensions,Semantics | Conference |
Volume | Citations | PageRank |
P03-1 | 10 | 0.72 |
References | Authors | |
7 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Joachim Niehren | 1 | 971 | 66.53 |
| Stefan Thater | 2 | 756 | 38.54 |