Browse > Article
http://dx.doi.org/10.5916/jkosme.2015.39.6.656

Performance Analysis of a Korean Word Autocomplete System and New Evaluation Metrics  

Lee, Songwook (Department of Computer Science and Information Engineering, Korea National University of Transportation)
Publication Information
Journal of Advanced Marine Engineering and Technology / v.39, no.6, 2015 , pp. 656-661 More about this Journal
Abstract
The goal of this paper is to analyze the performance of a word autocomplete system for mobile devices such as smartphones, tablets, and PCs. The proposed system automatically completes a partially typed string into a full word, reducing the time and effort required by a user to enter text on these devices. We collect a large amount of data from Twitter and develop both unigram and bigram dictionaries based on the frequency of words. Using these dictionaries, we analyze the performance of the word autocomplete system and devise a keystroke profit rate and recovery rate as new evaluation metrics that better describe the characteristics of the word autocomplete problem compared to previous measures such as the mean reciprocal rank or recall.
Keywords
Autocomplete; Ngram; Keystroke profit rate; Recovery rata;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 A. Nandi and H. V. Jagadish, "Effective phrase prediction," Proceedings of Very Large Data Bases 2007, pp. 219-230, 2007.
2 M. Arias, J. M. Cantera, J. Vegas, P. del la Feunte, J. C. Alonso, G. G Bernardo, C. Llamas, and A. Zubizarreta, "Context-based personalization for mobile web search," Proceedings of Personalized Access, Profile Management, and Context Awareness in Databases, pp. 33-39, 2008.
3 Z. Bar-Yossef and N. Kraus, "Context-sensitive query auto-completion," Proceedings of WWW, pp. 107-116, 2011.
4 H. Bast and I. Weber, "Type less, find more: fast autocompletion search with a succinct index," Proceedings of the 29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 364-371, 2006.
5 H. Bast and I. Weber, "When you're lost for words: Faceted search with autocompletion," Proceedings of the SIGIR 2006 Workshop on Faceted Search, pp. 31-35, 2006.
6 H. Bast, C. W. Mortensen, and I. Weber, "Output-sensitive autocompletion search," String Processing and Information Retrieval, vol. 11, no. 4, pp. 269-286, 2008.   DOI
7 A. van den Bosch, "Effects of context and recency in scaled word completion," Computational Linguistics in the Netherlands Journal, vol. 1, pp. 79-94, 2011.
8 S. B. Needleman and C. D. Wunsch, "A general method applicable to the search for similarities in the amino acid sequence of two proteins," Journal of Molecular Biology, vol. 48, no.3, pp. 443-453, 1970.   DOI
9 E. Fredkin, "Trie memory," Communications of the ACM, vol. 3, no. 9, pp. 490-499, 1960.   DOI
10 K. J. Lee and S. W, Lee, "Error-driven noun-connection rule extraction for morphological analysis," Journal of the Korean Society of Marine Engineering, vol. 36, no. 8, pp. 1123-1128, 2012 (in Korean).   DOI   ScienceOn
11 A. Acharya, H. Zhu, and K. Shen, "Adaptive algorithms for cache-efficient trie search," Proceedings of the International Workshop on Algorithm Engineering and Experimentation, pp. 296-311, 1999.
12 J. Aoe, K. Morimoto, M. Shishibori, and K. H. Park, "A trie compaction algorithm for a large set of keys," IEEE Transactions on Knowledge and Data Engineering, vol. 8, no. 3, pp. 476-491, 1996.   DOI   ScienceOn