Abstract
We study the problem of placing symbols of an alphabet onto the minimum number of keys on a small keyboard so that any word of a given dictionary can be recognized univoquely only by looking at the corresponding sequence of pressed keys. This problem is motivated by the design of small keyboards for mobile devices. We show that the problem is hard in general, and NP-complete even if we only wish to decide whether two keys are sufficient. We also consider two variants of the problem. In the first one, symbols on a same key must be contiguous in an ordered alphabet. The second variant is a fixed-parameter version of the previous one that minimizes a well-chosen measure of ambiguity in the recognition of the words for a given number of keys. Hardness and approximability results are given.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
ISO/IEC 9995-8. Information systems – keyboard layouts for text and office systems – part 8: Allocation of letters to keys of a numeric keypad (1994), International Organisation for standardisation
Bellare, M., Goldreich, M., Sudan, M.: Free bits, PCPs and non-approximability – towards tight results. SIAM J. Comp. 27, 804–915 (1998)
Butts, L., Cockburn, A.: An evaluation of mobile phone text input methods. In: Proc. 3rd Australasian User Interfaces Conference (2001)
Tegic Communications. T9 text entry, http://www.t9.com
Conforti, M., Cornuejols, G.: Submodular functions, matroids and the greedy algorithm: tight worst-case bounds and some generalizations of the Rado-Edmonds theorem. Discrete Applied Mathematics 7, 257–275 (1984)
Garey, M., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)
Hochbaum, D.S. (ed.): Approximation algorithms for NP-hard problems. PWS Publishing Company (1997)
Lesher, G., Moulton, B., Jeffery Higginbotham, D.: Optimal character arrangements for ambiguous keyboards. IEEE Trans. on Rehabilitation Engineering 6(4) (1998)
MacKenzie, I., Soukoreff, R.: Text entry for mobile computing: Models and methods, theory and practice. Human-Computer Interaction 17, 147–198 (2002)
Raz, R., Safra, S.: A sub-constant error-probability low-degree test, and a subconstant error-probability PCP characterization of NP. In: Proceedings of the 29th ACM Symposium on Theory of Computing, pp. 475–484 (1997)
Vazirani, V.: Approximation Algorithms. Springer, Berlin (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cardinal, J., Langerman, S. (2004). Designing Small Keyboards Is Hard. In: Farach-Colton, M. (eds) LATIN 2004: Theoretical Informatics. LATIN 2004. Lecture Notes in Computer Science, vol 2976. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24698-5_43
Download citation
DOI: https://doi.org/10.1007/978-3-540-24698-5_43
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21258-4
Online ISBN: 978-3-540-24698-5
eBook Packages: Springer Book Archive