Code Completion From Abbreviated Input

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 ma...

Full description

Bibliographic Details
Main Authors: Miller, Robert C. (Contributor), Han, Sangmok (Contributor), Wallace, David Robert (Contributor)
Other Authors: Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor), Massachusetts Institute of Technology. Department of Mechanical Engineering (Contributor)
Format: Article
Language:English
Published: Institute of Electrical and Electronics Engineers, 2010-10-15T15:48:31Z.
Subjects:
Online Access:Get fulltext
LEADER 02172 am a22003253u 4500
001 59377
042 |a dc 
100 1 0 |a Miller, Robert C.  |e author 
100 1 0 |a Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science  |e contributor 
100 1 0 |a Massachusetts Institute of Technology. Department of Mechanical Engineering  |e contributor 
100 1 0 |a Miller, Robert C.  |e contributor 
100 1 0 |a Miller, Robert C.  |e contributor 
100 1 0 |a Han, Sangmok  |e contributor 
100 1 0 |a Wallace, David Robert  |e contributor 
700 1 0 |a Han, Sangmok  |e author 
700 1 0 |a Wallace, David Robert  |e author 
245 0 0 |a Code Completion From Abbreviated Input 
260 |b Institute of Electrical and Electronics Engineers,   |c 2010-10-15T15:48:31Z. 
856 |z Get fulltext  |u http://hdl.handle.net/1721.1/59377 
520 |a 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. 
520 |a Samsung Scholarship Foundation 
546 |a en_US 
690 |a Multiple Keywords 
690 |a Hidden Markov Model 
690 |a Data Mining 
690 |a Code Completion 
690 |a Code Assistants 
690 |a Abbreviation 
655 7 |a Article 
773 |t 24th IEEE/ACM International Conference on Automated Software Engineering