skip to main content
10.1145/3397537.3398483acmotherconferencesArticle/Chapter ViewAbstractPublication PagesprogrammingConference Proceedingsconference-collections
short-paper

N-gram models for code completion in Pharo

Published:04 August 2020Publication History

ABSTRACT

In this paper, I present applying statistical language models to improve code completion in Pharo. In particular, the goal is to use n-gram models for sorting the completion candidates and, in such a way, increase the relevancy of the suggested completions.

References

  1. Marcel Bruch, Martin Monperrus, and Mira Mezini. 2009. Learning from examples to improve code completion systems. In Proceedings of the 7th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on the foundations of software engineering. 213–222.Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Vincent J Hellendoorn and Premkumar Devanbu. 2017. Are deep neural networks the best choice for modeling source code?. In Proceedings of the 2017 11th Joint Meeting on Foundations of Software Engineering. 763–773.Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Abram Hindle, Earl T Barr, Zhendong Su, Mark Gabel, and Premkumar Devanbu. 2012. On the naturalness of software. In Software Engineering (ICSE), 2012 34th International Conference on. IEEE, 837–847.Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Jian Li, Yue Wang, Michael R Lyu, and Irwin King. 2017. Code completion with neural attention and pointer networks. arXiv preprint arXiv:1711.09573 (2017).Google ScholarGoogle Scholar
  5. Veselin Raychev, Martin Vechev, and Eran Yahav. 2014. Code completion with statistical language models. In Acm Sigplan Notices, Vol. 49. ACM, 419–428.Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Romain Robbes and Michele Lanza. 2008. How Program History Can Improve Code Completion. In Proceedings of ASE 2008 (23rd International Conference on Automated Software Engineering). 317–326.Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Zhaopeng Tu, Zhendong Su, and Premkumar Devanbu. 2014. On the localness of software. In Proceedings of the 22nd ACM SIGSOFT International Symposium on Foundations of Software Engineering. 269–280.Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. N-gram models for code completion in Pharo

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Other conferences
      Programming '20: Companion Proceedings of the 4th International Conference on Art, Science, and Engineering of Programming
      March 2020
      228 pages
      ISBN:9781450375078
      DOI:10.1145/3397537

      Copyright © 2020 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 4 August 2020

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • short-paper

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader