Please use this identifier to cite or link to this item: http://repository.futminna.edu.ng:8080/jspui/handle/123456789/3422
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAminu, Enesi Femi-
dc.contributor.authorOyefolahan, Ishaq Oyebisi-
dc.contributor.authorAbdullahi, Muhammad Bashir-
dc.contributor.authorSalaudeen, Muhammadu Tajudeen-
dc.contributor.authorFajobi, Adewale Qasim-
dc.date.accessioned2021-06-16T15:52:11Z-
dc.date.available2021-06-16T15:52:11Z-
dc.date.issued2019-04-24-
dc.identifier.urihttp://repository.futminna.edu.ng:8080/jspui/handle/123456789/3422-
dc.description.abstractIn order to have a web of relevant information retrieval otherwise, known as semantic web, ontology has been identified as its core stronghold to actualize the dream. Ontology is a data modeling or knowledge representation technique for structured data repository premised on collection of concepts with their semantic relationships and constraints on particular area of knowledge. Example is wordNet which is linguistic based and popular ontology which has been greatly used to be part of ontology based information retrieval system development. However, the existing wordNet would affect the expected accurate results of such system owing to its overlapping return of senses. Therefore, this research aimed to design algorithm with the aid of extended Levenshtein similarity matching function and WordWeb to proffer solution to the militating problem. At the end, an enhanced wordNet that devoid of overlapping returns of senses for efficient polysemy representation in terms of user's time and system's memory would be achieved.en_US
dc.language.isoenen_US
dc.publisheri-manageren_US
dc.subjectPolysemyen_US
dc.subjectWordNeten_US
dc.titleENHANCING WORDNET AGAINST OVERLAPPING RETURNS OF SENSES FOR EFFICIENT POLYSEMY REPRESENTATION IN ONTOLOGY DEVELOPMENTen_US
dc.typeArticleen_US
Appears in Collections:Computer Science

Files in This Item:
File SizeFormat 
i_manager2.pdf198.16 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.