Repozytorium publikacji - Politechnika Gdańska

In this paper we propose a method for answering class 1 and class 2 questions (out of 5 classes defined by Moldovan for TREC conference) based on DBpedia and YAGO. Our method is based on generating dependency trees for the query. In the dependency tree we look for paths leading from the root to the named entity of interest. These paths (referenced further as fibers) are candidates for representation of actual user intention. The analysis of the question consists of three stages: query analysis, query breakdown and information retrieval. During these stages the entities of interest, their attributes and the question domain are detected and the question is converted into a SPARQL query against the DBpedia and YAGO databases. Improvements to the methods are presented and we discuss the quality of the modified solution. We present a system for evaluation of the implemented methods, showing that the methods are viable for use in real applications. We discuss the results and indicate future directions of the work.

Autorzy

• dr inż. Tomasz Maria Boiński link otwiera się w nowej karcie ,
• dr hab. inż. Julian Szymański link otwiera się w nowej karcie ,
• Bartłomiej Dudek link otwiera się w nowej karcie ,
• Paweł Zalewski link otwiera się w nowej karcie ,
• Szymon Dompke link otwiera się w nowej karcie ,
• Maria Czarnecka link otwiera się w nowej karcie