Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

The DOI matches its Crossref record; 53 of the 53 references it cites were found in a registry or an index.

Learning to mine aligned code and natural language pairs from stack overflow

Open access
Yin, Pengcheng, Deng, Bowen, Chen, Edgar, Vasilescu, Bogdan, Neubig, Graham · 2018 · Proceedings of the 15th International Conference on Mining Software Repositories

Abstract

For tasks like code synthesis from natural language, code retrieval, and code summarization, data-driven models have shown great promise. However, creating these models require parallel data between natural language (NL) and code with fine-grained alignments. Stack Overflow (SO) is a promising source to create such a data set: the questions are diverse and most of them have corresponding answers with high quality code snippets. However, existing heuristic methods (e.g., pairing the title of a post with the code in the accepted answer) are limited both in their coverage and the correctness of the NL-code pairs obtained. In this paper, we propose a novel method to mine high-quality aligned data from SO using two sets of features: hand-crafted features considering the structure of the extracted snippets, and correspondence features obtained by training a probabilistic model to capture the correlation between NL and code using neural networks. These features are fed into a classifier that determines the quality of mined NL-code pairs. Experiments using Python and Java as test beds show that the proposed method greatly expands coverage and accuracy over existing mining methods, even when using only a small number of labeled examples. Further, we find that reasonable results are achieved even when training the classifier on one language and testing on another, showing promise for scaling NL-code mining to a wide variety of programming languages beyond those for which we are able to annotate data.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/3196398.3196408

Cites

53 of 53 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

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 · cited 1×

    “vent overfitting, on the input of the last softmax layer over target words (p = 0.5), and recurrent dropout [11] on RNNs (p = 0.2). We train the network using the widely used optimization method Adam [18]. To evaluate the neural network, we use the remaining 10% of pairs left aside for testing, retaining the model wit…”
    MethodInfluential
  • Untitled work

    (2014) · Cited by 33,419

  • Sequence to Sequence Learning with Neural Networks

    Sutskever, I., Vinyals, O., & Le, Q. V. (2014) · arXiv · doi:10.48550/arxiv.1409.3215 · Cited by 17,766 · cited 1×

    “So how do neural MT models calculate this probability? We will explain a basic outline of a basic model called the encoder-decoder model [39], and refer readers to references for details [4, 25, 39].”
    Background
  • Effective Approaches to Attention-based Neural Machine Translation

    Luong, T., Pham, H., & Manning, C. D. (2015) · Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/d15-1166 · Cited by 8,382 · cited 1×

    “allows the model to “focus” on particular words in the source snippet S when generating the intent I. The details of attention are beyond the scope of this paper, but interested readers can reference [4, 22]. Why attentional neural MT models?: Attention-based neural MT models are well-suited to the task of learning co…”
    Background
  • Learning deep structured semantic models for web search using clickthrough data

    Huang, P.-S., He, X., Gao, J., Deng, L., Acero, A., & Heck, L. (2013) · Proceedings of the 22nd ACM international conference on Information & Knowledge Management · doi:10.1145/2505515.2505665 · Cited by 2,009 · cited 1×

    “Second, they are powerful models that can learn correspondences on a variety of levels; from simple phenomena such as direct word-by-word matches [12], to soft paraphrases [36], to weak correspondences between keywords and large documents for information retrieval [14].”
    Background
  • International Conference on Learning Representations (ICLR)

    Abbas, M. Z. A., Kivinen, J., & Raiko, T. (2016) · Cited by 1,694

  • Incorporating Copying Mechanism in Sequence-to-Sequence Learning

    Gu, J., Lu, Z., Li, H., & Li, V. O. K. (2016) · Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · doi:10.18653/v1/p16-1154 · Cited by 1,446 · cited 1×

    “classifier, as described in the following paragraph. Second, they are powerful models that can learn correspondences on a variety of levels; from simple phenomena such as direct word-by-word matches [12], to soft paraphrases [36], to weak correspondences between keywords and large documents for information retrieval […”
    Background
  • Statistical machine translation

    (2010) · Choice Reviews Online · doi:10.5860/choice.47-6293 · Cited by 1,309

  • Recurrent Continuous Translation Models

    Kalchbrenner, N., & Blunsom, P. (2013) · Proceedings of the 2013 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/d13-1176 · Cited by 1,232 · cited 1×

    “between natural language and code for the purposes of code summarization [15, 30], code synthesis from natural language [21], and code retrieval [3]. In particular, we use a model based on neural MT [4, 17], a method for MT based on neural networks that is well-suited for this task of learning correspondences for a va…”
    Method
  • Get another label? improving data quality and data mining using multiple, noisy labelers

    Sheng, V. S., Provost, F., & Ipeirotis, P. G. (2008) · Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1401890.1401965 · Cited by 1,165 · cited 1×

    “However, the statistical models that power many such applications are only as useful as the data they are trained on, i.e. , garbage in, garbage out [35].”
    Background

Show all 51 references

Research works printed but not linked: 7

  1. 10.5555/2819009.2819143 · doi:10.5555/2819009.2819143
  2. Gal Yarin, 2016, Annual Conference on Neural Information Processing Systems (NIPS). 1019--1027
  3. Diederik, 2014, Kingma and Jimmy Ba
  4. Lin Xi Victoria, 2018, International Conference on Language Resources and Evaluation (LREC)
  5. Luong Thang, Conference on Empirical Methods in Natural Language Processing (EMNLP). ACL, 1412--1421
  6. 10.5555/2627435.2670313 · doi:10.5555/2627435.2670313
  7. 10.5555/2666719.2666728 · doi:10.5555/2666719.2666728

Cited by

See all 228

Metadata

Authors
Yin, P., Deng, B., Chen, E., Vasilescu, B., & Neubig, G.
Affiliations
Carnegie Mellon University (US)
Venue
Proceedings of the 15th International Conference on Mining Software Repositories
Publisher
ACM
Published
2018-05-28
Pages
476-486
OpenAlex
W2964315653
Cited by
218
References
51
Citations by year
2026: 17 · 2025: 20 · 2024: 32 · 2023: 33 · 2022: 28 · 2021: 35 · 2020: 37 · 2019: 14 · 2018: 2
FWCI
17.27
Type
conference paper
Language
en
Open access
Locations
  • International Conference on Mining Software Repositories (MSR) (publishedVersion)
  • arXiv (Cornell University) (submittedVersion, other-oa)
  • arXiv (Cornell University)
Topics
  • Physical Sciences › Computer Science › Information Systems › Software Engineering Research
  • Physical Sciences › Computer Science › Artificial Intelligence › Natural Language Processing Techniques
  • Physical Sciences › Computer Science › Computer Science Applications › Teaching and Learning Programming
Keywords
Stack Overflow, code mining, code search, code summarization, program synthesis, stochastic modeling, handcrafted features, cross-lingual generalization, programming languages

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Learning to mine aligned code and natural language pairs from stack overflow. https://app.cochat.ai/papers/10.1145/3196398.3196408
The paper
Yin, P., Deng, B., Chen, E., Vasilescu, B., & Neubig, G. (2018). Learning to mine aligned code and natural language pairs from stack overflow. Proceedings of the 15th International Conference on Mining Software Repositories. https://doi.org/10.1145/3196398.3196408

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.