English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Journal Article

Answering Complex Questions by Joining Multi-Document Evidence with Quasi Knowledge Graphs

MPS-Authors
/persons/resource/persons185343

Saha Roy,  Rishiraj
Databases and Information Systems, MPI for Informatics, Max Planck Society;

/persons/resource/persons45720

Weikum,  Gerhard
Databases and Information Systems, MPI for Informatics, Max Planck Society;

External Ressource
No external resources are shared
Fulltext (public)

arXiv:1908.00469.pdf
(Preprint), 1011KB

Supplementary Material (public)
There is no public supplementary material available
Citation

Lu, X., Pramanik, S., Saha Roy, R., Abujabal, A., Wang, Y., & Weikum, G. (2019). Answering Complex Questions by Joining Multi-Document Evidence with Quasi Knowledge Graphs. SIGIR 2019. Retrieved from http://arxiv.org/abs/1908.00469.


Cite as: http://hdl.handle.net/21.11116/0000-0005-83B3-C
Abstract
Direct answering of questions that involve multiple entities and relations is a challenge for text-based QA. This problem is most pronounced when answers can be found only by joining evidence from multiple documents. Curated knowledge graphs (KGs) may yield good answers, but are limited by their inherent incompleteness and potential staleness. This paper presents QUEST, a method that can answer complex questions directly from textual sources on-the-fly, by computing similarity joins over partial results from different documents. Our method is completely unsupervised, avoiding training-data bottlenecks and being able to cope with rapidly evolving ad hoc topics and formulation style in user questions. QUEST builds a noisy quasi KG with node and edge weights, consisting of dynamically retrieved entity names and relational phrases. It augments this graph with types and semantic alignments, and computes the best answers by an algorithm for Group Steiner Trees. We evaluate QUEST on benchmarks of complex questions, and show that it substantially outperforms state-of-the-art baselines.