A New Similarity Measure for Automatic Construction of the Unknown Word Lexical Dictionary

A New Similarity Measure for Automatic Construction of the Unknown Word Lexical Dictionary

Myunggwon Hwang, Pankoo Kim
DOI: 10.4018/978-1-60960-593-3.ch002
OnDemand:
(Individual Chapters)
Available
$37.50
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

This paper deals with research that automatically constructs a lexical dictionary of unknown words as an automatic lexical dictionary expansion. The lexical dictionary has been usefully applied to various fields for semantic information processing. It has limitations in which it only processes terms defined in the dictionary. Under this circumstance, the concept of “Unknown Word (UW)” is defined. UW is considered a word, not defined in WordNet, that is an existing representative lexical dictionary. Here is where a new method to construct UW lexical dictionary through inputting various document collections that are scattered on the WebWeb is proposed. The authors grasp related terms of UW and measure semantic relatedness (similarity) between an UW and a related term(s). The relatedness is obtained by calculating both probabilistic relationship and semantic relationship. This research can extend UW lexical dictionary with an abundant number of UW. It is also possible to prepare a foundation for semantic retrieval by simultaneously using the UW lexical dictionary and WordNet.
Chapter Preview
Top

Introduction

Extensive research has been carried out on semantic information processing based on a lexical dictionary. Research on semantic document indexing (Hemayati et al., 2007, Kiryakov et al., 2003), on semantic metadata creation (Jovanovic et al., 2006, Handschuh et al., 2004, Alani et al., 2003), on generating semantic Web content using natural language processing (Java et al, 2007), and on detecting document topics (Kong et al., 2006) has been done. In addition, a lexical dictionary can become a basis for query expansion (Liu et al., 2004), ontology extension (Navigli et al., 2006, Velardi et al., 2007), information retrieval by semantic similarity (Hliaoutakis et al., 2006), and knowledge integration (Missikoff et al., 2003). While the lexical dictionary is gradually becoming more important and useful for semantic information processing, the most vulnerable aspect of semantic information processing is that it cannot handle concepts that are not defined in the dictionary. This is also true for WordNet, the most representative English lexical dictionary. Even though WordNet has been expanded with manual effort for over ten years, it cannot completely cover all the new words created by changes in real life such as new social phenomena, trends, techniques, product names, and famous persons” name (athletes, entertainers, and politicians). Manually defining such new words requires a lot of time, cost, labor, and controversy (Velardi et al., 2001, Navigli et al., 2003). This hindrance led to many research endeavors to reduce such factors in constructing or expanding knowledge bases using Web documents and data warehouses (Missikoff et al., 2003, Navigli et al., 2004, Navigli et al., 2006, Velardi et al., 2007). These methods have good result but they fail to not deal with relationships and similarity of terms.

WordNet contains semantic relations between concepts. Many research projects have quantified such relations using various methods and have applied the results for semantic information processing. Its limits are apparent since documents frequently contain words not defined in the dictionary. These undefined words are called “Unknown Word (UW).” For true semantic information processing, we search UWs and terms which relate to the UW. The probabilistic weight based on Bayesian probability and the semantic weight based on WordNet will be calculated to ultimately find the semantic relatedness between an UW and a related term(s). In addition since the dictionary handles concepts rather than words, we apply our newly designed word sense disambiguation (WSD) method, which enables the dictionary to have an accurate synset for related terms. As a result, the dictionary can be compatibly used with WordNet. This research is based on the relation structure of WordNet and uses the synset, therefore it can be regarded as a type of automatic WordNet expansion.

Complete Chapter List

Search this Book:
Reset