Pattern Prediction Using Binary Trees

TLDR: In this paper, the authors compared the implementation of word completion using binary trees to that of binary tries and proved that implementation of binary try takes longer time as compared to their proposed work.

Abstract: In this busy world, no one has time now. Technology is being developed every day to increase the efficiency. In this front, word predictor is a small step which increases our efficiency multifold times. Word predictor has applications in various areas like texting, search engine, etc. To develop our word predictor program, this project uses the data structure Trie. Our program uses a stored file of words to predict the words which the user may think of thus helping a lot. This project has compared the implementation of word completion using binary trees to that of binary tries. The proposed method that this project has used is word prediction using binary trees as compared to already existing binary tries and has proved that implementation of binary tries takes longer time as compared to our proposed work. Auto-complete is a feature which helps the user to find out the things that one wants to search by predicting the value in the search box. This auto-complete starts predicting the searches related to the few letters or words that are being typed by the user in the search box. This feature works best when the words typed by the user are more common such as when addressing an email.