A binary spelling interface with random errors.
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.
Perelmouter
J
J
Institute of Medical Psychology and Behavioral Neurobiology, University of Tübingen, Germany. J.Perelmouter@uni-tuebingen.de
Birbaumer
N
N
D000465:Algorithms; D002540:Cerebral Cortex / Q000503:physiopathology*; D003143:Communication Devices for People with Disabilities; D004569:Electroencephalography / Q000295:instrumentation*; D006801:Humans; D011782:Quadriplegia / Q000503:physiopathology / Q000534:rehabilitation; D012984:Software; D014584:User-Computer Interface