The problem of optimizing a keyboard for a particular finite dictionary, H, defined as a subset of the words over a finite alphabet, A is considered. The letters of A are assigned to elements of a set K. Thus, associated with every element i ε K is a set Ci such that the {Ci} partitions A. The aim of the optimization problem is to compute the set {Ci} so that if every character in A is replaced by the index of the set in which it belongs, the transformed version of H has the minimum number of collisions. Initially, the problem is stated to be NP-hard. Later, the authors discuss the power of using genetic techniques to tackle the problem. The authors present the details of the only reported evolutionary method, and then a novel genetic solution is proposed. Experimental results demonstrating the power of this scheme are included.

Additional Metadata
Conference Proceedings of the 10th Annual International Phoenix Conference on Computers and Communications
Oommen, J, & Zgierski, J.R. (J. R.). (1991). Keyboard optimization using genetic techniques. In Conference Proceedings - Annual Phoenix Conference (pp. 726–732).