• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.6
• /
• pp.1107-1114
• /
• 1994

This paper presents a method of constructing the protocol converter where the semantic relation between messages is added to the protocol conversion method satisfying with conformity property. This method comes from a formal method with top-down approach and then derives efficient maximal converter to overcome protocol mismatch between computer networks implemented with different protocols. When a converter is made with this method, the most useless portions of the maximal converter are removed easily.

• Journal of the Korean Institute of Rural Architecture
• /
• v.8 no.1
• /
• pp.80-89
• /
• 2006

This study is derived from relation between the natural landscape and architectural landscape. The type of landscape in Donghae seaside consist of three; Road, Mountain, Seaside. And we selected three landscapes about individual housing; Western, Traditional, Modern. This paper is analyzed 18-simulation scenes, which evaluated with semantic differential method in using 12-bipolar adjectives. The results of this study are as follows(ref: table 6). 1)The housing of western style do not correspond with landscape of Road, but landscape of mountain and seaside were suitable to the western style. 2)Mountain in Donghae seaside harmonizes with housing of traditional style. 3)Even though the housing of modern style were marked low assessment in three landscape, we found out relation, modern housing was well-matched with load landscape.

• Proceedings of the Korean Society for Language and Information Conference
• /
• 2007.11a
• /
• pp.349-357
• /
• 2007

Named entities (NEs) are important in many Natural Language Processing (NLP) applications, and discovering NE-related relations in texts may be beneficial for these applications. This paper proposes a method to extract the ISA relation between a "named entity" and its category, and an IS-RELATED-TO relation between the category and its related object. Based on the pattern extraction algorithm "Person Category Extraction" (PCE), we extend it for solving our problem. Our experiments on Wall Street Journal (WSJ) corpus show promising results. We also demonstrate a possible application of these relations by utilizing them for semantic search.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.10
• /
• pp.173-182
• /
• 2013

Typographical mistakes made in the writing process of drafts of electronic documents are more common than any other type of errors. The majority of these errors caused by mistyping are regarded as consequently still typo-errors, but a considerable number of them are developed into the grammatical errors and the semantic errors. Pseudo semantic errors among these errors due to typographical errors have more noticeable peculiarities than pure semantic errors between senses of surrounding context words within a sentence. These semantic errors can be detected and corrected by simple algorithm based on the co-occurrence frequency because of their prominent contextual discrepancy. I propose a method for detection and correction based on the co-occurrence frequency in order to detect semantic errors due to typo-errors. The co-occurrence frequency in proposed method is counted for only words with immediate dependency relation, and the cosine similarity measure is used in order to detect pseudo semantic errors. From the presented experimental results, the proposed method is expected to help improve the detecting rate of overall proofreading system by about 2~3%.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.2 s.40
• /
• pp.93-99
• /
• 2006

Ontology is an indispensable component in intelligent and semantic processing of knowledge and information, such as in semantic web. Ontology is considered to be constructed generally on the basis of taxonomy of human concepts about the world. However. as human concepts are unstructured and obscure, ontology construction based on the taxonomy of human concepts cannot be realized systematically furthermore automatically. So, we try to do this from the relation among linguistic symbols regarded representing human concepts, in short, words. We show the similarity between taxonomy of human concepts and relation among words. And we propose a methodology to construct and generate automatically ontologies from these relations mon words and a series of algorithm to convert these relations into ontologies. This paper presents the process and concrete application of this methodology.

• Journal of the Korea Computer Industry Society
• /
• v.7 no.3
• /
• pp.227-236
• /
• 2006

Semantic Web is getting popular to next web environment. Additionally, ontology language research is also activating to represent semantic relation of resource in semantic web. Specially, Ontology language as RDF and DAML+OIL appear on start point of research. But Ontology Language limited to describing characters of resource and to making a clear definition of relation of resource. So W3C suggest OWL at the next standard language for describing resource. OWL supply the lack of representation for RDF and RDF Schema. In this paper, we make Ontology to implement Online Retrieval System using OWL and propose the structure of storing Ontology document at the RDB. The structure support characters of OWL that are equivalent relationship, heterogeneous relationship, inverse relationship, union relationship and one of relationship between classes or properties. In this paper, we classify the extended elements for OWL from RDF Schema. And we propose the method of storing OWL using RDB for interoperability with many applications based on RDB. Finally, implement the storage and retrieval system based on OWL to provide advanced search function.

• Journal of the Korean Society for Library and Information Science
• /
• v.45 no.2
• /
• pp.251-275
• /
• 2011

In this paper, we propose a novel kernel called a semantic parse tree kernel that extends the parse tree kernel previously studied to extract protein-protein interactions(PPIs) and shown prominent results. Among the drawbacks of the existing parse tree kernel is that it could degenerate the overall performance of PPI extraction because the kernel function may produce lower kernel values of two sentences than the actual analogy between them due to the simple comparison mechanisms handling only the superficial aspects of the constituting words. The new kernel can compute the lexical semantic similarity as well as the syntactic analogy between two parse trees of target sentences. In order to calculate the lexical semantic similarity, it incorporates context-based word sense disambiguation producing synsets in WordNet as its outputs, which, in turn, can be transformed into more general ones. In experiments, we introduced two new parameters: tree kernel decay factors, and degrees of abstracting lexical concepts which can accelerate the optimization of PPI extraction performance in addition to the conventional SVM's regularization factor. Through these multi-strategic experiments, we confirmed the pivotal role of the newly applied parameters. Additionally, the experimental results showed that semantic parse tree kernel is superior to the conventional kernels especially in the PPI classification tasks.

• Annual Conference on Human and Language Technology
• /
• 2018.10a
• /
• pp.50-54
• /
• 2018

관계 추출을 위한 원격 지도 학습은 사람의 개입 없이 대규모 데이터를 생성할 수 있는 효율적인 방법이다. 그러나 원격 지도 학습은 노이즈 데이터 문제가 있으며, 노이즈 데이터는 두 가지 유형으로 나눌 수 있다. 첫 번째는 관계 표현 자체가 없는 문장이 연결된 경우이고, 두 번째는 관계 표현은 있는 문장이지만 다른 관계 표현도 함께 가지는 경우이다. 주로 문장의 길이가 길고 복잡한 문장에서 두 번째 노이즈 데이터 유형이 자주 발견된다. 본 연구는 두 번째 경우의 노이즈를 줄임으로써 관계 추출 모델의 성능을 향상시키기 위해 확장된 최단 의존 경로를 사용하는 CNN 기반 관계 추출 모델을 제안한다. 본 논문에서 제안한 방법의 우수성을 입증하기 위해, 한국어 위키피디아와 DBpedia 기반의 원격 지도 학습 데이터를 수집하여 평가한 결과, 본 논문에서 제안한 방법이 위 문제를 해결하는데 효과적이라는 것을 확인하였다.

• Korean Journal of Computational Design and Engineering
• /
• v.11 no.3
• /
• pp.211-222
• /
• 2006

In collaborative environment, it is necessary that the participants in collaboration should share the same understanding about the semantics of terms. For example, they should know that 'COMPONENT' and 'ITEM' are different word-expressions for the same meaning. In order to handle such problems in information sharing, an information system needs to automatically recognize that the terms have the same semantics. So we develop an algorithm mapping two terms based on their ontological definitions and their similarities. The proposed algorithm consists of four steps: the character matching, the inferencing, the definition comparing and the similarity checking. In the similarity checking step, we consider relation similarity and hierarchical similarity. The algorithm is very primitive, but it shows the possibility of semi-automatic mapping using ontology. In addition, we design a mapping procedure for a mapping system, called SOM (semantic ontology mapper).

• The Journal of Society for e-Business Studies
• /
• v.12 no.3
• /
• pp.133-150
• /
• 2007

In this paper we investigate a trend analysis service using Semantic Web technology in a news domain. The trend analysis service can provide more intelligent answers rather than the answer given In current news search engines since it can analyze the passage of time and the relation among news. In order to provide the trend analysis service, the capability of temporal reasoning is required, but the Semantic Web language such as OWL does not support the reasoning capability. Therefore, we propose a language TL-OWL(Temporal Web Ontology Language) extending OWL with the temporal reasoning.