A binary spelling interface with random errors

Jouri Perelmouter, Niels Birbaumer

Research output: Contribution to journalArticlepeer-review


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 languageEnglish
Pages (from-to)227-232
Number of pages6
JournalIEEE Transactions on Rehabilitation Engineering
Issue number2
Publication statusPublished - Jun 2000


  • Alternative communication
  • Binary tree
  • Huffman's algorithm
  • Spelling interface

ASJC Scopus subject areas

  • Engineering(all)


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

Cite this