mlsanityData to 14 Oct 2026

Incorporating Domain Knowledge through Task Augmentation for Front-End JavaScript Code Generation

arXiv 2208.10091 ↗First posted 22 Aug 2022cs.SE cs.AIcited by 11

Not on the map. Why?

Abstract (arXiv)

Code generation aims to generate a code snippet automatically from natural language descriptions. Generally, the mainstream code generation methods rely on a large amount of paired training data, including both the natural language description and the code. However, in some domain-specific scenarios, building such a large paired corpus for code generation is difficult because there is no directly available pairing data, and a lot of effort is required to manually write the code descriptions to construct a high-quality training dataset. Due to the limited training data, the generation model cannot be well trained and is likely to be overfitting, making the model's performance unsatisfactory for real-world use. To this end, in this paper, we propose a task augmentation method that incorporates domain knowledge into code generation models through auxiliary tasks and a Subtoken-TranX model by extending the original TranX model to support subtoken-level code generation. To verify our proposed approach, we collect a real-world code generation dataset and conduct experiments on it. Our experimental results demonstrate that the subtoken-level TranX model outperforms the original TranX model and the Transformer model on our dataset, and the exact match accuracy of Subtoken-TranX improves significantly by 12.75% with the help of our task augmentation method. The model performance on several code categories has satisfied the requirements for application in industrial systems. Our proposed approach has been adopted by Alibaba's BizCook platform. To the best of our knowledge, this is the first domain code generation system adopted in industrial development environments.

Key facts. Cited by 11 papers in the map (data through 14 Oct 2026). Builds on 22 of its 28 references that are in the map. First posted on arXiv 22 Aug 2022.

Builds on

22 of 28 references.

References · 22

  1. 2017Attention Is All You Needcited by 60,361
  2. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  3. 2015Neural Machine Translation of Rare Words with Subword Unitscited by 2,918
  4. 2015Effective Approaches to Attention-based Neural Machine Translationcited by 1,026
  5. 2021CodeT5: Identifier-aware Unified Pre-trained Encoder-Decoder Models for Code Understanding and Generationcited by 906
  6. 2021CodeXGLUE: A Machine Learning Benchmark Dataset for Code Understanding and Generationcited by 744
  7. 2021Unified Pre-training for Program Understanding and Generationcited by 366
  8. 2020IntelliCode Compose: Code Generation Using Transformercited by 227
  9. 2016Language to Logical Form with Neural Attentioncited by 158
  10. 2018Coarse-to-Fine Decoding for Neural Semantic Parsingcited by 110
  11. 2017Abstract Syntax Networks for Code Generation and Semantic Parsingcited by 92
  12. 2018TRANX: A Transition-based Neural Abstract Syntax Parser for Semantic Parsing and Code Generationcited by 88
10 more
  1. 2020PyMT5: multi-mode translation of natural language and Python code with transformerscited by 80
  2. 2016Latent Predictor Networks for Code Generationcited by 73
  3. 2018A Retrieve-and-Edit Framework for Predicting Structured Outputscited by 73
  4. 2018Guiding Neural Machine Translation with Retrieved Translation Piecescited by 63
  5. 2019TreeGen: A Tree-Based Transformer Architecture for Code Generationcited by 58
  6. 2018Retrieval-Based Neural Code Generationcited by 41
  7. 2020Incorporating External Knowledge through Pre-training for Natural Language to Code Generationcited by 36
  8. 2018A Grammar-Based Structural CNN Decoder for Code Generationcited by 29
  9. 2021Improving Tree-Structured Decoder Training for Code Generation via Mutual Learningcited by 10
  10. 2021Exploring Dynamic Selection of Branch Expansion Orders for Code Generationcited by 10

Built on by

Cited by year

Citing papers per year: 2022: 1; 2023: 5; 2024: 5.

11 papers.