|International Journal of Computer Applications
|Foundation of Computer Science (FCS), NY, USA
|Volume 77 - Number 17
|Year of Publication: 2013
|Authors: Bharat Kapse, Urmila Shrawankar
Bharat Kapse, Urmila Shrawankar . An Efficient Approach to Keystroke Saving for the Blinds. International Journal of Computer Applications. 77, 17 ( September 2013), 19-27. DOI=10.5120/13615-1386
Today many computer applications are available for the Blinds to interact with computer systems. Although computer interaction through keyboard is time consuming for visually impaired, their efforts can be minimized. Keystroke minimization or Keystroke saving is one of the approaches in minimizing the efforts of Blinds. The paper describes the work to achieve Keystroke saving. As the word prediction requires large database, in this work set of domain specific databases are constructed, where each domain database contains thousands of most commonly used words of that domain. It also construct prefix tree dynamically by modifying the Trie data structure. This dynamic prefix tree structure is used to perform prefix matching. The prefix matching is then analyzed to predict the required words from several domain specific databases used in this work. The paper describes the implementation and working of prefix matching and word prediction. The work presented in the paper is particularly useful for the blinds, as the work has considered all the difficulties of Blinds in interaction to computer through keyboard. The results of word prediction using modified trie are improved than trie based implementation.