3-Key-Input: Exploring the Theoretical Minimum Keys for Text Entry 文章

ArXiv CS.CL2026-06-11NEWSen作者: Naoki Kimura

详细信息

来源站点
ArXiv CS.CL
作者
Naoki Kimura
文章类型
NEWS
语言
en
发布日期
2026-06-11

摘要

arXiv:2606.11642v1 Announce Type: cross Abstract: How far can we reduce the number of physical keys if we endow an ambiguous keyboard with modern language models? Fewer keys increase hardware design freedom in constrained settings such as assistive devices and mobile form factors. This paper systematically evaluates text entry systems using 2-5 physical keys combined with language-model-based disambiguation. On a 300-sentence English corpus (100 sentences each for Business / Conversational / Technical), we compare key counts (2-5), letter-to-key mappings (layout-based / frequency-based / intentionally worst-case), and decoders (Trie-only, GPT-2 beam search, GPT-4o selection). We find that 3 keys + GPT-4o achieves character error rate (CER) 9.46% and word error rate (WER) 12.20%, reducing CER by 59% relative to 2 keys (CER 23.3%). At 3 keys, the key-stream entropy is 1.54 bits/char; while increasing to 5 keys improves accuracy (CER 5.4%), the marginal gains diminish.