Date of Original Version



Conference Proceeding

Rights Management

c 2013 Association for Computational Linguistics

Abstract or Description

Automatically constructed Knowledge Bases (KBs) are often incomplete and there is a genuine need to improve their coverage. Path Ranking Algorithm (PRA) is a recently proposed method which aims to improve KB coverage by performing inference directly over the KB graph. For the first time, we demonstrate that addition of edges labeled with latent features mined from a large dependency parsed corpus of 500 million Web documents can significantly outperform previous PRA-based approaches on the KB inference task. We present extensive experimental results validating this finding. The resources presented in this paper are publicly available.



Published In

Proceedings of the 2013 Conference on Empirical Methods in Natural Language Processing, 833-838.