A binary spelling interface with random errors

Jouri Perelmouter; Niels Birbaumer

doi:10.1109/86.847824

A binary spelling interface with random errors

Jouri Perelmouter, Niels Birbaumer

Istituto di Neuroriabilitazione Motoria San Camillo

Research output: Contribution to journal › Article › peer-review

Abstract

An algorithm for design of a spelling interface based on a modified Huffman's algorithm is presented. This algorithm builds a full binary tree that allows to maximize an average probability to reach a leaf where a required character is located when a choice at each node is made with possible errors. A means to correct errors (a delete-function) and an optimization method to build this delete-function into the binary tree are also discussed. Such a spelling interface could be successfully applied to any menu-orientated alternative communication system when a user (typically, a patient with devastating neuromuscular handicap) is not able to express an intended single binary response, either through motor responses or by using of brain-computer interfaces, with an absolute reliability.

Original language	English
Pages (from-to)	227-232
Number of pages	6
Journal	IEEE Transactions on Rehabilitation Engineering
Volume	8
Issue number	2
DOIs	https://doi.org/10.1109/86.847824
Publication status	Published - Jun 2000

Keywords

Alternative communication
Binary tree
Huffman's algorithm
Spelling interface

ASJC Scopus subject areas

Engineering(all)

Access to Document

10.1109/86.847824

Fingerprint Dive into the research topics of 'A binary spelling interface with random errors'. Together they form a unique fingerprint.

Cite this

@article{32b7c23598904a7fb24d1d9f086ee4e9,

title = "A binary spelling interface with random errors",

abstract = "An algorithm for design of a spelling interface based on a modified Huffman's algorithm is presented. This algorithm builds a full binary tree that allows to maximize an average probability to reach a leaf where a required character is located when a choice at each node is made with possible errors. A means to correct errors (a delete-function) and an optimization method to build this delete-function into the binary tree are also discussed. Such a spelling interface could be successfully applied to any menu-orientated alternative communication system when a user (typically, a patient with devastating neuromuscular handicap) is not able to express an intended single binary response, either through motor responses or by using of brain-computer interfaces, with an absolute reliability.",

keywords = "Alternative communication, Binary tree, Huffman's algorithm, Spelling interface",

author = "Jouri Perelmouter and Niels Birbaumer",

year = "2000",

month = jun,

doi = "10.1109/86.847824",

language = "English",

volume = "8",

pages = "227--232",

journal = "IEEE Transactions on Rehabilitation Engineering",

issn = "1063-6528",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "2",

}

TY - JOUR

T1 - A binary spelling interface with random errors

AU - Perelmouter, Jouri

AU - Birbaumer, Niels

PY - 2000/6

Y1 - 2000/6

N2 - An algorithm for design of a spelling interface based on a modified Huffman's algorithm is presented. This algorithm builds a full binary tree that allows to maximize an average probability to reach a leaf where a required character is located when a choice at each node is made with possible errors. A means to correct errors (a delete-function) and an optimization method to build this delete-function into the binary tree are also discussed. Such a spelling interface could be successfully applied to any menu-orientated alternative communication system when a user (typically, a patient with devastating neuromuscular handicap) is not able to express an intended single binary response, either through motor responses or by using of brain-computer interfaces, with an absolute reliability.

AB - An algorithm for design of a spelling interface based on a modified Huffman's algorithm is presented. This algorithm builds a full binary tree that allows to maximize an average probability to reach a leaf where a required character is located when a choice at each node is made with possible errors. A means to correct errors (a delete-function) and an optimization method to build this delete-function into the binary tree are also discussed. Such a spelling interface could be successfully applied to any menu-orientated alternative communication system when a user (typically, a patient with devastating neuromuscular handicap) is not able to express an intended single binary response, either through motor responses or by using of brain-computer interfaces, with an absolute reliability.

KW - Alternative communication

KW - Binary tree

KW - Huffman's algorithm

KW - Spelling interface

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

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

U2 - 10.1109/86.847824

DO - 10.1109/86.847824

M3 - Article

C2 - 10896195

AN - SCOPUS:0034210186

VL - 8

SP - 227

EP - 232

JO - IEEE Transactions on Rehabilitation Engineering

JF - IEEE Transactions on Rehabilitation Engineering

SN - 1063-6528

IS - 2

ER -

A binary spelling interface with random errors

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Cite this