An Empirical Study on the Usage of Transformer Models for Code Completion
| Autor: | Ciniselli, Matteo, Cooper, Nathan, Pascarella, Luca, Mastropaolo, Antonio, Aghajani, Emad, Poshyvanyk, Denys, Di Penta, Massimiliano, Bavota, Gabriele |
|---|---|
| Rok vydání: | 2021 |
| Předmět: | |
| Druh dokumentu: | Working Paper |
| DOI: | 10.1109/TSE.2021.3128234 |
| Popis: | Code completion aims at speeding up code writing by predicting the next code token(s) the developer is likely to write. Works in this field focused on improving the accuracy of the generated predictions, with substantial leaps forward made possible by deep learning (DL) models. However, code completion techniques are mostly evaluated in the scenario of predicting the next token to type, with few exceptions pushing the boundaries to the prediction of an entire code statement. Thus, little is known about the performance of state-of-the-art code completion approaches in more challenging scenarios in which, for example, an entire code block must be generated. We present a large-scale study exploring the capabilities of state-of-the-art Transformer-based models in supporting code completion at different granularity levels, including single tokens, one or multiple entire statements, up to entire code blocks (e.g., the iterated block of a for loop). We experimented with several variants of two recently proposed Transformer-based models, namely RoBERTa and the Text-To-Text Transfer Transformer (T5), for the task of code completion. The achieved results show that Transformer-based models, and in particular the T5, represent a viable solution for code completion, with perfect predictions ranging from ~29%, obtained when asking the model to guess entire blocks, up to ~69%, reached in the simpler scenario of few tokens masked from the same code statement. Comment: arXiv admin note: substantial text overlap with arXiv:2103.07115 |
| Databáze: | arXiv |
| Externí odkaz: |
|