Word prediction using a clustered optimal binary search tree

Authors:
Eyas El-Qawasmeh
Affiliations:
Computer Science Department, Jordan University of Science and Technology, P.O. Box 3030, Irbid, Jordan
Venue:
Information Processing Letters
Year:
2004

Citing 6
Cited 0

New indices for text: PAT Trees and PAT arrays

Information retrieval
Class-based n-gram models of natural language

Computational Linguistics
Intelligent word-prediction to enhance text input rate (a syntactic analysis-based word-prediction aid for people with severe motor and speech disability)

Proceedings of the 2nd international conference on Intelligent user interfaces
Parallel Construction of Multidimensional Binary Search Trees

IEEE Transactions on Parallel and Distributed Systems
A classification approach to word prediction

NAACL 2000 Proceedings of the 1st North American chapter of the Association for Computational Linguistics conference
An empirical study of smoothing techniques for language modeling

ACL '96 Proceedings of the 34th annual meeting on Association for Computational Linguistics

Quantified Score

Hi-index	0.89

Visualization

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 capabilily 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.