A binary spelling interface with random errors

  • Perelmouter J
  • Birbaumer N
  • 52

    Readers

    Mendeley users who have this article in their library.
  • 70

    Citations

    Citations of this article.

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.

Author-supplied keywords

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

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Get full text

Authors

  • Jouri Perelmouter

  • Niels Birbaumer

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free