Answering Complex Questions by Joining Multi-Document Evidence with Quasi Knowledge Graphs
Open accessThe DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding
Devlin, J., Chang, M.-W., Lee, K., & Toutanova, K. (2018) · arXiv · doi:10.48550/arxiv.1810.04805 · Cited by 73,173
SQuAD: 100,000+ Questions for Machine Comprehension of Text
Rajpurkar, P., Zhang, J., Lopyrev, K., & Liang, P. (2016) · Proceedings of the 2016 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/d16-1264 · Cited by 6,208 · cited 3×
“plexquestionsthatinvolvemultipleentitiesandrelations, and can cope with the noise in the quasi KG. Popular QA benchmarks like WebQuestions [7], SimpleQuestions [10], TREC [2, 19], QALD [60], or SQuAD [48], are not suitable, as they mostly focus on answering simple questions or understanding natural language passages.…”
BackgroundMethodResultInfluentialFreebase: a collaboratively created graph database for structuring human knowledge
Bollacker, K., Evans, C., Paritosh, P., Sturge, T., & Taylor, J. (2008) · Proceedings of the 2008 ACM SIGMOD international conference on Management of data · doi:10.1145/1376616.1376746 · Cited by 4,852 · cited 1×
“The advent of large knowledge graphs like Freebase [9], YAGO [53], DBpedia [4] and Wikidata [63] has given rise to QA over KGs (overviews in [18, 59]).”
BackgroundTriviaQA: A Large Scale Distantly Supervised Challenge Dataset for Reading Comprehension
Joshi, M., Choi, E., Weld, D., & Zettlemoyer, L. (2017) · Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · doi:10.18653/v1/p17-1147 · Cited by 1,690
TriviaQA: A Large Scale Distantly Supervised Challenge Dataset for Reading Comprehension
Joshi, M., Choi, E., Weld, D. S., & Zettlemoyer, L. (2017) · arXiv · doi:10.48550/arxiv.1705.03551 · Cited by 1,650
Reading Wikipedia to answer open-domain questions
Chen, D., Fisch, A., Weston, J., & Bordes, A. (2017) · Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · doi:10.18653/v1/p17-1171 · Cited by 1,546 · cited 5×
“ComplexQuestions from Trends (CQ-T) Top Strata-1 Strata-2 Strata-3 Strata-4 Strata-5 Top Strata-1 Strata-2 Strata-3 Strata-4 Strata-5 QUEST MRR 0.355 *380 340 302 356 318 467 436 426 460 409 384 DrQA [12] 0 .226 0 237 0 257 0 256 0 215 0 248 0 355 0 330 0 356 0 369 0 365 0 380 BFS [38] 0 .249 0 256 0266 0 212 0 219 02…”
BackgroundMethodResultInfluentialLeveraging Linguistic Structure For Open Domain Information Extraction
Angeli, G., Johnson Premkumar, M. J., & Manning, C. D. (2015) · Proceedings of the 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing (Volume 1: Long Papers) · doi:10.3115/v1/p15-1034 · Cited by 725 · cited 3×
“yword query. To identify cues in the matching documents and to join them across multiple documents, we apply Open IE [37, 44] to extract SPO triples. Popular tools for Open IE include Stanford OpenIE [3], OpenIE 5.0 (previously ReVerb) [44], and ClausIE [14], but each comes with limitations.StanfordOpenIEfocusesonprec…”
MethodInfluentialOpen Domain Question Answering Using Early Fusion of Knowledge Bases and Text
Sun, H., Dhingra, B., Zaheer, M., Mazaitis, K., Salakhutdinov, R., & Cohen, W. (2018) · Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/d18-1455 · Cited by 716
Metadata
- Authors
- Lu, X., Pramanik, S., Saha Roy, R., Abujabal, A., Wang, Y., & Weikum, G.
- Venue
- Proceedings of the 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval
- Publisher
- ACM
- Published
- 2019-07-18
- Pages
- 105-114
- OpenAlex
- W2953867581
- Cited by
- 42
- References
- 8
- FWCI
- 2.10
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Answering Complex Questions by Joining Multi-Document Evidence with Quasi Knowledge Graphs. https://app.cochat.ai/papers/10.1145/3331184.3331252
- The paper
- 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. Proceedings of the 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval. https://doi.org/10.1145/3331184.3331252
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.