tailieunhanh - Báo cáo khoa học: "A Logic of Semantic Representations for Shallow Parsing"

One way to construct semantic representations in a robust manner is to enhance shallow language processors with semantic components. Here, we provide a model theory for a semantic formalism that is designed for this, namely Robust Minimal Recursion Semantics (RMRS). We show that RMRS supports a notion of entailment that allows it to form the basis for comparing the semantic output of different parses of varying depth. | A Logic of Semantic Representations for Shallow Parsing Alexander Koller Saarland University Saarbrucken Germany koller@ Alex Lascarides University of Edinburgh Edinburgh UK alex@ Abstract One way to construct semantic representations in a robust manner is to enhance shallow language processors with semantic components. Here we provide a model theory for a semantic formalism that is designed for this namely Robust Minimal Recursion Semantics RMRS . We show that RMRS supports a notion of entailment that allows it to form the basis for comparing the semantic output of different parses of varying depth. 1 Introduction Representing semantics as a logical form that supports automated inference and model construction is vital for deeper language engineering tasks such as dialogue systems. Logical forms can be obtained from hand-crafted deep grammars Butt et al. 1999 Copestake and Flickinger 2000 but this lacks robustness not all words and constructions are covered and by design ill-formed phrases fail to parse. There has thus been a trend recently towards robust wide-coverage semantic construction . Bos et al. 2004 Zettlemoyer and Collins 2007 . But there are certain semantic phenomena that these robust approaches don t capture reliably including quantifier scope optional arguments and long-distance dependencies for instance Clark et al. 2004 report that the parser used by Bos et al. 2004 yields 63 accuracy on object extraction . the man that I met. . Forcing a robust parser to make a decision about these phenomena can therefore be error-prone. Depending on the application it may be preferable to give the parser the option to leave a semantic decision open when it s not sufficiently informed . to compute a partial semantic representation and to complete it later using information extraneous to the parser. In this paper we focus on an approach to semantic representation that supports this strategy Robust Minimal Recursion Semantics

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.