Huffman scanning

Using language models within fixed-grid keyboard emulation

Brian Roark, Russell Beckley, Chris Gibbons, Melanie Fried-Oken

Research output: Contribution to journalArticle

9 Citations (Scopus)

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.

Original languageEnglish (US)
Pages (from-to)1212-1234
Number of pages23
JournalComputer Speech and Language
Volume27
Issue number6
DOIs
StatePublished - 2013

Fingerprint

Emulation
Language Model
Scanning
Grid
Switch
Switches
Huffman Coding
Activation
Chemical activation
Binary
Experimental Results

Keywords

  • Binary coding
  • emulation
  • Language modeling
  • Text entry

ASJC Scopus subject areas

  • Software
  • Human-Computer Interaction
  • Theoretical Computer Science

Cite this

Huffman scanning : Using language models within fixed-grid keyboard emulation. / Roark, Brian; Beckley, Russell; Gibbons, Chris; Fried-Oken, Melanie.

In: Computer Speech and Language, Vol. 27, No. 6, 2013, p. 1212-1234.

Research output: Contribution to journalArticle

Roark, Brian ; Beckley, Russell ; Gibbons, Chris ; Fried-Oken, Melanie. / Huffman scanning : Using language models within fixed-grid keyboard emulation. In: Computer Speech and Language. 2013 ; Vol. 27, No. 6. pp. 1212-1234.
@article{545fcc9e390c41848b7f4c8d0c8ad6fc,
title = "Huffman scanning: Using language models within fixed-grid keyboard emulation",
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.",
keywords = "Binary coding, emulation, Language modeling, Text entry",
author = "Brian Roark and Russell Beckley and Chris Gibbons and Melanie Fried-Oken",
year = "2013",
doi = "10.1016/j.csl.2012.10.006",
language = "English (US)",
volume = "27",
pages = "1212--1234",
journal = "Computer Speech and Language",
issn = "0885-2308",
publisher = "Academic Press Inc.",
number = "6",

}

TY - JOUR

T1 - Huffman scanning

T2 - Using language models within fixed-grid keyboard emulation

AU - Roark, Brian

AU - Beckley, Russell

AU - Gibbons, Chris

AU - Fried-Oken, Melanie

PY - 2013

Y1 - 2013

N2 - 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.

AB - 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.

KW - Binary coding

KW - emulation

KW - Language modeling

KW - Text entry

UR - http://www.scopus.com/inward/record.url?scp=84879079154&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84879079154&partnerID=8YFLogxK

U2 - 10.1016/j.csl.2012.10.006

DO - 10.1016/j.csl.2012.10.006

M3 - Article

VL - 27

SP - 1212

EP - 1234

JO - Computer Speech and Language

JF - Computer Speech and Language

SN - 0885-2308

IS - 6

ER -