CoChat

How Context Affects Language Models' Factual Predictions

Open access
Fabio Petroni, Patrick Lewis · 2020 · Automated Knowledge Base Construction (AKBC)

The DOI matches its DataCite record; 49 of the 49 references it cites were found in a registry or an index.

Abstract

When pre-trained on large unsupervised textual corpora, language models are able to store and retrieve factual knowledge to some extent, making it possible to use them directly for zero-shot cloze-style question answering. However, storing factual knowledge in a fixed number of weights of a language model clearly has limitations. Previous approaches have successfully provided access to information outside the model weights using supervised architectures that combine an information retrieval system with a machine reading component. In this paper, we go a step further and integrate information from a retrieval system with a pre-trained language model in a purely unsupervised way. We report that augmenting pre-trained language models in this way dramatically improves performance and that the resulting system, despite being unsupervised, is competitive with a supervised machine reading baseline. Furthermore, processing query and context with different segment tokens allows BERT to utilize its Next Sentence Prediction pre-trained classifier to determine whether the context is relevant or not, substantially improving BERT's zero-shot cloze-style question-answering performance and making its predictions robust to noisy contexts.

Overview

Integrity signals

Registry

DataCite · 10.24432/c5201w

Cites

49 of 49 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

  • BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding

    Devlin, J., Chang, M.-W., Lee, K., & Toutanova, K. (2019) · Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long and Short Papers) · doi:10.18653/v1/n19-1423 · Cited by 54,325 · cited 9×

    “Among the constellation of language models that have been proposed in recent years we consider BERT [Devlin et al., 2019] since it is one of the post popular and widely used at the time of writing.4 Moreover, the large cased version of the BERT model is the best performing LM on the LAMA probe among those considered i…”
    BackgroundMethodInfluential
  • RoBERTa: A Robustly Optimized BERT Pretraining Approach

    Liu, Y., Ott, M., Goyal, N., Du, J., Joshi, M., Chen, D., Levy, O., Lewis, M., Zettlemoyer, L., & Stoyanov, V. (2019) · arXiv · doi:10.48550/arxiv.1907.11692 · Cited by 16,515 · cited 5×

    “For the generative case, taking inspiration from the study of Massarelli et al. [2019], we consider a 1.4B parameters autoregressive language model trained on CC-NEWS [Liu et al., 2019].”
    BackgroundMethodInfluential
  • Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformer

    Raffel, C., Shazeer, N., Roberts, A., Lee, K., Narang, S., Matena, M., Zhou, Y., Li, W., & Liu, P. J. (2019) · arXiv · doi:10.48550/arxiv.1910.10683 · Cited by 10,929 · cited 1×

    “Language Models and Probes With the recent success of pre-trained language models like BERT [Devlin et al., 2019] and its variants [Liu et al., 2019, Seo et al., 2019, Raffel et al., 2019, Lewis et al., 2019a], it becomes increasingly important to understand what these models learn.”
    Method
  • BART: Denoising Sequence-to-Sequence Pre-training for Natural Language Generation, Translation, and Comprehension

    Lewis, M., Liu, Y., Goyal, N., Ghazvininejad, M., Mohamed, A., Levy, O., Stoyanov, V., & Zettlemoyer, L. (2020) · Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics · doi:10.18653/v1/2020.acl-main.703 · Cited by 8,821 · cited 1×

    “Language Models and Probes With the recent success of pre-trained language models like BERT [Devlin et al., 2019] and its variants [Liu et al., 2019, Seo et al., 2019, Raffel et al., 2019, Lewis et al., 2019a], it becomes increasingly important to understand what these models learn.”
    Method
  • XLNet: Generalized Autoregressive Pretraining for Language Understanding

    Yang, Z., Dai, Z., Yang, Y., Carbonell, J., Salakhutdinov, R., & Le, Q. V. (2019) · arXiv · doi:10.48550/arxiv.1906.08237 · Cited by 6,687 · cited 3×

    “Pre-trained language models have also been fine-tuned and adapted to be used as information retrieval systems [Yang et al., 2019b, Yilmaz et al., 2019, Seo et al., 2019].”
    BackgroundMethod
  • 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 9×

    “1 [Rajpurkar et al., 2016].”
    BackgroundMethodInfluential
  • ALBERT: A Lite BERT for Self-supervised Learning of Language Representations

    Lan, Z., Chen, M., Goodman, S., Gimpel, K., Sharma, P., & Soricut, R. (2019) · arXiv · doi:10.48550/arxiv.1909.11942 · Cited by 4,308 · cited 1×

    “Re-examining NSP The Next Sentence Prediction task has been extensively explored [Devlin et al., 2019, Liu et al., 2019, Yang et al., 2019c, Lan et al., 2019] with the apparent consensus that it is not helpful for downstream fine-tuning accuracy.”
    Background
  • GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understanding

    Wang, A., Singh, A., Michael, J., Hill, F., Levy, O., & Bowman, S. (2018) · Proceedings of the 2018 EMNLP Workshop BlackboxNLP: Analyzing and Interpreting Neural Networks for NLP · doi:10.18653/v1/w18-5446 · Cited by 4,222 · cited 3×

    “…2017, Wang et al., 2018b,c, Lin et al., 2018, Min et al., 2018, Lee et al., 2018, 2019, Das et al., 2019, Xiong et al., 2019], improving answer aggregation [Clark and Gardner, 2018, Wang et al., 2018c, Lee et al., 2018, Pang et al., 2019], and accelerating the whole pipeline [Seo et al., 2019].”
    BackgroundMethod
  • Language Models as Knowledge Bases?

    Petroni, F., Rocktäschel, T., Riedel, S., Lewis, P., Bakhtin, A., Wu, Y., & Miller, A. (2019) · Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP) · doi:10.18653/v1/d19-1250 · Cited by 1,834 · cited 5×

    “We use the LAMA 2 probe in our experiments [Petroni et al., 2019], a collection of cloze-style questions about real world relational facts with a single token answer.”
    BackgroundMethodInfluential
  • 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 8×

    “2 Baselines We consider DrQA [Chen et al., 2017], a popular system for open-domain question answering.”
    BackgroundMethodInfluential
  • BERT Rediscovers the Classical NLP Pipeline

    Tenney, I., Das, D., & Pavlick, E. (2019) · Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics · doi:10.18653/v1/p19-1452 · Cited by 1,307

  • SuperGLUE: A Stickier Benchmark for General-Purpose Language Understanding Systems

    Wang, A., Pruksachatkun, Y., Nangia, N., Singh, A., Michael, J., Hill, F., Levy, O., & Bowman, S. R. (2019) · arXiv · doi:10.48550/arxiv.1905.00537 · Cited by 1,051 · cited 1×

    “Pre-trained language models such as BERT [Devlin et al., 2019] and RoBERTa [Liu et al., 2019] enabled state-of-the-art in many downstream NLP tasks [Wang et al., 2018a, 2019, Wu et al., 2019].”
    Method
  • How Can We Know What Language Models Know?

    Jiang, Z., Xu, F. F., Araki, J., & Neubig, G. (2020) · Transactions of the Association for Computational Linguistics · doi:10.1162/tacl_a_00324 · Cited by 1,002

  • CoQA: A Conversational Question Answering Challenge

    Reddy, S., Chen, D., & Manning, C. D. (2019) · Transactions of the Association for Computational Linguistics · doi:10.1162/tacl_a_00266 · Cited by 975

  • Latent retrieval for weakly supervised open domain question answering

    Lee, K., Chang, M.-W., & Toutanova, K. (2019) · Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics · doi:10.18653/v1/p19-1612 · Cited by 771 · cited 2×

    “Finally, while we have chosen DrQA as our baseline to compare to recent work, there exist several more sophisticated supervised open-domain QA models that outperform it on a variety of open-domain QA tasks [Lee et al., 2019, Yang et al., 2019a, Guu et al., 2020].”
    BackgroundMethod
  • What do you learn from context? Probing for sentence structure in contextualized word representations

    Tenney, I., Xia, P., Chen, B., Wang, A., Poliak, A., McCoy, R. T., Kim, N., Van Durme, B., Bowman, S. R., Das, D., et al. (2019) · arXiv · doi:10.48550/arxiv.1905.06316 · Cited by 698 · cited 1×

    “…2018, Hewitt and Manning, 2019, Vig and Belinkov, 2019], negative polarity items [Warstadt and Bowman, 2019, Warstadt et al., 2019], semantic fragments [Richardson et al., 2019], function words [Kim et al., 2019], and many other linguistic phenomena [Tenney et al., 2019a,b, De Cao et al., 2020].”
    Background
  • Untitled work

    (2019) · doi:10.18653/v1/n19-1419 · Cited by 601 · cited 1×

    “A variety of “probes” have been developed to analyse the syntactic structures, such as syntax trees [Marvin and Linzen, 2018, Hewitt and Manning, 2019, Vig and Belinkov, 2019], negative polarity items [Warstadt and Bowman, 2019, Warstadt et al., 2019], semantic fragments [Richardson et al., 2019],…”
    Background
  • REALM: Retrieval-Augmented Language Model Pre-Training

    Guu, K., Lee, K., Tung, Z., Pasupat, P., & Chang, M.-W. (2020) · arXiv · doi:10.48550/arxiv.2002.08909 · Cited by 574 · cited 6×

    “One way to get around this is to combine machine reading with an information retrieval (IR) system [Chen et al., 2017, Guu et al., 2020].”
    BackgroundMethodInfluential
  • Zero-Shot Relation Extraction via Reading Comprehension

    Levy, O., Seo, M., Choi, E., & Zettlemoyer, L. (2017) · Proceedings of the 21st Conference on Computational Natural Language Learning (CoNLL 2017) · doi:10.18653/v1/k17-1034 · Cited by 482 · cited 2×

    “In order to apply DrQA to the LAMA probe, we take inspiration from [Levy et al., 2017] and map each cloze-style template to a natural question template ( e.g. , “ X was born in [Mask] ” to “Where was X born?”).”
    Method
  • Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challenge

    Clark, P., Cowhey, I., Etzioni, O., Khot, T., Sabharwal, A., Schoenick, C., & Tafjord, O. (2018) · arXiv · doi:10.48550/arxiv.1803.05457 · Cited by 462 · cited 2×

    “Radford et al. [2019] and Lewis et al. [2019b] demonstrate non-trivial performance on CoQA [Reddy et al., 2019] and SQuAD [Rajpurkar et al., 2016] respectively, and [Yadav et al., 2019] achieve SoTA results using an unsupervised method for multi-choice QA on ARC [Clark et al., 2018].”
    Method
  • Simple and Effective Multi-Paragraph Reading Comprehension

    Clark, C., & Gardner, M. (2018) · Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · doi:10.18653/v1/p18-1078 · Cited by 396 · cited 3×

    “Radford et al. [2019] and Lewis et al. [2019b] demonstrate non-trivial performance on CoQA [Reddy et al., 2019] and SQuAD [Rajpurkar et al., 2016] respectively, and [Yadav et al., 2019] achieve SoTA results using an unsupervised method for multi-choice QA on ARC [Clark et al., 2018].”
    BackgroundMethod
  • End-to-End Open-Domain Question Answering with

    Yang, W., Xie, Y., Lin, A., Li, X., Tan, L., Xiong, K., Li, M., & Lin, J. (2019) · Proceedings of the 2019 Conference of the North · doi:10.18653/v1/n19-4013 · Cited by 391 · cited 1×

    “Finally, while we have chosen DrQA as our baseline to compare to recent work, there exist several more sophisticated supervised open-domain QA models that outperform it on a variety of open-domain QA tasks [Lee et al., 2019, Yang et al., 2019a, Guu et al., 2020].”
    Method
  • R3: Reinforced Ranker-Reader for Open-Domain Question Answering

    Wang, S., Yu, M., Guo, X., Wang, Z., Klinger, T., Zhang, W., Chang, S., Tesauro, G., Zhou, B., & Jiang, J. (2018) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v32i1.12053 · Cited by 351 · cited 3×

    “Works in this areas mostly focus on enhancing retrieval quality [Choi et al., 2017, Wang et al., 2018b,c, Lin et al., 2018, Min et al., 2018, Lee et al., 2018, 2019a, Das et al., 2019, Xiong et al., 2019], improving answer aggregation [Clark and Gardner, 2017, Wang et al., 2018c, Lee et al., 2018,…”
    BackgroundMethod
  • Targeted Syntactic Evaluation of Language Models

    Marvin, R., & Linzen, T. (2018) · Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/d18-1151 · Cited by 334 · cited 1×

    “A variety of “probes” have been developed to analyse the syntactic structures, such as syntax trees [Marvin and Linzen, 2018, Hewitt and Manning, 2019, Vig and Belinkov, 2019], negative polarity items [Warstadt and Bowman, 2019, Warstadt et al., 2019], semantic fragments [Richardson et al., 2019],…”
    Background
  • Analyzing the Structure of Attention in a Transformer Language Model

    Vig, J., & Belinkov, Y. (2019) · Proceedings of the 2019 ACL Workshop BlackboxNLP: Analyzing and Interpreting Neural Networks for NLP · doi:10.18653/v1/w19-4808 · Cited by 301 · cited 1×

    “…of “probes” have been developed to analyse the syntactic structures, such as syntax trees [Marvin and Linzen, 2018, Hewitt and Manning, 2019, Vig and Belinkov, 2019], negative polarity items [Warstadt and Bowman, 2019, Warstadt et al., 2019], semantic fragments [Richardson et al., 2019],…”
    Background
  • oLMpics-On What Language Model Pre-training Captures

    Talmor, A., Elazar, Y., Goldberg, Y., & Berant, J. (2020) · Transactions of the Association for Computational Linguistics · doi:10.1162/tacl_a_00342 · Cited by 271 · cited 3×

    “As a community, we should continue to strive for greater diversity in our criteria and possible use-cases for assessing such models [Talmor et al., 2019].”
    BackgroundMethod
  • Negated and Misprimed Probes for Pretrained Language Models: Birds Can Talk, But Cannot Fly

    Kassner, N., & Schütze, H. (2020) · Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics · doi:10.18653/v1/2020.acl-main.698 · Cited by 223

  • Untitled work

    (2018) · doi:10.63317/2yu5nu76n7bu · Cited by 189 · cited 7×

    “9 on T-REx and × 3 .”
    Influential
  • Zero-shot Entity Linking with Dense Entity RetrievalPreprint

    Wu, L. Y., Petroni, F., Josifoski, M., et al. (2019) · arXiv.org · doi:10.48550/arxiv.1911.03814 · Cited by 182

  • Multi-step Retriever-Reader Interaction for Scalable Open-domain Question AnsweringPreprint

    Das, R., Dhuliawala, S., Zaheer, M., & McCallum, A. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1905.05733 · Cited by 180 · cited 1×

    “…mostly focus on enhancing retrieval quality [Choi et al., 2017, Wang et al., 2018b,c, Lin et al., 2018, Min et al., 2018, Lee et al., 2018, 2019, Das et al., 2019, Xiong et al., 2019], improving answer aggregation [Clark and Gardner, 2018, Wang et al., 2018c, Lee et al., 2018, Pang et al.,…”
    Background
  • Coarse-to-Fine Question Answering for Long Documents

    Choi, E., Hewlett, D., Uszkoreit, J., Polosukhin, I., Lacoste, A., & Berant, J. (2017) · Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · doi:10.18653/v1/p17-1020 · Cited by 177 · cited 1×

    “Works in this areas mostly focus on enhancing retrieval quality [Choi et al., 2017, Wang et al., 2018b,c, Lin et al., 2018, Min et al., 2018, Lee et al., 2018, 2019, Das et al., 2019, Xiong et al., 2019], improving answer aggregation [Clark and Gardner, 2018, Wang et al., 2018c, Lee et al., 2018,…”
    Background
  • Applying BERT to Document Retrieval with Birch

    Yilmaz, Z. A., Wang, S., Yang, W., Zhang, H., & Lin, J. (2019) · Conference on Empirical Methods in Natural Language Processing: System Demonstrations (EMNLP) · doi:10.18653/v1/d19-3004 · Cited by 156 · cited 1×

    “Pre-trained language models have also been fine-tuned and adapted to be used as information retrieval systems [Yang et al., 2019b, Yilmaz et al., 2019, Seo et al., 2019].”
    Method
  • Efficient and Robust Question Answering from Minimal Context over Documents

    Min, S., Zhong, V., Socher, R., & Xiong, C. (2018) · Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · doi:10.18653/v1/p18-1160 · Cited by 145 · cited 1×

    “Works in this areas mostly focus on enhancing retrieval quality [Choi et al., 2017, Wang et al., 2018b,c, Lin et al., 2018, Min et al., 2018, Lee et al., 2018, 2019, Das et al., 2019, Xiong et al., 2019], improving answer aggregation [Clark and Gardner, 2018, Wang et al., 2018c, Lee et al., 2018,…”
    Background
  • Real-Time Open-Domain Question Answering with Dense-Sparse Phrase Index

    Seo, M., Lee, J., Kwiatkowski, T., Parikh, A., Farhadi, A., & Hajishirzi, H. (2019) · Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics · doi:10.18653/v1/p19-1436 · Cited by 141

  • Evidence Aggregation for Answer Re-Ranking in Open-Domain Question Answering

    Wang, S., Yu, M., Jiang, J., Zhang, W., Guo, X., Chang, S., Wang, Z., Klinger, T., Tesauro, G. J., & Campbell, M. S. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1711.05116 · Cited by 137 · cited 1×

    “…2017, Wang et al., 2018b,c, Lin et al., 2018, Min et al., 2018, Lee et al., 2018, 2019, Das et al., 2019, Xiong et al., 2019], improving answer aggregation [Clark and Gardner, 2018, Wang et al., 2018c, Lee et al., 2018, Pang et al., 2019], and accelerating the whole pipeline [Seo et al., 2019].”
    Background
  • Unsupervised Question Answering by Cloze Translation

    Lewis, P., Denoyer, L., & Riedel, S. (2019) · Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics · doi:10.18653/v1/p19-1484 · Cited by 125 · cited 1×

    “Radford et al. [2019] and Lewis et al. [2019b] demonstrate non-trivial performance on CoQA [Reddy et al., 2019] and SQuAD [Rajpurkar et al., 2016] respectively, and [Yadav et al., 2019] achieve SoTA results using an unsupervised method for multi-choice QA on ARC [Clark et al., 2018].”
    Method
  • Models and Data for Simple Applications of BERT for Ad Hoc Document Retrieval

    Akkalyoncu Yilmaz, Z., Yang, W., Zhang, H., & Lin, J. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1903.10972 · Cited by 118 · cited 3×

    “Pre-trained language models have also been fine-tuned and adapted to be used as information retrieval systems [Yang et al., 2019b, Yilmaz et al., 2019, Seo et al., 2019].”
    BackgroundMethod
  • Probing Natural Language Inference Models through Semantic Fragments

    Richardson, K., Hu, H., Moss, L., & Sabharwal, A. (2020) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v34i05.6397 · Cited by 112

  • Ranking Paragraphs for Improving Answer Recall in Open-Domain Question Answering

    Lee, J., Yun, S., Kim, H., Ko, M., & Kang, J. (2018) · Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/d18-1053 · Cited by 94

  • Probing What Different NLP Tasks Teach Machines about Function Word Comprehension

    Kim, N., Patel, R., Poliak, A., Xia, P., Wang, A., McCoy, T., Tenney, I., Ross, A., Linzen, T., Van Durme, B., et al. (2019) · Proceedings of the Eighth Joint Conference on Lexical and Computational Semantics (*SEM 2019) · doi:10.18653/v1/s19-1026 · Cited by 92

  • Investigating BERT’s Knowledge of Language: Five Analysis Methods with NPIs

    Warstadt, A., Cao, Y., Grosu, I., Peng, W., Blix, H., Nie, Y., Alsop, A., Bordia, S., Liu, H., Parrish, A., et al. (2019) · Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP) · doi:10.18653/v1/d19-1286 · Cited by 85 · cited 1×

    “…such as syntax trees [Marvin and Linzen, 2018, Hewitt and Manning, 2019, Vig and Belinkov, 2019], negative polarity items [Warstadt and Bowman, 2019, Warstadt et al., 2019], semantic fragments [Richardson et al., 2019], function words [Kim et al., 2019], and many other linguistic phenomena…”
    Background
  • How do Decisions Emerge across Layers in Neural Models? Interpretation with Differentiable Masking

    De Cao, N., Schlichtkrull, M. S., Aziz, W., & Titov, I. (2020) · Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.18653/v1/2020.emnlp-main.262 · Cited by 75

  • Denoising Distantly Supervised Open-Domain Question Answering

    Lin, Y., Ji, H., Liu, Z., & Sun, M. (2018) · Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · doi:10.18653/v1/p18-1161 · Cited by 56

  • What Does My QA Model Know? Devising Controlled Probes Using Expert Knowledge

    Richardson, K., & Sabharwal, A. (2020) · Transactions of the Association for Computational Linguistics · doi:10.1162/tacl_a_00331 · Cited by 48 · cited 2×

    “…2018, Hewitt and Manning, 2019, Vig and Belinkov, 2019], negative polarity items [Warstadt and Bowman, 2019, Warstadt et al., 2019], semantic fragments [Richardson et al., 2019], function words [Kim et al., 2019], and many other linguistic phenomena [Tenney et al., 2019a,b, De Cao et al., 2020].”
    Background
  • HAS-QA: Hierarchical Answer Spans Model for Open-Domain Question Answering

    Pang, L., Lan, Y., Guo, J., Xu, J., Su, L., & Cheng, X. (2019) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v33i01.33016875 · Cited by 41 · cited 1×

    “…2017, Wang et al., 2018b,c, Lin et al., 2018, Min et al., 2018, Lee et al., 2018, 2019, Das et al., 2019, Xiong et al., 2019], improving answer aggregation [Clark and Gardner, 2018, Wang et al., 2018c, Lee et al., 2018, Pang et al., 2019], and accelerating the whole pipeline [Seo et al., 2019].”
    Background
  • How Decoding Strategies Affect the Verifiability of Generated Text

    Massarelli, L., Petroni, F., Piktus, A., Ott, M., Rocktäschel, T., Plachouras, V., Silvestri, F., & Riedel, S. (2020) · Findings of the Association for Computational Linguistics: EMNLP 2020 · doi:10.18653/v1/2020.findings-emnlp.22 · Cited by 38

  • PIQA: Reasoning about Physical Commonsense in Natural Language

    Bisk, Y., Zellers, R., Le bras, R., Gao, J., & Choi, Y. (2020) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v34i05.6239 · Cited by 37 · cited 1×

    “…later extends LAMA by automatically discovering better prompts, Kassner and Sch¨utze [2019] add negated statements, Poerner et al. [2019] filter out easy-to-guess queries, and Richardson and Sabharwal [2019], Talmor et al. [2019], Bisk et al. [2019] develop further probes for textual reasoning.”
    Background
  • Alignment over Heterogeneous Embeddings for Question Answering

    Yadav, V., Bethard, S. J., & Surdeanu, M. (2019) · Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (NAACL-HLT) · doi:10.18653/v1/n19-1274 · Cited by 36 · cited 1×

    “Radford et al. [2019] and Lewis et al. [2019b] demonstrate non-trivial performance on CoQA [Reddy et al., 2019] and SQuAD [Rajpurkar et al., 2016] respectively, and [Yadav et al., 2019] achieve SoTA results using an unsupervised method for multi-choice QA on ARC [Clark et al., 2018].”
    Method
  • Simple yet Effective Bridge Reasoning for Open-Domain Multi-Hop Question Answering

    Xiong, W., Yu, M., Guo, X., Wang, H., Chang, S., Campbell, M. S., & Wang, W. Y. (2019) · Workshop on Machine Reading for Question Answering (MRQA) · doi:10.18653/v1/d19-5806 · Cited by 14 · cited 1×

    “…enhancing retrieval quality [Choi et al., 2017, Wang et al., 2018b,c, Lin et al., 2018, Min et al., 2018, Lee et al., 2018, 2019, Das et al., 2019, Xiong et al., 2019], improving answer aggregation [Clark and Gardner, 2018, Wang et al., 2018c, Lee et al., 2018, Pang et al., 2019], and…”
    Background

Cited by

See all 9

Metadata

Authors
Fabio Petroni, P. L.
Venue
Automated Knowledge Base Construction (AKBC)
Publisher
Automated Knowledge Base Construction (AKBC)
Published
2020
OpenAlex
W6964124353
Cited by
4
References
49
Citations by year
2026: 1 · 2025: 2 · 2022: 1
FWCI
0.10
Type
journal article
Language
en
Open access
Locations
UC Irvine
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Topic Modeling
  • Physical Sciences › Computer Science › Artificial Intelligence › Natural Language Processing Techniques
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Multimodal Machine Learning Applications
Keywords
language models, context effects, factual knowledge, large language models, factual reasoning

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

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.