Tom Kwiatkowski
8 papers in the PaperMetrix corpus
Papers by this author
-
1-PAGER: One Pass Answer Generation and Evidence Retrieval
2023 · arXiv (Cornell University)
We present 1-Pager the first system that answers a question and retrieves evidence using a single Transformer-based model and decoding process. 1-Pager incrementally partitions the retrieval corpus using constrained decoding to select a document and …
-
Transforming Dependency Structures to Logical Forms for Semantic Parsing
2016 · Transactions of the Association for Computational Linguistics
The strongly typed syntax of grammar formalisms such as CCG, TAG, LFG and HPSG offers a synchronous framework for deriving syntactic structures and semantic logical forms. In contrast—partly due to the lack of a strong …
-
Learning Recurrent Span Representations for Extractive Question Answering
2016 · arXiv (Cornell University)
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 typically focused on answer selection from a set of …
-
Natural Questions: A Benchmark for Question Answering Research
2019 · Transactions of the Association for Computational Linguistics
We present the Natural Questions corpus, a question answering data set. Questions consist of real anonymized, aggregated queries issued to the Google search engine. An annotator is presented with a question along with a Wikipedia …
-
Matching the Blanks: Distributional Similarity for Relation Learning
2019
General purpose relation extractors, which can model arbitrary relations, are a core aspiration in information extraction. Efforts have been made to build general purpose extractors that represent relations with their surface forms, or which jointly …
-
Real-Time Open-Domain Question Answering with Dense-Sparse Phrase Index
2019
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, which is computationally prohibitive. In this paper, we introduce query-agnostic …
-
BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questions
2019 · arXiv (Cornell University)
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 dataset, BoolQ, of such questions, and show that …
-
T<scp>y</scp>D<scp>i</scp> QA: A Benchmark for Information-Seeking Question Answering in <i>Ty</i>pologically <i>Di</i>verse Languages
2020 · Transactions of the Association for Computational Linguistics
Confidently making progress on multilingual modeling requires challenging, trustworthy evaluations. We present TyDi QA—a question answering dataset covering 11 typologically diverse languages with 204K question-answer pairs. The languages of TyDi QA are diverse with regard …