{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/learning-to-mine-aligned-code-and-natural","title":"Learning to Mine Aligned Code and Natural Language Pairs from Stack Overflow","arxiv_id":"1805.08949","date":"2018-05-23","proceeding":null,"authors":["Pengcheng Yin","Bowen Deng","Edgar Chen","Bogdan Vasilescu","Graham Neubig"],"abstract":"For tasks like code synthesis from natural language, code retrieval, and code\nsummarization, data-driven models have shown great promise. However, creating\nthese models require parallel data between natural language (NL) and code with\nfine-grained alignments. Stack Overflow (SO) is a promising source to create\nsuch a data set: the questions are diverse and most of them have corresponding\nanswers with high-quality code snippets. However, existing heuristic methods\n(e.g., pairing the title of a post with the code in the accepted answer) are\nlimited both in their coverage and the correctness of the NL-code pairs\nobtained. In this paper, we propose a novel method to mine high-quality aligned\ndata from SO using two sets of features: hand-crafted features considering the\nstructure of the extracted snippets, and correspondence features obtained by\ntraining a probabilistic model to capture the correlation between NL and code\nusing neural networks. These features are fed into a classifier that determines\nthe quality of mined NL-code pairs. Experiments using Python and Java as test\nbeds show that the proposed method greatly expands coverage and accuracy over\nexisting mining methods, even when using only a small number of labeled\nexamples. Further, we find that reasonable results are achieved even when\ntraining the classifier on one language and testing on another, showing promise\nfor scaling NL-code mining to a wide variety of programming languages beyond\nthose for which we are able to annotate data.","url_abs":"http://arxiv.org/abs/1805.08949v1","url_pdf":"http://arxiv.org/pdf/1805.08949v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[],"tasks":[{"task_slug":"code-summarization-1","task_name":"Code Summarization"},{"task_slug":"retrieval","task_name":"Retrieval"},{"task_slug":"code-summarization","task_name":"Source Code Summarization"}],"methods":[],"datasets_introduced":[{"slug":"conala","name":"CoNaLa","full_name":"CMU CoNaLa, the Code/Natural Language Challenge"}],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1805.08949","atlas_url":"https://app.syntology.ai/?focus=1805.08949","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1805.08949"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1805.08949\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1805.08949"},"call":"get_concepts_for_paper(arxiv_id=\"1805.08949\")"}],"by_repo":[],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":"the archive holds no code link for this paper","arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"f09ce0f53c3e52d4f7af5dac4da3e5f9fc91bf88bdd6d47f71d9f81f630bd33b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}