Intelligent Code Completion with Bayesian Networks
The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
Code completion is an integral part of modern Integrated Development Environments (IDEs). Developers often use it to explore Application Programming Interfaces (APIs). It is also useful to reduce the required amount of typing and to help avoid typos. Traditional code completion systems propose all type-correct methods to the developer. Such a list is often very long with many irrelevant items. More intelligent code completion systems have been proposed in prior work to reduce the list of proposed methods to relevant items. This work extends one of these existing approaches, the Best Matching Neighbor (BMN) algorithm. We introduce Bayesian networks as an alternative underlying model, use additional context information for more precise recommendations, and apply clustering techniques to improve model sizes. We compare our new approach, Pattern-based Bayesian Networks (PBN), to the existing BMN algorithm. We extend previously used evaluation methodologies and, in addition to prediction quality, we also evaluate model size and inference speed. Our results show that the additional context information we collect improves prediction quality, especially for queries that do not contain method calls. We also show that PBN can obtain comparable prediction quality to BMN, while model size and inference speed scale better with large input sizes.
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.
Integrity signals
Registry
Cites
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.
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
The Usability Engineering Lifecycle
NIELSEN, J. (1993) · Usability Engineering · doi:10.1016/b978-0-08-052029-2.50007-3 · Cited by 2,657
Research works printed but not linked: 30
- 10.1145/1454247.1454267 · doi:10.1145/1454247.1454267
- 10.1145/1595696.1595728 · DOI · Paper page
- 10.1145/1188835.1188847 · DOI
- Raymond P., Proceedings of the International Conference on Software Engineering (ICSE'12)
- 10.1145/1526709.1526711 · DOI · Paper page
- 10.3115/981863.981904 · DOI · Paper page
- 10.1109/TIT.1967.1053964 · DOI · Paper page
- 10.1145/2491956.2462192 · DOI · Paper page
- 10.1109/CSMR.2012.14 · DOI
- 10.5555/2337223.2337322 · doi:10.5555/2337223.2337322
- 10.1145/1081706.1081755 · DOI · Paper page
- 10.1145/1081706.1081754 · DOI · Paper page
- Robert Cecil Martin. 2003. Agile Software Development: Principles Patterns and Practices. Prentice Hall PTR Upper Saddle River NJ. Robert Cecil Martin. 2003. Agile Software Development: Principles Patterns and Practices. Prentice Hall PTR Upper Saddle River NJ.
- 10.1145/347090.347123 · DOI · Paper page
- 10.1145/337180.337200 · doi:10.1145/337180.337200
- 10.5555/1883978.1883982 · doi:10.5555/1883978.1883982
- 10.1145/2491411.2491415 · DOI · Paper page
- Nguyen Anh Tuan, Proceedings of the International Conference on Software Engineering (ICSE'12)
- 10.1145/1595696.1595767 · DOI · Paper page
- 10.1145/2593822.2593827 · DOI
- Rish Irina, 2001, Proceedings of the Workshop on Empirical Methods in Artificial Intelligence (IJCAI'01)
- 10.1109/TSE.2012.63 · DOI · Paper page
- Michael Schultz J., 1999, Proceedings of the DARPA Broadcast News Workshop. Morgan Kaufmann Publishers, 189--192
- 10.1145/53990.54007 · DOI
- Shivers Olin, Topics in Advanced Language Implementation
- 10.1145/115865.115884 · DOI
- Strehl Alexander, 2000, Proceedings of the Workshop on Artificial Intelligence for Web Search (AAAI'00)
- 10.1109/INFCOM.2011.5935224 · DOI
- 10.5555/2337223.2337321 · doi:10.5555/2337223.2337321
- 10.1109/APSEC.2008.54 · DOI
Cited by
WILDS: A Benchmark of in-the-Wild Distribution Shifts
Koh, P. W., Sagawa, S., Marklund, H., Xie, S. M., Zhang, M., Balsubramani, A., Hu, W., Yasunaga, M., Phillips, R. L., Gao, I., et al. (2020) · arXiv · doi:10.48550/arxiv.2012.07421 · Cited by 518
“Code completion models—autocomplete tools used by programmers to suggest subsequent source code tokens, such as the names of API calls—are commonly used to reduce the effort of software development (Robbes & Lanza, 2008; Bruch et al., 2009; Nguyen & Nguyen, 2015; Proksch et al., 2015; Franks et al., 2015).”
IntelliCode compose: code generation using transformer
Svyatkovskiy, A., Deng, S. K., Fu, S., & Sundaresan, N. (2020) · Proceedings of the 28th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering · doi:10.1145/3368089.3417058 · Cited by 474
“A large number of intelligent code completion systems for both statically and dynamically typed languages have been proposed [6, 11, 41, 42].”
BackgroundPythia: AI-assisted Code Completion System
Svyatkovskiy, A., Zhao, Y., Fu, S., & Sundaresan, N. (2019) · Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining · doi:10.1145/3292500.3330699 · Cited by 169
Fast and Memory-Efficient Neural Code Completion
Svyatkovskiy, A., Lee, S., Hadjitofi, A., Riechert, M., Franco, J. V., & Allamanis, M. (2021) · 2021 IEEE/ACM 18th International Conference on Mining Software Repositories (MSR) · doi:10.1109/msr52588.2021.00045 · Cited by 95
A Survey of Machine Learning for Big Code and Naturalness
Allamanis, M., Barr, E. T., Devanbu, P., & Sutton, C. (2019) · ACM Computing Surveys · doi:10.1145/3212695 · Cited by 150
Metadata
- Authors
- Proksch, S., Lerch, J., & Mezini, M.
- Venue
- ACM Transactions on Software Engineering and Methodology
- Published
- 2015-12-02
- Volume
- 25
- Issue
- 1
- Pages
- 1-31
- ISSN
- 1049-331X (ISSN-L)
- 1557-7392
- OpenAlex
- W2266912522
- Cited by
- 81
- References
- 1
- FWCI
- 17.12
- Type
- journal article
- Language
- en
- Open access
- closed
- Funders
- German Federal Ministry of Education and Research (01IS12054 and EC SPRIDE)
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
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.