• Journal of Korean language education
• /
• v.29 no.4
• /
• pp.93-112
• /
• 2018

The purpose of this study is to deal with vocabulary in KFL. As a result of this study, learners learned vocabulary on average 43 points through contextual inference and introduction of the class to activate background knowledge. In particular, the implicit method showed the highest learning rate of 52 points, and the thematic method had a 41 point-learning rate. In contrast, the semantic method was the lowest with a 25 point-learning rate. There was no significant difference in the improvement rate of upper vocabulary learners, but in the case of the lower learner, there was significant difference in the improvement rate. The difference was not significant in the post-test relative gain rate of upper learners, but there was significant in lower learners. In the delayed test relative gain rate, the difference was significant in all groups. There was correlation between vocabulary difficulty and score, but there was no correlation with the thematic method. And there was no correlation between vocabulary difficulty, improvement rate and relative gain rate in all three classes. However, content understanding, lexical grade, improvement rate, and relative gain rate showed a significant correlation.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.09a
• /
• pp.447-450
• /
• 2003

In this research, we propose an automatic knowledge acquisition and composite knowledge expression mechanism based on machine learning and relational database. Most of traditional approaches to develop a knowledge base and inference engine of expert systems were based on IF-THEN rules, AND-OR graph, Semantic networks, and Frame separately. However, there are some limitations such as automatic knowledge acquisition, complicate knowledge expression, expansibility of knowledge base, speed of inference, and hierarchies among rules. To overcome these limitations, many of researchers tried to develop an automatic knowledge acquisition, composite knowledge expression, and fast inference method. As a result, the adaptability of the expert systems was improved rapidly. Nonetheless, they didn't suggest a hybrid and generalized solution to support the entire process of development of expert systems. Our proposed mechanism has five advantages empirically. First, it could extract the specific domain knowledge from incomplete database based on machine learning algorithm. Second, this mechanism could reduce the number of rules efficiently according to the rule extraction mechanism used in machine learning. Third, our proposed mechanism could expand the knowledge base unlimitedly by using relational database. Fourth, the backward inference engine developed in this study, could manipulate the knowledge base stored in relational database rapidly. Therefore, the speed of inference is faster than traditional text -oriented inference mechanism. Fifth, our composite knowledge expression mechanism could reflect the traditional knowledge expression method such as IF-THEN rules, AND-OR graph, and Relationship matrix simultaneously. To validate the inference ability of our system, a real data set was adopted from a clinical diagnosis classifying the dermatology disease.

• The Journal of Korean Association of Computer Education
• /
• v.11 no.5
• /
• pp.77-88
• /
• 2008

Having observed the restriction of the current Web technology, the semantic Web has been developed, and it now has grown up with the core help of the W3C to a level where it recommends the OWL Web ontology language. Besides, in order to deduce the information out of OWL data, several inference systems have been developed such as Jena, Jess, and JTP. Unfortunately, however, quite few systems can effectively handle recently developed OWL data, and further, due to the limitation of file-based operation, the current inference systems cannot meet the requirements for handing huge OWL data. An efficient method for storing and searching ontology data is essential for ensuring stable information inference processes. In this study, firstly, we proposed a model based on the database management system to transform and store OWL data and to enable deduction process from the database. Secondly, we designed and implemented an effective OWL storing system based on our model. Finally, we compare our system with the previous inference systems through experimental performance analysis.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2008.04a
• /
• pp.87-88
• /
• 2008

As an information service system based on semantic web technology, $OntoFrame^{(R)}$ takes aim at a framework for providing analysis and fusion services of academic information. It currently consists of three parts: ontologies representing knowledge schema derived from academic information, $OntoURI^{(R)}$ which makes academic information into knowledge, and $OntoReasoner^{(R)}$ which performs inference and search on the knowledge. Unlike existing search engines which provides simple search services, our system provides, based on semantic web technology, several semantic and analytic services such as year-based topic trends in academic information, related topics, topic-based researchers and institutes, researcher network, statistics and regional distribution of academic information.

• Cross-Cultural Studies
• /
• v.22
• /
• pp.355-375
• /
• 2011

This paper investigates multiple marking of evidentials in Korean. Korean has 4 evidential markers: Present Sensory -ney, Past Sensory -te-, Inference -keyss-, Reported -ay. Korean allows evidential marked more than once in the same clause. Not all the possible combinations of evidential markers are, however, observed in Korean. Only five combinations of evidential markers are allowed: Inference followed by Past Sensory (-keysste-), Inference followed by Present Sensory (-keyssney), Past Sensory followed by Reported (-teray), Inference followed by Reported (-keysstay), Inference followed by Past Sensory and Reported (-keyssteray). Multiple making of evidentials in Korean seems to follow combination restrictions: i) Inference comes before Direct Knowledge, ii) Present Sensory and Reported cannot be marked in the same clause, iii) Reported must come after other evidential markers, iv) Past Sensory and Present Sensory cannot be marked in the same clause. Because of these restrictions, only 5 out of dozens possible multiple evidential marking combinations are observed in Korean. This paper takes inflectional suffixes including evidential markers in Korean as syntatic markers and argues that syntactic markers have their own scope and contribute semantic meaning to the scope not to the full sentence. Evidential markers in double marking have different syntactic scope and add not contradictory but complementary meanings to the preposition to express subtle and delicate evidential-related meanings.

• The KIPS Transactions:PartB
• /
• v.12B no.2 s.98
• /
• pp.191-202
• /
• 2005

The Semantic Web Services is a next-generation Web technology that supports Web services, based on the semantic Web technologies. Until now, the researches on semantic Web services may be foiled on the semantic Web document management and the inference engine to efficiently process the semantic Queries. However, in order to realize the principle semantic Web environment it is necessary to provide a semantic query interface though which users and/or agents can efficiently request semantic information. In this regard, we propose the Semantic Query Adapter(SQA) to provide a high query transparency with users, especially when querying about a complex semantic information. We first design the procedural user query interface based on a graphic view, by analyzing DAML-S Profile documents. And then, we builds a module which a user input query transforms its corresponding RDQL. We also propose the multiple semantic query generating procedure as a new method to solve the disjunctive query problem of the RDQL primitive.

• The KIPS Transactions:PartB
• /
• v.12B no.1 s.97
• /
• pp.91-100
• /
• 2005

It has been proposed diverse methods to use web information efficiently as the size of information is increasing. Most of search systems use a keyword-based method that mostly relies on syntactic information. They cannot utilize semantic information of documents and thus they could generate to users. To solve shortcoming in searching documents, a technique using the Semantic Web is suggested. A semantic web can find relevant information to users by employing metadata which are represented using standard ontologies. Each document is annotated with a metadata which can be reasoned by agents. In this paper, we propose a search system using semantic web technologies. Our semantic search system analyzes semantically questions that user input, and get resolution information that user want. To improve efficiency and accuracy of semantic search systems, this paper proposes DQL(DAML Query Language) engine that employs inference engine to execute reasoning and DQL converter that changes keyword form question of the user to DQL.

• The Journal of Society for e-Business Studies
• /
• v.18 no.2
• /
• pp.153-173
• /
• 2013

The ontology has been gaining increasing interests by recent arise of the semantic web and related technologies. The focus is mostly on inference query processing that requires high-level techniques for storage and searching ontologies efficiently, and it has been actively studied in the area of semantic-based searching. W3C's recommendation is to use RDFS and OWL for representing ontologies. However memory-based editors, inference engines, and triple storages all store ontology as a simple set of triplets. Naturally the performance is limited, especially when a large-scale ontology needs to be processed. A variety of researches on proposing algorithms for efficient inference query processing has been conducted, and many of them are based on using proven relational database technology. However, none of them had been successful in obtaining the complete set of inference results which reflects the five characteristics of the ontology properties. In this paper, we propose a new index structure called hyper cube index to efficiently process inference queries. Our approach is based on an intuition that an index can speed up the query processing when extensive inferencing is required.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.05a
• /
• pp.301-304
• /
• 2003

현재 웹이 가지고 있는 문제점들을 해결하기 위해서 연구하고 있는 차세대 웹을 시멘틱 웹이라고 한다. 시멘틱 웹에서 다루고 있는 기술들은 다양하지만 시멘틱 웹 구현에 있어서 온톨로지와 그 온톤로지를 추론하여 agent가 정보의 Semantic을 알아내는 것이 가장 핵심되는 영역의 기술이다. 본 논문에서는 DAML+OIL로 작성된 온톨로지의 추론 방법과 추론 결과물을 이용한 온톨로지 수정방법에 대해서 제안한다. 이를 위해서 온톨로지를 inference engine에서 작업을 수행할 수 있도록 FOL로 변환하는 기술, DAML+OIL axiom과 FOL을 이용해서 inference 할 수 있는 엔진 구축 기술, inference 결과물을 DAML+OIL로 변환하여 수정하는 방법들을 제안한다.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.39 no.3
• /
• pp.7-22
• /
• 2014

By the publications of RDF and OWL, the Semantic Web is confirmed as a technology through which information in the Internet can be processed by machines. The focus of the Semantic Web study after then has moved to how to provide more useful information to users for their decision making beyond simple use of the structured data in ontologies. SWRL that makes logical inference possible by rules, and SWCL that formulates constraints under the Semantic Web environment are some of many efforts toward the achievement of that goal. Constraint represents a connection or a relationship between individual data in ontology. Based on SWCL, this paper tries to extend the language by adding one more type of constraint, implication constaint, in its repertoire. When users use binary variables to represent logical relationships in mathematical models, it requires and knowledge on the solver to solve the models. The use of implication constraint ease this difficulty. Its need, definition and relevant technical description is presented by the use of the optimal common attribute selection problem in product design.