We use a few cookies

Essential cookies keep the library working. With your permission, we'd also like to use analytics to see what's useful and improve the experience. Read our Privacy Policy or Cookie Policy.

Skip to main content
Home/e-Resources/Artificial Intelligence & Machine Learning/SimpleQuestions Nearly Solved: A New Upperbound and Baseline Approach
Conference ProceedingsArtificial Intelligence & Machine Learning

SimpleQuestions Nearly Solved: A New Upperbound and Baseline Approach

Checking your access to this record.

Abstract & Overview

The SimpleQuestions dataset is one of the most commonly used benchmarks for studying single-relation factoid questions.In this paper, we present new evidence that this benchmark can be nearly solved by standard methods.First, we show that ambiguity in the data bounds performance at 83.4%; many questions have more than one equally plausible interpretation.Second, we introduce a baseline that sets a new state-of-the-art performance level at 78.1% accuracy, despite using standard methods.Finally, we report an empirical analysis showing that the upperbound is loose; roughly a quarter of the remaining errors are also not resolvable from the linguistic signal.Together, these results suggest that the SimpleQuestions dataset is nearly solved.

Cite this record

Michael Petrochuk, Luke Zettlemoyer (2018). SimpleQuestions Nearly Solved: A New Upperbound and Baseline Approach. Conference on Empirical Methods in Natural Language Processing (EMNLP). https://doi.org/10.18653/v1/d18-1051

Copy in another style

Petrochuk, M., & Zettlemoyer, L. (2018). SimpleQuestions Nearly Solved: A New Upperbound and Baseline Approach. Conference on Empirical Methods in Natural Language Processing (EMNLP). https://doi.org/10.18653/v1/d18-1051
Author names are used as deposited, so check their order before you submit.

Metadata is harvested from open-access indexes and can be incomplete. Check a citation against the published version before relying on it — see our open access & attribution policy.