Methods › Natural Language Processing › Code Generation Transformers › CuBERT

CuBERT

3 papers tagged archive 2025-07-28

Introduced by Aditya Kanade et al. in Learning and Evaluating Contextual Embedding of Source Code

archive 2025-07-28 Description, source and code snippet are the archive's method entry.

CuBERT, or Code Understanding BERT, is a BERT based model for code understanding. In order to achieve this, the authors curate a massive corpus of Python programs collected from GitHub. GitHub projects are known to contain a large amount of duplicate code. To avoid biasing the model to such duplicated code, authors perform deduplication using the method of Allamanis (2018). The resulting corpus has 7.4 million files with a total of 9.3 billion tokens (16 million unique).

PaperSource

In Syntology name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.

Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.

Papers archive 2025-07-28

archive papers tagged: 3 · with a code link: 1 · where Syntology ran a sample: 0 (0 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran: none of the 3 tagged papers has a Syntology run on record

Page 1 of 1: papers 1 to 3 of 3, newest first by the archive's date (ties by slug), in archive order.

Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.

Tasks archive 2025-07-28

15 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.

TaskPapers
Clone Detection1
Code Search1
Code Translation1
Contextual Embedding for Source Code1
Contrastive Learning1
Exception type1
Function-docstring mismatch1
Language Modelling1
Natural Language Understanding1
Program Repair1
Representation Learning1
Swapped operands1
Type prediction1
Variable misuse1
Wrong binary operator1

Usage over time archive 2025-07-28

Papers per year tagged with CuBERT: 2019 to 2025, peak 1 1 0 2019: 1 paper 2019 2020: 0 papers 2020 2021: 1 paper 2021 2022: 0 papers 2022 2023: 0 papers 2023 2024: 0 papers 2024 2025: 1 paper 2025
Papers per year the archive tags with this method, by the paper's archive date (3 dated). Bars are counts, not a trend claim.

Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).

Categories archive 2025-07-28

Code Generation TransformersAutoencoding TransformersLanguage Models

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections