Optimal character arrangement for ambiguous keyboards using a PSO-based algorithm

Many researchers have devoted their efforts on optimizing the character arrangement for the single-character keyboard (SCK), however, the SCK market is still dominated by the QWERTY keyboard because people are used to the typology and hesitate to learn a new one even the QWERTY keyboard is ill-designed. As the use of hand-held entry devices is growing, the optimal arrangement of multi-character keyboard (MCK) is increasingly important. This also apples to customized keyboard design for motor-impaired users who are usually not able to do the typing on many keys. In this paper, we propose a unified mathematical model that integrates varying objectives. An enhanced particle swarm algorithm is developed by embedding a character-swapping optimizer and a bounding technique. Experimental results manifest that the proposed method outperforms competing ones by taking into account the co-occurrence frequency of characters in words, typing ergonomics, and word-disambiguation effectiveness.

[1]  B. John Oommen,et al.  An adaptive learning solution to the keyboard optimization problem , 1991, IEEE Trans. Syst. Man Cybern..

[2]  Kenneth Sörensen,et al.  Multi-objective optimization of mobile phone keymaps for typing messages using a word list , 2007, Eur. J. Oper. Res..

[3]  Peter G. Anderson,et al.  Typewriter Keyboards via Simulated Annealing , 1993 .

[4]  Rafael Martí,et al.  Scatter Search: Diseño Básico y Estrategias avanzadas , 2002, Inteligencia Artif..

[5]  Kumiko Tanaka-Ishii,et al.  Entering Text with a Four-Button Device , 2002, COLING.

[6]  G W Lesher,et al.  Optimal character arrangements for ambiguous keyboards. , 1998, IEEE transactions on rehabilitation engineering : a publication of the IEEE Engineering in Medicine and Biology Society.

[7]  Peng-Yeng Yin,et al.  Particle swarm optimization for point pattern matching , 2006, J. Vis. Commun. Image Represent..

[8]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[9]  Mauricio G. C. Resende,et al.  Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..

[10]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[11]  Bernard Yannou,et al.  Optimization of the keyboard arrangement problem using an Ant Colony algorithm , 2003, Eur. J. Oper. Res..