Name
Abstract | ||
|---|---|---|
Individuals with severe motor impairments commonly enter text using a single binary switch and symbol scanning methods. We present a new scanning method -Huffman scanning - which uses Huffman coding to select the symbols to highlight during scanning, thus minimizing the expected bits per symbol. With our method, the user can select the intended symbol even after switch activation errors. We describe two varieties of Huffman scanning - synchronous and asynchronous -and present experimental results, demonstrating speedups over row/column and linear scanning. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1016/j.csl.2012.10.006 | Computer Speech & Language |
Keywords | Field | DocType |
Keyboard emulation,Language modeling,Binary coding,Text entry | Asynchronous communication,Computer science,Binary code,Speech recognition,Emulation,Huffman coding,Artificial intelligence,Machine learning,Grid,Language model,Canonical Huffman code,Binary number | Journal |
Volume | Issue | ISSN |
27 | 6 | 0885-2308 |
Citations | PageRank | References |
2 | 0.40 | 16 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Brian Roark | 1 | 20 | 4.62 |
| Russell Beckley | 2 | 39 | 4.38 |
| Chris Gibbons | 3 | 2 | 0.40 |
| M Fried-Oken | 4 | 65 | 8.39 |