Designing small keyboards is hard

Authors:
Jean Cardinal;Stefan Langerman
Affiliations:
Computer Science Department, Université Libre de Bruxelles, Brussels, Belgium;Computer Science Department, Université Libre de Bruxelles, Brussels, Belgium
Venue:
Theoretical Computer Science
Year:
2005

Citing 6
Cited 4

Approximation algorithms for NP-hard problems

Approximation algorithms for NP-hard problems
A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Free Bits, PCPs, and Nonapproximability---Towards Tight Results

SIAM Journal on Computing
Approximation algorithms

Approximation algorithms
An evaluation of mobile phone text input methods

AUIC '02 Proceedings of the Third Australasian conference on User interfaces - Volume 7
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Text input disambiguation supported on a hierarchical user model

Proceedings of the 2005 joint conference on Smart objects and ambient intelligence: innovative context-aware services: usages and technologies
The single-finger keyboard layout problem

Computers and Operations Research
Automatic and self-paced scanning for alternative text entry

Telehealth/AT '08 Proceedings of the IASTED International Conference on Telehealth/Assistive Technologies
Qanti: a software tool for quick ambiguous non-standard text input

ICCHP'10 Proceedings of the 12th international conference on Computers helping people with special needs

Quantified Score

Hi-index	5.23

Visualization

Abstract

We study the problem of placing symbols of an alphabet onto the minimum number of keys of a small keyboard so that any word of a given dictionary can be recognized univoquely only by looking at the corresponding sequence of 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 key must be contiguous in an ordered alphabet. In the second variant, a well-chosen measure of ambiguity in the recognition of the words is minimized given the number of keys. Hardness and approximability results are given.