The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
Abstract Syntax Networks for Code Generation and Semantic Parsing
Open accessAbstract
Tasks like code generation and semantic parsing require mapping unstructured (or partially structured) inputs to well-formed, executable outputs.We introduce abstract syntax networks, a modeling framework for these problems.The outputs are represented as abstract syntax trees (ASTs) and constructed by a decoder with a dynamically-determined modular structure paralleling the structure of the output tree.On the benchmark HEARTHSTONE dataset for code generation, our model obtains 79.2 BLEU and 22.7% exact match accuracy, compared to previous state-ofthe-art values of 67.1 and 6.1%.Furthermore, we perform competitively on the ATIS, JOBS, and GEO semantic parsing datasets with no task-specific engineering.* Equal contribution.name: [ 'D', 'i', 'r', 'e', ' ', 'W', 'o', 'l', 'f', ' ', 'A', 'l', 'p', 'h', 'a'] cost: ['2'] type: ['Minion'] rarity: ['Common'] race: ['Beast'] class: ['Neutral'] description: [ 'Adjacent', 'minions', 'have', '+', '1', 'Attack', '.'] health: ['2'] attack: ['2'] durability: ['-1'] class DireWolfAlpha(MinionCard): def __init__(self): super().__init__("Dire Wolf Alpha", 2, CHARACTER_CLASS.ALL, CARD_RARITY.COMMON, minion_type=MINION_TYPE.BEAST) def create_minion(self, player): return Minion(2, 2, auras=[ Aura(ChangeAttack(1), MinionSelector(Adjacent())) ])
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
Adam: A Method for Stochastic Optimization
Kingma, D. P., & Ba, J. (2014) · arXiv · doi:10.48550/arxiv.1412.6980 · Cited by 98,946
Neural Machine Translation by Jointly Learning to Align and Translate
Bahdanau, D., Cho, K., & Bengio, Y. (2014) · arXiv · doi:10.48550/arxiv.1409.0473 · Cited by 16,213
(2010) · Cited by 14,134
Compilers: Principles, Techniques, and Tools
Aho, A. V., Sethi, R., & Ullman, J. D. (1986) · Cited by 8,453
Natural language processing with Python
Bird, S., Klein, E., & Loper, E. (2009) · CERN Document Server (European Organization for Nuclear Research) · Cited by 3,955
Introduction to the Theory of Computation
Sipser, M. (1996) · ACM SIGACT News · doi:10.1145/230514.571645 · Cited by 2,784
A neural probabilistic language model
BengioYoshua, DucharmeRéjean, VincentPascal, & JanvinChristian (2003) · Journal of Machine Learning Research · doi:10.5555/944919.944966 · Cited by 2,644
A Fast and Accurate Dependency Parser using Neural Networks
Chen, D., & Manning, C. (2014) · Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.3115/v1/d14-1082 · Cited by 1,795
Andreas, J., Rohrbach, M., Darrell, T., & Klein, D. (2016) · 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2016.12 · Cited by 908
Self-citationZettlemoyer, L., & Collins, M. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1207.1420 · Cited by 728
Language to Logical Form with Neural Attention
Dong, L., & Lapata, M. (2016) · Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · doi:10.18653/v1/p16-1004 · Cited by 700
Learning Dependency-Based Compositional Semantics
Liang, P., Jordan, M. I., & Klein, D. (2013) · Computational Linguistics · doi:10.1162/coli_a_00127 · Cited by 546
Self-citationRecurrent Neural Network Grammars
Dyer, C., Kuncoro, A., Ballesteros, M., & Smith, N. A. (2016) · Proceedings of the 2016 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies · doi:10.18653/v1/n16-1024 · Cited by 517
Towards a theory of natural language interfaces to databases
Popescu, A.-M., Etzioni, O., & Kautz, H. (2003) · Proceedings of the 8th international conference on Intelligent user interfaces · doi:10.1145/604045.604070 · Cited by 514
Vinyals, O., Kaiser, L., Koo, T., Petrov, S., Sutskever, I., & Hinton, G. (2014) · arXiv · doi:10.48550/arxiv.1412.7449 · Cited by 464
Compilers: Principles, Techniques, and Tools (2nd Edition)
Aho, A. V., Lam, M. S., Sethi, R., & Ullman, J. D. (2006) · Addison-Wesley Longman Publishing Co., Inc. eBooks · Cited by 387
Online Learning of Relaxed CCG Grammars for Parsing to Logical Form
Zettlemoyer, L., & Collins, M. (2007) · Cited by 387
Latent Predictor Networks for Code Generation
Ling, W., Blunsom, P., Grefenstette, E., Hermann, K. M., Kočiský, T., Wang, F., & Senior, A. (2016) · Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · doi:10.18653/v1/p16-1057 · Cited by 307 · cited 13×
“Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics, pages 1139–1149 Vancouver, Canada, July 30 - August 4, 2017. c©2017 Association for Computational Linguistics https://doi.org/10.18653/v1/P17-1105 Abstract Syntax Networks for Code Generation and Semantic Parsing Maxim Rabinovich∗…”
BackgroundMethodResultInfluentialDyNet: The Dynamic Neural Network Toolkit
Neubig, G., Dyer, C., Goldberg, Y., Matthews, A., Ammar, W., Anastasopoulos, A., Ballesteros, M., Chiang, D., Clothiaux, D., Cohn, T., et al. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1701.03980 · Cited by 302
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
DeepCoder: Learning to Write Programs
Balog, M., Gaunt, A. L., Brockschmidt, M., Nowozin, S., & Tarlow, D. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1611.01989 · Cited by 212
A Machine Learning Framework for Programming by Example
Menon, A. K., Tamuz, O., Gulwani, S., Lampson, B., & Kalai, A. T. (2013) · International Conference on Machine Learning · Cited by 186
Structured Generative Models of Natural Source CodePreprint
Maddison, C. J., & Tarlow, D. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1401.0514 · Cited by 180
Bimodal Modelling of Source Code and Natural Language
Allamanis, M., Tarlow, D., Gordon, A. D., & Wei, Y. (2015) · Edinburgh Research Explorer (University of Edinburgh) · Cited by 164
Integrating Selectional Constraints and Subcategorization Frames in a Dependency Parser
(2016) · HAL · doi:10.1162/coli · Cited by 135
Span-Based Constituency Parsing with a Structure-Label System and Provably Optimal Dynamic Oracles
Cross, J., & Huang, L. (2016) · Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.18653/v1/d16-1001 · Cited by 119
Tree-structured decoding with doubly-recurrent neural networks
Alvarez-Melis, D., & Jaakkola, T. (2017) · Digital Access to Scholarship at Harvard (DASH) (Harvard University) · Cited by 84
Latent Predictor Networks for Code GenerationPreprint
Ling, W., Grefenstette, E., Hermann, K. M., Kočiský, T., Senior, A., Wang, F., & Blunsom, P. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1603.06744 · Cited by 82
The Zephyr abstract syntax description language
Wang, D. C., Appel, A. W., Korn, J. L., & Serra, C. S. (1997) · Conference on Domain-Specific Languages · Cited by 81
Learning Programs: A Hierarchical Bayesian Approach
Liang, P., Jordan, M. I., & Klein, D. (2010) · Cited by 80
Self-citationTowards a theory of natural language interfaces to databases
Popescu, A.-M., Etzioni, O., & Kautz, H. (2003) · ACM International Conference on Intelligent User Interfaces (IUI) · doi:10.1145/604110.604120 · Cited by 71
Type-Driven Incremental Semantic Parsing with Polymorphism
Zhao, K., & Huang, L. (2015) · Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (NAACL-HLT) · doi:10.3115/v1/n15-1162 · Cited by 56
Morpho-syntactic Lexical Generalization for CCG Semantic Parsing
Wang, A., Kwiatkowski, T., & Zettlemoyer, L. (2014) · Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.3115/v1/d14-1135 · Cited by 42
Cited by
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
“These tasks parse natural language descriptions into a more general-purpose programming language such as Python (Allamanis et al., 2015; Ling et al., 2016; Rabinovich et al., 2017; Yin and Neu-big, 2017).”
BackgroundGraphCodeBERT: Pre-training Code Representations with Data Flow
Guo, D., Ren, S., Lu, S., Feng, Z., Tang, D., Liu, S., Zhou, L., Duan, N., Svyatkovskiy, A., Fu, S., et al. (2020) · arXiv · doi:10.48550/arxiv.2009.08366 · Cited by 480
Coarse-to-Fine Decoding for Neural Semantic Parsing
Dong, L., & Lapata, M. (2018) · Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · doi:10.18653/v1/p18-1068 · Cited by 374
CodeBLEU: a Method for Automatic Evaluation of Code Synthesis
Ren, S., Guo, D., Lu, S., Zhou, L., Liu, S., Tang, D., Sundaresan, N., Zhou, M., Blanco, A., & Ma, S. (2020) · arXiv · doi:10.48550/arxiv.2009.10297 · Cited by 214
“In contrast, code has a natural tree structure and needs to be compiled according to their abstract syntax tree (Rabinovich, Stern, and Klein 2017).”
BackgroundTRANX: A Transition-based Neural Abstract Syntax Parser for Semantic Parsing and Code Generation
Yin, P., & Neubig, G. (2018) · Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing: System Demonstrations · doi:10.18653/v1/d18-2002 · Cited by 203
Metadata
- Authors
- Rabinovich, M., Stern, M., & Klein, D.
- Venue
- Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
- Published
- 2017
- Pages
- 1139-1149
- OpenAlex
- W2962728167
- Cited by
- 312
- References
- 33
- Type
- conference abstract
- 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.