tailieunhanh - Báo cáo khoa học: "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. | Bridging the Gap Between Underspecification Formalisms Minimal Recursion Semantics as Dominance Constraints Joachim Niehren Programming Systems Lab Universitat des Saarlandes ni ehren@p Stefan Thater Computational Linguistics Universitat des Saarlandes stth@ 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. 1 Introduction In the past few years there has been considerable activity in the development of formalisms for underspecified semantics Alshawi and Crouch 1992 Reyle 1993 Bos 1996 Copestake etal. 1999 Egg et al. 2001 . The common idea is to delay the enumeration of all readings for as long as possible. Instead they work with a compact underspecified representation readings are enumerated from this representation by need. Minimal Recursion Semantics MRS Copestake et al. 1999 is the standard formalism for semantic underspecification used in large-scale HPSG grammars Pollard and Sag 1994 Copestake and Flickinger . Despite this clear relevance the most obvious questions about MRS are still open 1. Is it possible to enumerate the readings of MRS structures efficiently No algorithm has been published so far. Existing implementations seem to be practical even though the problem whether an MRS has a reading is NP-complete Althaus et al. 2003 Theorem . 2. What is the precise relationship to other underspecification formalism Are all of them the same or else what are the differences We distinguish the sublanguages of MRS nets and normal dominance nets and show that they can be intertranslated. This translation answers the first question existing constraint solvers for normal dominance constraints can be used to enumerate the readings of MRS nets in low polynomial time. The translation also answers the second .

TỪ KHÓA LIÊN QUAN
crossorigin="anonymous">
Đã phát hiện trình chặn quảng cáo AdBlock
Trang web này phụ thuộc vào doanh thu từ số lần hiển thị quảng cáo để tồn tại. Vui lòng tắt trình chặn quảng cáo của bạn hoặc tạm dừng tính năng chặn quảng cáo cho trang web này.