The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
Open question answering over curated and extracted knowledge bases
Abstract
We consider the problem of open-domain question answering (Open QA) over massive knowledge bases (KBs). Existing approaches use either manually curated KBs like Freebase or KBs automatically extracted from unstructured text. In this paper, we present OQA, the first approach to leverage both curated and extracted KBs.
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
Distant supervision for relation extraction without labeled data
Mintz, M., Bills, S., Snow, R., & Jurafsky, D. (2009) · Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP: Volume 2 - ACL-IJCNLP '09 · doi:10.3115/1690219.1690287 · Cited by 2,752
Toward an architecture for never-ending language learning
Carlson, A., Betteridge, J., Kisiel, B., Settles, B., Hruschka, E., & Mitchell, T. (2010) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v24i1.7519 · Cited by 2,000
Semantic Parsing on Freebase from Question-Answer Pairs
Berant, J., Chou, A., Frostig, R., & Liang, P. (2013) · Proceedings of the 2013 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/d13-1160 · Cited by 1,517
Open information extraction from the web
Banko, M., Cafarella, M., Soderland, S. G., Broadhead, M., & Etzioni, O. (2007) · International Joint Conference on Artificial Intelligence · Cited by 1,398
Self-citationOptimal implementation of conjunctive queries in relational data bases
Chandra, A. K., & Merlin, P. M. (1977) · Proceedings of the ninth annual ACM symposium on Theory of computing - STOC '77 · doi:10.1145/800105.803397 · Cited by 1,224
Identifying Relations for Open Information Extraction
Fader, A., Soderland, S. G., & Etzioni, O. (2011) · Cited by 1,144
Self-citationLarge margin classification using the perceptron algorithm
Freund, Y., & Schapire, R. E. (1998) · Proceedings of the eleventh annual conference on Computational learning theory · doi:10.1145/279943.279985 · Cited by 1,071
Probase: a probabilistic taxonomy for text understanding
Wu, W., Li, H., Wang, H., & Zhu, K. Q. (2012) · Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data · doi:10.1145/2213836.2213891 · Cited by 763
Zettlemoyer, L., & Collins, M. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1207.1420 · Cited by 728
Self-citationLearning to parse database queries using inductive logic programming
Zelle, J. M., & Mooney, R. J. (1996) · Cited by 642
Pharaoh: A Beam Search Decoder for Phrase-Based Statistical Machine Translation Models
Koehn, P. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30194-3_13 · Cited by 628
Large Margin Classification Using the Perceptron Algorithm
Freund, Y., & Schapire, R. E. (1999) · Machine Learning · doi:10.1023/a:1007662407062 · Cited by 604
Learning Dependency-Based Compositional Semantics
Liang, P., Jordan, M. I., & Klein, D. (2013) · Computational Linguistics · doi:10.1162/coli_a_00127 · Cited by 546
DIRT @SBT@discovery of inference rules from text
Lin, D., & Pantel, P. (2001) · Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/502512.502559 · Cited by 541
Principles of Data Integration
(2012) · Elsevier eBooks · doi:10.1016/c2011-0-06130-6 · Cited by 518
Template-based question answering over RDF data
Unger, C., Bühmann, L., Lehmann, J., Ngonga Ngomo, A.-C., Gerber, D., & Cimiano, P. (2012) · Proceedings of the 21st international conference on World Wide Web · doi:10.1145/2187836.2187923 · Cited by 498
Building a question answering test collection
Voorhees, E. M., & Tice, D. M. (2000) · Proceedings of the 23rd annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/345508.345577 · Cited by 435
Large-scale Semantic Parsing via Schema Matching and Lexicon Extension
Cai, Q., & Yates, A. (2013) · Cited by 352
Learning Synchronous Grammars for Semantic Parsing with Lambda Calculus
Wong, Y. W., & Mooney, R. J. (2007) · Cited by 334
Paraphrase-Driven Learning for Open Question Answering
Fader, A., Zettlemoyer, L., & Etzioni, O. (2013) · Cited by 329
Self-citationTEAM: An experiment in the design of transportable natural-language interfaces
Grosz, B. J., Appelt, D. E., Martin, P. A., & Pereira, F. C. N. (1987) · Artificial Intelligence · doi:10.1016/0004-3702(87)90011-7 · Cited by 264
An end-to-end discriminative approach to machine translation
Liang, P., Bouchard-Côté, A., Klein, D., & Taskar, B. (2006) · Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the ACL - ACL '06 · doi:10.3115/1220175.1220271 · Cited by 258
Scaling question answering to the web
Kwok, C., Etzioni, O., & Weld, D. S. (2001) · ACM Transactions on Information Systems · doi:10.1145/502115.502117 · Cited by 230
Self-citationScaling Semantic Parsers with On-the-Fly Ontology Matching
Kwiatkowski, T., Choi, E., Artzi, Y., & Zettlemoyer, L. (2013) · Proceedings of the 2013 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/d13-1161 · Cited by 225
Self-citationNatural Language Questions for the Web of Data
Yahya, M., Berberich, K., Elbassuoni, S., Ramanath, M., Tresp, V., & Weikum, G. (2012) · MPG.PuRe (Max Planck Society) · Cited by 223
Driving Semantic Parsing from the World's Response
Clarke, J., Goldwasser, D., Chang, M., & Roth, D. (2010) · Cited by 216
Lin, T., & Etzioni, O. (2012) · North American Chapter of the Association for Computational Linguistics · Cited by 126
Self-citationAskMSR: Question Answering Using the Worldwide Web
Banko, M., Brili, E., Dumais, S., & Lin, J. (2002) · Cited by 54
Latent Variable Perceptron Algorithm for Structured Classification
Sun, X., Matsuzaki, T., & Okanohara, D. (2009) · Cited by 50
Cited by
VQA: Visual Question Answering
Antol, S., Agrawal, A., Lu, J., Mitchell, M., Batra, D., Zitnick, C. L., & Parikh, D. (2015) · 2015 IEEE International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2015.279 · Cited by 4,487
Advances in natural language processing
Hirschberg, J., & Manning, C. D. (2015) · Science · doi:10.1126/science.aaa8685 · Cited by 1,712
TriviaQA: 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
Self-citationTriviaQA: 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
Self-citationReading 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
“Fader et al. (2014) used We-bQuestions, TREC and WikiAnswers with four KBs as knowledge sources and reported improvement on the latter two datasets through multi-task learning.”
Method
Metadata
- Authors
- Fader, A., Zettlemoyer, L., & Etzioni, O.
- Venue
- Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining
- Publisher
- ACM
- Published
- 2014-08-24
- Pages
- 1156-1165
- OpenAlex
- W2090243146
- Cited by
- 407
- References
- 29
- FWCI
- 25.10
- Type
- conference paper
- Language
- en
- Open access
- closed
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.