The DOI matches its Crossref record; 36 of the 36 references it cites were found in a registry or an index.
Semantic Parsing via Paraphrasing
Open accessAbstract
A central challenge in semantic parsing is handling the myriad ways in which knowledge base predicates can be expressed.Traditionally, semantic parsers are trained primarily from text paired with knowledge base information.Our goal is to exploit the much larger amounts of raw text not tied to any knowledge base.In this paper, we turn semantic parsing on its head.Given an input utterance, we first use a simple method to deterministically generate a set of candidate logical forms with a canonical realization in natural language for each.Then, we use a paraphrase model to choose the realization that best paraphrases the input, and output the corresponding logical form.We present two simple paraphrase models, an association model and a vector space model, and train them jointly from question-answer pairs.Our system PARASEMPRE improves stateof-the-art accuracies on two recently released question-answering datasets.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Efficient Estimation of Word Representations in Vector Space
Mikolov, T., Chen, K., Corrado, G., & Dean, J. (2013) · arXiv · doi:10.48550/arxiv.1301.3781 · Cited by 26,568
WordNet: An Electronic Lexical Database
Kilgarriff, A., & Fellbaum, C. (2000) · Language · doi:10.2307/417141 · Cited by 11,464
(2010) · Cited by 8,261
Incorporating non-local information into information extraction systems by Gibbs sampling
Finkel, J. R., Grenager, T., & Manning, C. (2005) · Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics - ACL '05 · doi:10.3115/1219840.1219885 · Cited by 3,008
Accurate unlexicalized parsing
Klein, D., & Manning, C. D. (2003) · Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - ACL '03 · doi:10.3115/1075096.1075150 · Cited by 3,008
Feature-rich part-of-speech tagging with a cyclic dependency network
Toutanova, K., Klein, D., Manning, C. D., & Singer, Y. (2003) · Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology - NAACL '03 · doi:10.3115/1073445.1073478 · Cited by 2,844
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
Self-citationIdentifying Relations for Open Information Extraction
Fader, A., Soderland, S. G., & Etzioni, O. (2011) · Cited by 1,144
Improving Word Representations via Global Context and Multiple Word Prototypes
Huang, E., Socher, R., Manning, C. D., & Ng, A. Y. (2012) · Cited by 1,073
The Alignment Template Approach to Statistical Machine Translation
Och, F. J., & Ney, H. (2004) · Computational Linguistics · doi:10.1162/0891201042544884 · Cited by 918
Dynamic Pooling and Unfolding Recursive Autoencoders for Paraphrase Detection
Socher, R., Huang, E., Pennin, J., Manning, C. D., & Ng, A. Y. (2011) · neural information processing systems · Cited by 782
Unsupervised construction of large paraphrase corpora: exploiting massively parallel news sources
Dolan, B., Quirk, C., & Brockett, C. (2004) · Proceedings of the 20th international conference on Computational Linguistics - COLING '04 · doi:10.3115/1220355.1220406 · Cited by 728
Zettlemoyer, L., & Collins, M. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1207.1420 · Cited by 728
Learning to parse database queries using inductive logic programming
Zelle, J. M., & Mooney, R. J. (1996) · Cited by 642
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
Large-scale Semantic Parsing via Schema Matching and Lexicon Extension
Cai, Q., & Yates, A. (2013) · Cited by 272
Choosing words in computer-generated weather forecasts
Reiter, E., Sripada, S., Hunter, J., Yu, J., & Davy, I. (2005) · Artificial Intelligence · doi:10.1016/j.artint.2005.06.006 · Cited by 262
Inducing Probabilistic CCG Grammars from Logical Form with Higher-Order Unification
Kwiatkowksi, T., Zettlemoyer, L., Goldwater, S. J., & Steedman, M. J. (2010) · Cited by 245
Tree Edit Models for Recognizing Textual Entailments, Paraphrases, and Answers to Questions
Heilman, M., & Smith, N. A. (2018) · doi:10.1184/r1/6473795 · Cited by 234
Scaling 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
Methods for using textual entailment in open-domain question answering
Harabagiu, S., & Hickl, A. (2006) · Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the ACL - ACL '06 · doi:10.3115/1220175.1220289 · Cited by 222
Paraphrase identification as probabilistic quasi-synchronous recognition
Das, D., & Smith, N. A. (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 1 - ACL-IJCNLP '09 · doi:10.3115/1687878.1687944 · Cited by 207
Recognizing textual entailment models and applications
Dagan, I. (2013) · Cited by 205
Recognizing Textual Entailment: Models and Applications
Dagan, I., Roth, D., Sammons, M., & Zanzotto, F. M. (2013) · Synthesis lectures on human language technologies · doi:10.2200/s00509ed1v01y201305hlt023 · Cited by 204
Robust textual inference via graph matching
Haghighi, A., Ng, A. Y., & Manning, C. D. (2005) · doi:10.3115/1220575.1220624 · Cited by 156
Lambda Dependency-Based Compositional SemanticsPreprint
Liang, P. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1309.4408 · Cited by 148
Self-citationWang, M., & Manning, C. D. (2010) · Cited by 146
Using Dependency-Based Features to Take the 'Para-farce' out of Paraphrase
Wan, S., Dras, M., Dale, R., & Paris, C. L. (2006) · Cited by 141
Lin, T., & Etzioni, O. (2012) · Cited by 103
Investigating a Generic Paraphrase-Based Approach for Relation Extraction
Romano, L., Kouylekov, M., Szpektor, I., Dagan, I., & Lavelli, A. (2006) · Cited by 91
Generating Approximate Geographic Descriptions
Turner, R., Sripada, S. G., & Reiter, E. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-15573-4_7 · Cited by 91
CORAL: Using Natural Language Generation for Navigational Assistance
Dale, R., Geldof, S., & Prost, J.-P. (2003) · Cited by 74
Discriminative Learning over Constrained Latent Representations
Chang, M., Goldwasser, D., Roth, D., & Srikumar, V. (2010) · North American Chapter of the Association for Computational Linguistics · Cited by 67
Generating approximate geographic descriptions
Turner, R., Sripada, Y., & Reiter, E. (2009) · doi:10.3115/1610195.1610202 · Cited by 22
Varieties of Question Generation: Introduction to this Special Issue
Piwek, P., & Boyer, K. E. (2012) · Open Research Online - ORO (The Open University) · Cited by 19
Cited by
Liu, P., Yuan, W., Fu, J., Jiang, Z., Hayashi, H., & Neubig, G. (2023) · ACM Computing Surveys · doi:10.1145/3560815 · Cited by 4,361
“[124] explore the task of few-shot semantic parsing using LMs by (1) framing the semantic parsing task as a paraphrasing task [7] and (2) constraining the decoding process by only allowing output valid according to a grammar.”
MethodStacked Attention Networks for Image Question Answering
Yang, Z., He, X., Gao, J., Deng, L., & Smola, A. (2016) · 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2016.10 · Cited by 1,998
Yu, T., Zhang, R., Yang, K., Yasunaga, M., Wang, D., Li, Z., Ma, J., Li, I., Yao, Q., Roman, S., et al. (2018) · Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/d18-1425 · Cited by 1,034
Semantic Parsing via Staged Query Graph Generation: Question Answering with Knowledge Base
Yih, W.-T., Chang, M.-W., He, X., & Gao, J. (2015) · Proceedings of the 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing (Volume 1: Long Papers) · doi:10.3115/v1/p15-1128 · Cited by 756
Ask, Attend and Answer: Exploring Question-Guided Spatial Attention for Visual Question Answering
Xu, H., & Saenko, K. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-46478-7_28 · Cited by 727
Metadata
- Authors
- Berant, J., & Liang, P.
- Venue
- Proceedings of the 52nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
- Published
- 2014
- Pages
- 1415-1425
- OpenAlex
- W2250225488
- Cited by
- 495
- References
- 36
- FWCI
- 39.13
- Type
- conference paper
- Language
- en
- Open access
- hybrid
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.