Code Completion From Abbreviated Input
Name
Han-2009-Code Completion From Abbreviated Input.pdf
Size
875.69 KB
Format
Adobe PDF
Checksum (MD5)
fa7859516735aaa528df01bd69524cc5
Author(s)
Miller, Robert C.
Han, Sangmok
Wallace, David Robert
Date Issued
March 2010
Journal
24th IEEE/ACM International Conference on Automated Software Engineering
Publisher
Institute of Electrical and Electronics Engineers
Citation
Sangmok Han, D.R. Wallace, and R.C. Miller. “Code Completion from Abbreviated Input.” Automated Software Engineering, 2009. ASE '09. 24th IEEE/ACM International Conference on. 2009. 332-343. © 2010 Institute of Electrical and Electronics Engineers.
Version
Final published version
Abstract
Abbreviation Completion is a novel technique to improve the efficiency of code-writing by supporting code completion of multiple keywords based on non-predefined abbreviated input - a different approach from conventional code completion that finds one keyword at a time based on an exact character match. Abbreviated input is expanded into keywords by a Hidden Markov Model learned from a corpus of existing code. The technique does not require the user to memorize abbreviations and provides incremental feedback of the most likely completions. This paper presents the algorithm for abbreviation completion, integrated with a new user interface for multiple-keyword completion. We tested the system by sampling 3000 code lines from open source projects and found that more than 98% of the code lines could be resolved from acronym-like abbreviations. A user study found 30% reduction in time usage and 41% reduction of keystrokes over conventional code completion.
Subjects
Multiple Keywords
Hidden Markov Model
Data Mining
Code Completion
Code Assistants
Abbreviation
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Department of Mechanical Engineering
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/ase.2009.64
