Optimal character arrangements for ambiguous keyboards.
Optimal character arrangements for ambiguous keyboards.
复制标题
模糊键盘的最佳字符排列。
DOI：
10.1109/86.736156
复制
发表时间：
1998
期刊：
影响因子：
--
通讯作者：
Higginbotham,DJ
中科院分区：
文献类型：
--
作者：
Lesher,GW;Moulton,BJ;Higginbotham,DJ
许多残疾人缺乏操作传统键盘所需的精细运动协调能力。对于这些人来说，模糊（或简化）键盘提供了另一种访问方法。通过在每个键上放置多个字符，可以增强单个键的大小和可访问性，而不需要更大的键盘。使用统计消歧算法自动解释每个按键，这些系统可以接近传统键盘的按键效率（每个字符的按键数）。由于字符在每个键上的位置决定了这些算法的有效性，因此以前已经提出了几种优化键盘排列的方法。本文提出了一种优化任意N个字符集在M个键集合上的新方法。虽然早期的工作依赖于击键效率的近似值，但所提出的方法在这种精确的性能度量下优化了排列。应用于9键“电话键盘”上的规范26个字符问题，这种方法比以前建立的布局的效率提高了2.5个百分点。该技术只需要最少的计算，就能快速有效地运行，在个人计算机上几秒钟就能得到最佳排列。这种灵活的方法适用于任意消歧算法、字符集和语言。
Many persons with disabilities lack the fine motor coordination necessary to operate traditional keyboards. For these individuals, ambiguous (or reduced) keyboards offer an alternative access method. By placing multiple characters on each key, the size and accessibility of the individual keys can be enhanced without requiring a larger keyboard. Using statistical disambiguation algorithms to automatically interpret each keystroke, these systems can approach the keystroke efficiency (keystrokes per character) of conventional keyboards. Since the placement of characters on each key determines the effectiveness of these algorithms, several methods of optimizing keyboard arrangements have previously been proposed. This paper presents a new method for optimizing an arbitrary set of N characters over a collection of M keys. While earlier efforts relied upon approximations of keystroke efficiency, the proposed approach optimizes the arrangement under this exact performance measure. Applied to the canonical 26 characters on a nine-key "telephone keypad" problem, this method provides an improvement in efficiency of 2.5 percentage points over previously established layouts. Using only a minimum of calculations, the proposed technique operates quickly and efficiently, deriving optimal arrangements in a matter of seconds using a personal computer. The flexible method is applicable to arbitrary disambiguation algorithms, character sets, and languages.