An adaptive learning solution to the keyboard optimization problem
Consider the problem of assigning more than one symbol of a finite alphabet A to the same key on a keyboard. Since multiple symbols of the alphabet A reside on the same key, the representations of all the words in a finite dictionary h need not be unique. The problem we study is one of optimally assigning the symbols of the alphabet to the keys of a given keyboard with a view to minimize the total number of words that have ambiguous representation. The problem, as stated previously, is proven to be NP-hard. After presenting the only reported solution to the problem, we report a fast learning automaton-based solution to this problem. Experimental results demonstrating the power of this solution have also been presented.
|Journal||IEEE Transactions on Systems, Man and Cybernetics|
Oommen, J, Valiveti, R.S. (R. S.), & Zgierski, J.R. (J. R.). (1991). An adaptive learning solution to the keyboard optimization problem. IEEE Transactions on Systems, Man and Cybernetics, 21(6), 1608–1618. doi:10.1109/21.135704