activity
20162023
most citedBoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questions

209 citations · 519 across the 14 of their papers we have counts for

collaborators

17 papers

cs.CL2023

NAIL: Lexical Retrieval Indices with Efficient Non-Autoregressive Decoders

Livio Baldini Soares, Daniel Gillick, Jeremy R. Cole +1

Neural document rerankers are extremely effective in terms of accuracy. However, the best models require dedicated hardware for serving, which is costly and often not feasible. To…

cs.CL2023

Evaluating and Modeling Attribution for Cross-Lingual Question Answering

Benjamin Muller, John Wieting, Jonathan H. Clark +6

Trustworthy answer content is abundant in many high-resource languages and is instantly accessible through question answering systems, yet this content can be hard to access for th…

cs.CL2022★ 27 cited

Attributed Question Answering: Evaluation and Modeling for Attributed Large Language Models

Bernd Bohnet, Vinh Q. Tran, Pat Verga +19

Large language models (LLMs) have shown impressive results while requiring little or no direct supervision. Further, there is mounting evidence that LLMs may have potential in info…

cs.IR2021

MOLEMAN: Mention-Only Linking of Entities with a Mention Annotation Network

Nicholas FitzGerald, Jan A. Botha, Daniel Gillick +3

We present an instance-based nearest neighbor approach to entity linking. In contrast to most prior entity retrieval systems which represent each entity with a single vector, we bu…

cs.CL2021

Decontextualization: Making Sentences Stand-Alone

Eunsol Choi, Jennimaria Palomaki, Matthew Lamm +3

Models for question answering, dialogue agents, and summarization often interpret the meaning of a sentence in a rich context and use that meaning in a new context. Taking excerpts…

cs.CL2021★ 64 cited

NeurIPS 2020 EfficientQA Competition: Systems, Analyses and Lessons Learned

Sewon Min, Jordan Boyd-Graber, Chris Alberti +50

We review the EfficientQA competition from NeurIPS 2020. The competition focused on open-domain question answering (QA), where systems take natural language questions as input and…

cs.CL2020★ 17 cited

Empirical Evaluation of Pretraining Strategies for Supervised Entity Linking

Thibault Févry, Nicholas FitzGerald, Livio Baldini Soares +1

In this work, we present an entity linking model which combines a Transformer architecture with large scale pretraining from Wikipedia links. Our model achieves the state-of-the-ar…

cs.CL2020

Entities as Experts: Sparse Memory Access with Entity Supervision

Thibault Févry, Livio Baldini Soares, Nicholas FitzGerald +2

We focus on the problem of capturing declarative knowledge about entities in the learned parameters of a language model. We introduce a new model - Entities as Experts (EAE) - that…

cs.CL2020★ 31 cited

TyDi QA: A Benchmark for Information-Seeking Question Answering in Typologically Diverse Languages

Jonathan H. Clark, Eunsol Choi, Michael Collins +4

Confidently making progress on multilingual modeling requires challenging, trustworthy evaluations. We present TyDi QA---a question answering dataset covering 11 typologically dive…

cs.CL2020★ 22 cited

Learning Cross-Context Entity Representations from Text

Jeffrey Ling, Nicholas FitzGerald, Zifei Shan +4

Language modeling tasks, in which words, or word-pieces, are predicted on the basis of a local context, have been very effective for learning word embeddings and context dependent…

cs.CL2019★ 17 cited

Real-Time Open-Domain Question Answering with Dense-Sparse Phrase Index

Minjoon Seo, Jinhyuk Lee, Tom Kwiatkowski +3

Existing open-domain question answering (QA) models are not suitable for real-time usage because they need to process several long documents on-demand for every input query. In thi…

cs.CL2019

Matching the Blanks: Distributional Similarity for Relation Learning

Livio Baldini Soares, Nicholas FitzGerald, Jeffrey Ling +1

General purpose relation extractors, which can model arbitrary relations, are a core aspiration in information extraction. Efforts have been made to build general purpose extractor…

cs.CL2019★ 209 cited

BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questions

Christopher Clark, Kenton Lee, Ming-Wei Chang +3

In this paper we study yes/no questions that are naturally occurring --- meaning that they are generated in unprompted and unconstrained settings. We build a reading comprehension…

cs.CL2019

Incremental Reading for Question Answering

Samira Abnar, Tania Bedrax-weiss, Tom Kwiatkowski +1

Any system which performs goal-directed continual learning must not only learn incrementally but process and absorb information incrementally. Such a system also has to understand…

cs.CL2018★ 3 cited

Phrase-Indexed Question Answering: A New Challenge for Scalable Document Comprehension

Minjoon Seo, Tom Kwiatkowski, Ankur P. Parikh +2

We formalize a new modular variant of current question answering tasks by enforcing complete independence of the document encoder from the question encoder. This formulation addres…

cs.CL2017★ 3 cited

Multi-Mention Learning for Reading Comprehension with Neural Cascades

Swabha Swayamdipta, Ankur P. Parikh, Tom Kwiatkowski

Reading comprehension is a challenging task, especially when executed across longer or across multiple evidence documents, where the answer is likely to reoccur. Existing neural ar…

cs.CL2016★ 126 cited

Learning Recurrent Span Representations for Extractive Question Answering

Kenton Lee, Shimi Salant, Tom Kwiatkowski +3

The reading comprehension task, that asks questions about a given evidence document, is a central problem in natural language understanding. Recent formulations of this task have t…