• Journal of the Korea Society of Computer and Information
• /
• v.17 no.9
• /
• pp.17-27
• /
• 2012

Open Market is one of the key factors to accelerate the profit. Usually retailers sell items in several Open Market. One of the challenges for retailers is to assign categories of items with different classification systems. In this research, we propose an item category recommendation method to support appropriate products category registration. Our recommendations are based on semantic relation between existing and any other Open Market categorization. In order to analyze correlations of categories, we use Morpheme analysis, Korean Wiki Dictionary, WordNet and Google Translation API. Our proposed method recommends a category, which is most similar to a guide word by measuring semantic similarity. The experimental results show that, our system improves the system accuracy in term of search category, and retailers can easily select the appropriate categories from our proposed method.

• Proceedings of the Korean Society for Information Management Conference
• /
• 1998.08a
• /
• pp.239-242
• /
• 1998

개념 정보를 제공하는 어휘 데이터베이스로 WordNet, CYC, EDR등이 출현하였다. 본 연구는 WordNet의 개념 기술 방식에 따라 한국어 개념 사전을 구축하기 위한 것이다 우선 개념을 분류할 적절한 분류 체계를 설정하고, 연세 말뭉치에서 빈도수가 높은 상위 300개 명사를 추출하여 사전의 뜻풀이에 나타난 명사와 연관관계로 표시된 명사를 함께 제시함으로써 개념을 표현하였다. 이러한 한국어 개념 사전은 의미모호성을 해소하는데 기여할 수 있을 것이다.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.5 s.43
• /
• pp.115-125
• /
• 2006

A concept hierarchy represents the knowledge with multi-level form, which is very useful to categorize, store and retrieve the data. Traditionally, a concept hierarchy has been built manually by domain experts. However, the manual construction of a concept hierarchy has caused many problems such as enormous development and maintenance costs and human errors such as inconsistency. This paper proposes the automatic creation of concept hierarchies using the predefined hypernym relation. To create the hierarchy automatically, we first eliminate the ambiguity of the senses of data values, and construct the hierarchy by grouping and leveling of the remaining senses. We use the WordNet explanations for multi-meaning word to eliminate the ambiguity and use the WordNet hypernym relations to create multi-level hierarchy structure.

• Journal for History of Mathematics
• /
• v.21 no.3
• /
• pp.97-112
• /
• 2008

In this study, the research results up to now on original word form and its meaning of Korean number words hana, dul, ..., yeol are looked out from math-historically. In fact, finding out original word form and its meaning of hana, dul, and set(ses) may not be possible in the respect of history of mathematics. There might have been a gap between set(ses) and net(nes), and between net(nes) and daseot(daseos). Original word form and its meaning of hana, dul, set(ses), and net(nes) must be found out in different aspect from those of daseot(daseos), yeoseot(yeoseos), ..., yeol. There might have been a gap between yeoseot(yeoseos) and ilgop(ilgob). Coining number word mechanism for ilgop(ilgob), yeodeol,(yeodeolb) and ahop(ahob) might have been same each other. There might have been a gap between ahop(ahob) and yeol. The research results up to now have not paid attention to this gaps sufficiently. But according to history of mathematics, there must have existed several gaps.

• The Journal of Korean Institute of Next Generation Computing
• /
• v.13 no.2
• /
• pp.102-110
• /
• 2017

Current word sense disambiguation techniques employ various machine learning-based methods. Various approaches have been proposed to address this problem, including the knowledge base approach. This approach defines the sense of an ambiguous word in accordance with knowledge base information with no training corpus. In unsupervised learning techniques that use a knowledge base approach, graph-based and similarity-based methods have been the main research areas. The graph-based method has the advantage of constructing a semantic graph that delineates all paths between different senses that an ambiguous word may have. However, unnecessary semantic paths may be introduced, thereby increasing the risk of errors. To solve this problem and construct a fine-grained graph, in this paper, we propose a model that iteratively constructs the graph while eliminating unnecessary nodes and edges, i.e., senses and semantic paths. The hybrid similarity estimation model was applied to estimate a more accurate sense in the constructed semantic graph. Because the proposed model uses BabelNet, a multilingual lexical knowledge base, the model is not limited to a specific language.

• Journal of KIISE
• /
• v.43 no.6
• /
• pp.653-661
• /
• 2016

The existing pattern-based triple generation systems based on distant supervision could be flawed by assumption of distant supervision. For resolving flaw from an excessive assumption, statistics information has been commonly used for measuring confidence of patterns in previous studies. In this study, we proposed a more accurate confidence measure based on semantic similarity between patterns and properties. Unsupervised learning method, word embedding and WordNet-based similarity measures were adopted for learning meaning of words and measuring semantic similarity. For resolving language discordance between patterns and properties, we adopted CCA for aligning bilingual word embedding models and a translation-based approach for a WordNet-based measure. The results of our experiments indicated that the accuracy of triples that are filtered by the semantic similarity-based confidence measure was 16% higher than that of the statistics-based approach. These results suggested that semantic similarity-based confidence measure is more effective than statistics-based approach for generating high quality triples.

• The Journal of the Acoustical Society of Korea
• /
• v.22 no.5
• /
• pp.388-402
• /
• 2003

In this paper, we carried out the word, 4 continuous digits. continuous, and task-independent word recognition experiments to verify the effectiveness of the re-defined phoneme-likely units (PLUs) for the phonetic decision tree based HM-Net (Hidden Markov Network) context-dependent (CD) acoustic modeling in Korean appropriately. In case of the 48 PLUs, the phonemes /ㅂ/, /ㄷ/, /ㄱ/ are separated by initial sound, medial vowel, final consonant, and the consonants /ㄹ/, /ㅈ/, /ㅎ/ are also separated by initial sound, final consonant according to the position of syllable, word, and sentence, respectively. In this paper. therefore, we re-define the 39 PLUs by unifying the one phoneme in the separated initial sound, medial vowel, and final consonant of the 48 PLUs to construct the CD acoustic models effectively. Through the experimental results using the re-defined 39 PLUs, in word recognition experiments with the context-independent (CI) acoustic models, the 48 PLUs has an average of 7.06%, higher recognition accuracy than the 39 PLUs used. But in the speaker-independent word recognition experiments with the CD acoustic models, the 39 PLUs has an average of 0.61% better recognition accuracy than the 48 PLUs used. In the 4 continuous digits recognition experiments with the liaison phenomena. the 39 PLUs has also an average of 6.55% higher recognition accuracy. And then, in continuous speech recognition experiments, the 39 PLUs has an average of 15.08% better recognition accuracy than the 48 PLUs used too. Finally, though the 48, 39 PLUs have the lower recognition accuracy, the 39 PLUs has an average of 1.17% higher recognition characteristic than the 48 PLUs used in the task-independent word recognition experiments according to the unknown contextual factor. Through the above experiments, we verified the effectiveness of the re-defined 39 PLUs compared to the 48PLUs to construct the CD acoustic models in this paper.

• Journal of KIISE:Databases
• /
• v.36 no.6
• /
• pp.466-475
• /
• 2009

Considerable research in the field of ontology mapping has been done when information sharing and reuse becomes necessary by a variety of ontology development. Ontology mapping method consists of the lexical, structural, instance, and logical inference similarity computing. Lexical similarity computing used in most ontology mapping methods performs an ontology mapping by using the synonym set defined in the WordNet. In this paper, we define the Super Word Set including the hypenym, hyponym, holonym, and meronym set and propose an ontology mapping method using the Super Word Set. The results of experiments show that our method improves the performance by up to 12%, compared with previous ontology mapping method.

• Proceedings of the IEEK Conference
• /
• 2002.07a
• /
• pp.321-324
• /
• 2002

For a rule-based conversion of Hangout into the Roman alphabet rather than a word-for-word conversion, one must come up with a faultless model for the Korean standard pronunciation rules, which are the basis of the Romanization. It is on this foundation that the Korean-Roman alphabet conversion table can be created. For linguistic modeling using PetriNet, modeling boundary and notation of modeling can be defined. In order to describe PetriNet, which is a dynamic modeling tool, as a static one, one can model the standard Korean pronunciation rules and the Hangout-Roman alphabet notation by conversion into incident matrix Thus, this research attempts to develop a mathematical modeling tool for a natural language using PetriNet, and create a Korean-Roman alphabet conversion table.

• Journal of KIISE:Software and Applications
• /
• v.37 no.7
• /
• pp.548-557
• /
• 2010

In this paper, we propose a semi-automatic modeling approach of ontology to annotate VOD to realize the IPTV's intelligent searching. The ontology is made by combining partial tree that extracts hypernym, hyponym, and synonym of keywords related to a service domain from WordNet. Further, we add to the partial tree new keywords that are undefined in WordNet, such as foreign words and words written in Chinese characters. The ontology consists of two parts: generic hierarchy and specific hierarchy. The former is the semantic model of vocabularies such as keywords and contents of keywords. They are defined as classes including property restrictions in the ontology. The latter is generated using the reasoning technique by inferring contents of keywords based on the generic hierarchy. An annotation generates metadata (i.e., contents and genre) of VOD based on the specific hierarchy. The generic hierarchy can be applied to other domains, and the specific hierarchy helps modeling the ontology to fit the service domain. This approach is proved as good to generate metadata independent of any specific domain. As a result, the proposed method produced around 82% precision with 2,400 VOD annotation test data.