Abstract: Searching is the fundamental computing task in computer applications. Storage and data structure has greater impact on retrieval of data. Numbers of implementation are available to efficiently store and manipulate data. The selection of such appropriate structure depends on the nature of the application and the way in which data are manipulated. Key plays a vital role for searching data. In most of the implementation search is performed based on entire key value. Trie structure is a data structure that performs storing and searching based on individual character or digit that composite a key. Trie structure is suitable for many applications where efficient searching is the prime requirement and one such an application is to storage of homophone. This paper implements a trie structure for storage and retrieval of English homophones. Homophone is the term used to describe words which have similar type of pronunciation having different spelling and meaning. Many computer applications require manipulation of homophones. In this research paper an effort has been made to implement trie structure to store and search homophones. The paper describes two implementation algorithms for constructing a trie structure and then searching from the constructed structure. Phonetic algorithms are used to determine phonetic identity of the words but once identified it is required to store them efficiently as well as search them efficiently. The paper is concluded with resultant sample data set.