Bridging the gap between underspecification formalisms: Minimal recursion semantics as dominance constraints

被引：0

作者：

Niehren, J ^{[1
]}

Thater, S ^{[1
]}

机构：

[1] Univ Saarland, Programming Syst Lab, D-6600 Saarbrucken, Germany

来源：

41ST ANNUAL MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS, PROCEEDINGS OF THE CONFERENCE | 2003年

关键词：

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

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.

引用

页码：367 / 374

页数：8