This document describes the University of Texas at Austin 2013 system for the Knowledge Base Population (KBP) English Slot Filling (SF) task. The UT Austin system builds upon the output of an existing relation extractor by augmenting relations that are explicitly stated in the text with ones that are inferred from the stated relations using probabilistic rules that encode commonsense world knowledge. Such rules are learned from linked open data and are encoded in the form of Bayesian Logic Programs (BLPs), a statistical relational learning framework based on directed graphical models. In this document, we describe our methods for learning these rules, estimating their associated weights, and performing probabilistic and logical inference to infer unseen relations. In the KBP SF task, our system was able to infer several unextracted relations, but its performance was limited by the base level extractor.

PDF

In Proceedings of the Sixth Text Analysis Conference (TAC 2013) 2013.

@inproceedings{bentor:tac2013, title={University of Texas at Austin KBP 2013 Slot Filling System: Bayesian Logic Programs for Textual Inference}, author={Yinon Bentor and Amelia Harrison and Shruti Bhosale and Raymond Mooney}, booktitle={Proceedings of the Sixth Text Analysis Conference (TAC 2013)}, url="http://www.cs.utexas.edu/users/ai-labpub-view.php?PubID=127431", year={2013} }