{"id":{"repo_id":"eiu","oai_identifier":"oai:thekeep.eiu.edu:theses-2382"},"canonical_url":"https://search.ndltd.org/etd/eiu/oai:thekeep.eiu.edu:theses-2382","repository":{"repo_id":"eiu","name":"Eastern Illinois University","base_url":"https://thekeep.eiu.edu/do/oai/"},"display":{"title":"A Similarity Based Concordance Approach to Word Sense Disambiguation","abstract":"This study attempts to solve the problem of Word Sense Disambiguation using a combination of statistical, probabilistic and word matching algorithms. These algorithms consider that words and sentences have some hidden similarities and that the polysemous words in any context should be assigned to a sense after each execution of the algorithm. The algorithm was tested with sufficient sample data and the efficiency of the disambiguation performance has proven to increase significantly after the inclusion of the concordance methodology.","abstract_html":"This study attempts to solve the problem of Word Sense Disambiguation using a combination of statistical, probabilistic and word matching algorithms. These algorithms consider that words and sentences have some hidden similarities and that the polysemous words in any context should be assigned to a sense after each execution of the algorithm. The algorithm was tested with sufficient sample data and the efficiency of the disambiguation performance has proven to increase significantly after the inclusion of the concordance methodology.","abstract_has_math":false,"creators":["Guru, Ramakrishnan B."],"institution":null,"degree_name":"Master of Science (MS)","degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":["Samuel A. Guccione"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T07:50:03Z","subjects":["Theory and Algorithms"],"languages":[],"rights":[],"rights_urls":["http://creativecommons.org/licenses/by-nc-nd/3.0/"],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://thekeep.eiu.edu/theses/1381","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://thekeep.eiu.edu/theses/1381","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://thekeep.eiu.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Athekeep.eiu.edu%3Atheses-2382","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Samuel A. Guccione"]},{"key":"dc:creator","label":"Author","values":["Guru, Ramakrishnan B."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2015-02-18T08:00:00Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2004-01-01T08:00:00Z"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science (MS)"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Theory and Algorithms"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:rights.license","label":"Dc Rights License","values":["http://creativecommons.org/licenses/by-nc-nd/3.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://thekeep.eiu.edu/theses/1381"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["This study attempts to solve the problem of Word Sense Disambiguation using a combination of statistical, probabilistic and word matching algorithms. These algorithms consider that words and sentences have some hidden similarities and that the polysemous words in any context should be assigned to a sense after each execution of the algorithm. The algorithm was tested with sufficient sample data and the efficiency of the disambiguation performance has proven to increase significantly after the inclusion of the concordance methodology."]},{"key":"dc:title","label":"Title","values":["A Similarity Based Concordance Approach to Word Sense Disambiguation"]}]}],"canonical_facts":{"dc:contributor":["Samuel A. Guccione"],"dc:creator":["Guru, Ramakrishnan B."],"dc:date.available":["2015-02-18T08:00:00Z"],"dc:date.created":["2004-01-01T08:00:00Z"],"dc:description.abstract":["This study attempts to solve the problem of Word Sense Disambiguation using a combination of statistical, probabilistic and word matching algorithms. These algorithms consider that words and sentences have some hidden similarities and that the polysemous words in any context should be assigned to a sense after each execution of the algorithm. The algorithm was tested with sufficient sample data and the efficiency of the disambiguation performance has proven to increase significantly after the inclusion of the concordance methodology."],"dc:identifier":["https://thekeep.eiu.edu/theses/1381"],"dc:rights.license":["http://creativecommons.org/licenses/by-nc-nd/3.0/"],"dc:subject":["Theory and Algorithms"],"dc:title":["A Similarity Based Concordance Approach to Word Sense Disambiguation"],"thesis:degree_name":["Master of Science (MS)"]},"updated_at":"2026-11-19T07:50:03Z"}