POLYTECHNIC UNIVERSITY OF THE PHILIPPINES

Sta. Mesa, Manila

College of Computer Information and Science
August 2015

Thesaurus implementing Binary Search

Algorithm

I.

Introduction
Our goal is to create a program that is a thesaurus which implements
binary search algorithm, and find if this algorithm is applicable in this
program. Thesaurus is a reference work that is a lists of words grouped
together according to similarity of meaning (containing synonyms and
sometimes antonyms), in contrast to a dictionary, which provides
definitions for words, and generally lists them in alphabetical order. Binary
search algorithm is implemented because the algorithm can be used in
searching for data which is fast because it is a divide and conquer
algorithm, where the program divides the collection of data and searches
in the divided collection.

II.

Methods
1. Binary Search Algorithm is a search algorithm where the search
begins by comparing the target value to the value of the middle element
of the sorted array.
This algorithm is faster than linear search algorithm
because it can obtain the result in just few moves.
2. Hashing - is used to index and retrieve items in a database because it is
faster to find the item using the shorter hashed key than to find it using
the original value.

III.

Reference of Related Literature

1. Douglas Comer ,Vincent Y. Shen ,TR 304 ,Computer Sciences
Department Purdue University W. Lafayette, IN 47907, Apr M 1979.
Hash-Binary Search: A Fast Technique for Searching an English
Spelling Dictionary
When a document is prepared using a computer system, it can be
checked for spelling errors automatically and efficiently. This paper
presents the hash-binary method for searching a static table and
applies it to searching an English spelling dictionary.
Analysis shows that with only a small amount of space beyond that
required to store the keys, the hash-binary search method pei forms
better than either hashing with open-addressing or binary search.
Experiments with a sample dictionary verify the results.
We also present extensions to account for skewed frequencies of
access as well as methods for testing alternative hashing functions.
docs.lib.purdue.edu/cgi/viewcontent.cgi?article=1233&context=cstech
case study about binary search in a simple dictionary

2. To hash a value means simply to apply a function that transforms a

possibly non-integer key into an integer value. This simple idea is the
basis for a very powerful data structuring technique. If it is possible to
discover a function that transforms a set of keys via a one-to-one
mapping on to a set of integer index values, then it is possible to
construct a vector using non-integer keys. More commonly, several key
values will map into the same integer index. Two keys that map into
the same value are said to have collided.
http://classes.engr.oregonstate.edu/eecs/spring2011/cs261/Budd2008T
extbook/Chapter12.pdf