TAILIEUCHUNG - Báo cáo khoa học: "Global Learning of Typed Entailment Rules"

Extensive knowledge bases of entailment rules between predicates are crucial for applied semantic inference. In this paper we propose an algorithm that utilizes transitivity constraints to learn a globally-optimal set of entailment rules for typed predicates. We model the task as a graph learning problem and suggest methods that scale the algorithm to larger graphs. We apply the algorithm over a large data set of extracted predicate instances, from which a resource of typed entailment rules has been recently released (Schoenmackers et al., 2010). . | Global Learning of Typed Entailment Rules 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 Extensive knowledge bases of entailment rules between predicates are crucial for applied semantic inference. In this paper we propose an algorithm that utilizes transitivity constraints to learn a globally-optimal set of entailment rules for typed predicates. We model the task as a graph learning problem and suggest methods that scale the algorithm to larger graphs. We apply the algorithm over a large data set of extracted predicate instances from which a resource of typed entailment rules has been recently released Schoenmackers et al. 2010 . Our results show that using global transitivity information substantially improves performance over this resource and several baselines and that our scaling methods allow us to increase the scope of global learning of entailment-rule graphs. 1 Introduction Generic approaches for applied semantic inference from text gained growing attention in recent years particularly under the Textual Entailment TE framework Dagan et al. 2009 . TE is a generic paradigm for semantic inference where the objective is to recognize whether a target meaning can be inferred from a given text. A crucial component of inference systems is extensive resources of entailment rules also known as inference rules . rules that specify a directional inference relation between fragments of text. One important type of rule is rules that specify entailment relations between predicates and their arguments. For example the rule X annex Y X control Y helps recognize that the text Japan annexed Okinawa answers the 610 question Which country controls Okinawa . Thus acquisition of such knowledge received considerable attention in the last decade Lin and Pantel 2001 Sekine 2005 Szpektor and Dagan 2009

TỪ KHÓA LIÊN QUAN
TAILIEUCHUNG - Chia sẻ tài liệu không giới hạn
Địa chỉ : 444 Hoang Hoa Tham, Hanoi, Viet Nam
Website : tailieuchung.com
Email : tailieuchung20@gmail.com
Tailieuchung.com là thư viện tài liệu trực tuyến, nơi chia sẽ trao đổi hàng triệu tài liệu như luận văn đồ án, sách, giáo trình, đề thi.
Chúng tôi không chịu trách nhiệm liên quan đến các vấn đề bản quyền nội dung tài liệu được thành viên tự nguyện đăng tải lên, nếu phát hiện thấy tài liệu xấu hoặc tài liệu có bản quyền xin hãy email cho chúng tôi.
Đã 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.