In this paper, we propose to use semantic knowledge from Wikipedia and large-scale structured knowledge datasets available as Linked Open Data (LOD) for the answer passage reranking task. We represent question and candidate answer passages with pairs of shallow syntactic/semantic trees, whose constituents are connected using LOD. The trees are processed by SVMs and tree kernels, which can automatically exploit tree fragments. The experiments with our SVM rank algorithm on the TREC Question Answering (QA) corpus show that the added relational information highly improves over the state of the art, e.g., about 15.4% of relative improvement in P@1. © 2014 Association for Computational Linguistics.
CITATION STYLE
Tymoshenko, K., Moschitti, A., & Severyn, A. (2014). Encoding semantic resources in syntactic structures for passage reranking. In 14th Conference of the European Chapter of the Association for Computational Linguistics 2014, EACL 2014 (pp. 664–672). Association for Computational Linguistics (ACL). https://doi.org/10.3115/v1/e14-1070
Mendeley helps you to discover research relevant for your work.