ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
advertisementadvertisement
Information Processing Letters
Volume 92, Issue 5, 16 December 2004, Pages 257-265
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (450 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.ipl.2004.08.006    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2004 Elsevier B.V. All rights reserved.

Word prediction using a clustered optimal binary search tree

Eyas El-QawasmehE-mail The Corresponding Author

Computer Science Department, Jordan University of Science and Technology, P.O. Box 3030, Irbid, Jordan

Received 20 October 2002. 
Communicated by F. Dehne. 
Available online 15 September 2004.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

Word prediction methodologies depend heavily on the statistical approach that uses the unigram, bigram, and the trigram of words. However, the construction of the N-gram model requires a very large size of memory, which is beyond the capability of many existing computers. Beside this, the approximation reduces the accuracy of word prediction. In this paper, we suggest to use a cluster of computers to build an Optimal Binary Search Tree (OBST) that will be used for the statistical approach in word prediction. The OBST will contain extra links so that the bigram and the trigram of the language will be presented. In addition, we suggest the incorporation of other enhancements to achieve optimal performance of word prediction. Our experimental results showed that the suggested approach improves the keystroke saving.

Keywords: Bigram; Cluster computing; N-gram; Unigram; Trigram; Word frequency; Word prediction; Data structures


Information Processing Letters
Volume 92, Issue 5, 16 December 2004, Pages 257-265
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.