The week's pick
Random Articles
Reseach Article
Construction of Semantic Map of Homophones for Achieving Desired Performance for Searching Homophones for a Given English Word from a Large Database of English Words
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 132 - Number 16 |
| Year of Publication: 2015 |
| Authors: Vimal P. Parmar, C.K. Kumbharana |
10.5120/ijca2015907702
|
Vimal P. Parmar, C.K. Kumbharana . Construction of Semantic Map of Homophones for Achieving Desired Performance for Searching Homophones for a Given English Word from a Large Database of English Words. International Journal of Computer Applications. 132, 16 ( December 2015), 46-50. DOI=10.5120/ijca2015907702
Abstract
Semantic map is a complex network of words or phrases which are related in some way. To search related words or phrases for a given English word from a large vocabulary of English language is a time consuming process for a computer. Each time to search related set of words or phrases requires massive processing of comparison and if the entire database is large enough it is required to implement some mechanism that makes searching efficient and fully utilizing the computing power. The words and phrases which are related may be synonyms, antonyms or homophones meaning having similar pronunciation with different spellings and different meanings. The researcher has made an effort to prepare such a network of homophones so that when a search for homophones is required for a given English word, the fast retrieval of result in form of set of homophones can be possible. To determine about the words whether they are homophones or not we require phonetic algorithms for phonetic similarity between words. Similar to indexing a mechanism is derived using an algorithm that is one time processing to prepare a semantic map and then to retrieve set of homophones from this semantic map of homophones. This one time processing for constructing a semantic map is also somehow time consuming processing but once it is constructed searching becomes more efficient.
References
- Analysis and Comparative Study on Phonetic Matching Techniques Rima Shah, Dheeraj Kumar Singh International Journal of Computer Applications (0975 – 8887) Volume 87 – No.9, February 2014
- Name and Address matching strategy – White Paper Series Truth Technologies December 2010
- Vimal P. Parmar, Dr. CK Kumbharana “Study Existing Various Phonetic Algorithms and Designing and Development of a working model for the New Developed Algorithm and Comparison by implementing it with Existing Algorithm(s)” International Journal of Computer Applications (IJCA) ISSN: 0975 – 8887 Volume 98 / Number 19 (ISBN: 973-93-80883-19-1) DOI : 10.5120/17295-7795
- Vimal P. Parmar, Apurva K. Pandya, Dr. CK Kumbharana “Determining the Character Replacement Rules and Implementing Them for Phonetic Identification of Given Words to Identify Similar Pronunciation Words” Futuristic Trends on Computation Analysis and Knowledge Management (ABLAZE) 2015 International Conference at Greater Noida, India Pages : 272-277 Print ISBN : 978-1-4799-8432-9 DOI : 10.1109/ABLAZE.2015.7155010 Publisher : IEEE
- Binary Search Tree Balancing Methods: A Critical Study Suri Pushpa1, Prasad Vinod IJCSNS International Journal of Computer Science and Network Security, VOL.7 No.8, August 2007
- The Semantic Map of the Spatial Domain and Related Functions- Wei Wang University of California, Los Angeles- Language and Linguistics 16(3) 465–500 DOI: 10.1177/1606822X15569169
- The representation of homophones: Evidence from remediation- Britta Biedermann, Gerhard Blanken, Lyndsey Nickels- APHASIOLOGY, 2002, 16 (10/11), 1115–1136
- The homophone effect during visual word recognition in children: an fMRI study- Sharlene D. Newman, Psychological Research DOI 10.1007/s00426-011-0347-2
- Semantic relationship - www.iva.dk/bh/lifeboat_ko/CONCEPTS/semantic_relations.htm
Index Terms
Keywords