tailieunhanh - Báo cáo khoa học: "Global Learning of Focused Entailment Graphs"

We propose a global algorithm for learning entailment relations between predicates. We define a graph structure over predicates that represents entailment relations as directed edges, and use a global transitivity constraint on the graph to learn the optimal set of edges, by formulating the optimization problem as an Integer Linear Program. We motivate this graph with an application that provides a hierarchical summary for a set of propositions that focus on a target concept, and show that our global algorithm improves performance by more than 10% over baseline algorithms. . | Global Learning of Focused Entailment Graphs Jonathan Berant Tel-Aviv University Tel-Aviv Israel jonatha6@ Ido Dagan Bar-Ilan University Ramat-Gan Israel dagan@ Jacob Goldberger Bar-Ilan University Ramat-Gan Israel goldbej@ Abstract We propose a global algorithm for learning entailment relations between predicates. We define a graph structure over predicates that represents entailment relations as directed edges and use a global transitivity constraint on the graph to learn the optimal set of edges by formulating the optimization problem as an Integer Linear Program. We motivate this graph with an application that provides a hierarchical summary for a set of propositions that focus on a target concept and show that our global algorithm improves performance by more than 10 over baseline algorithms. 1 Introduction The Textual Entailment TE paradigm Dagan et al. 2009 is a generic framework for applied semantic inference. The objective of TE is to recognize whether a target meaning can be inferred from a given text. For example a Question Answering system has to recognize that alcohol affects blood pressure is inferred from alcohol reduces blood pressure to answer the question What affects blood pressure TE systems require extensive knowledge of entailment patterns often captured as entailment rules rules that specify a directional inference relation between two text fragments when the rule is bidirectional this is known as paraphrasing . An important type of entailment rule refers to propositional templates . propositions comprising a predicate and arguments possibly replaced by variables. The rule required for the previous example would be X reduce Y X affect Y . Because facts and knowledge are mostly expressed by propositions such entailment rules are central to the TE task. This has led to active research on broad-scale acquisition of entailment rules for predicates . Lin and Pantel 2001 Sekine 2005 Szpektor and Dagan .

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.