• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.9 no.4
• /
• pp.958-963
• /
• 2008

Korean language has different structural properties which are controlled by semantic constraints of verbs. Also, most of Korean sentences are complex sentences which consisted of main clause and embedded clause. Therefore it is difficult to describe appropriate syntactic grammar or constraint for the Korean language and the Korean parsing causes various syntactic ambiguities. In this paper, we suggest how to describe CFG-based grammar using sentence patterns as syntactic constraint and solve syntactic ambiguities. To solve this, we classified 44 sentence patterns including complex sentences which have subordinate clause in Korean sentences and used it to reduce syntactic ambiguity. However, it is difficult to solve every syntactic ambiguity using the information of sentence patterns. So, we used semantic markers with semantic constraint. Semantic markers can be used to solve ambiguity by auxiliary particle or comitative case particle.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.33 no.3
• /
• pp.29-42
• /
• 2008

Semantic Web society initially focused only on data but has gradually moved toward knowledge. Recently rule beyond ontology has emerged as a key element of the Semantic Web. All of these activities are obviously aiming at making data and knowledge on the Web sharable and reusable between various entities around the world. If one of ultimate visions of the Semantic Web is to increase human's decision making quality assisted by machines, there is a missing but important part to be shared and reused. It is knowledge about constraints on data and concepts represented by ontology which should be emphasized more. In this paper, we propose Semantic Web Constraint Language (SWCL) based on OWL and show how effective SWCL can be in representing and solving an internet shopper's decision making problem by an implementation of a shopping agent in the Semantic Web environment.

• Journal of Intelligence and Information Systems
• /
• v.12 no.4
• /
• pp.73-90
• /
• 2006

When a consumer intends to purchase products through Internet stores, many difficulties are met because of limitations of the current search engines and the current web structure, and lack of tools supporting decision-makings. This paper raises an Internet shopping problem and proposes a framework of decision making process to settle it with an intelligent agent based on Semantic Web and Finite Domain Constraint. The agent uses finite domain constraint programming as modeling and solution methods for the decision problem under the Semantic Web environment.

• Language and Information
• /
• v.2 no.1
• /
• pp.116-156
• /
• 1998

This paper is an HPSG approach to agreement phenomena involving the Korean honorific expressions. it is shown that the theoretical devices developed by the constraint-based theory of HPSG can be fruitfully used to capture the interactions between syntactic constraints and semantic of pragmatic factors in Korean honorific agreement. The HPSG's semantic feature 'referential index' plays a key rele in discribing the multiple interaction. The constraint-based theory of agreement proves successful in accounting for the phenomenon that may be called 'inconsistent' honorific agreement as well as 'consistent' regular honorific usages. However, this paper acknowledges its limit. Recognizing an important distinction between basic and 'coercive' honorific expressions, it is argued that a systactic-semantic-pragmatic approach such as the present one can only be applied to basic honorific agreement. Being sociolinguistic in nature, coercive honorific agreement is perhaps not amenable to formal linguistic investigation.

• Proceedings of the CALSEC Conference
• /
• 2004.02a
• /
• pp.318-326
• /
• 2004

The ebXML (Electronic Business using eXtensible Markup Language) Specification Schema is to provide nominal set of specification elements necessary to specify a collaboration between business partners based on XML. As a part of ebXML Specification Schema, BPSS (Business Process Specification Schema) has been provided to support the direct specification of the set of elements required to configure a runtime system in order to execute a set of ebXML business transactions. The BPSS is available in two stand-alone representations, a UML version and an XML version. Due to the limitations of UML notations and XML syntax, however, current ebXML BPSS specification is insufficient to specify formal semantic constraints of modeling elements completely. In this study, we propose a classification schema for the BPSS semantic constraints and describe how to represent those semantic constraints formally using OCL (Object Constraint Language). As a way to verify a Business Process Specification (BPS) with the formal semantic constraint modeling, we suggest a rule-based approach to represent the formal constraints and to use the rule-based constraints specification to verify BPSs in a CLIPS prototype implementation.

• 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.

• The KIPS Transactions:PartB
• /
• v.19B no.1
• /
• pp.63-76
• /
• 2012

We propose a Korean compound noun semantic tagging system using statistical compound noun decomposition and semantic relation information extracted from a lexical semantic network(U-WIN) and dictionary definitions. The system consists of three phases including compound noun decomposition, semantic constraint, and semantic tagging. In compound noun decomposition, best candidates are selected using noun location frequencies extracted from a Sejong corpus, and re-decomposes noun for semantic constraint and restores foreign nouns. The semantic constraints phase finds possible semantic combinations by using origin information in dictionary and Naive Bayes Classifier, in order to decrease the computation time and increase the accuracy of semantic tagging. The semantic tagging phase calculates the semantic similarity between decomposed nouns and decides the semantic tags. We have constructed 40,717 experimental compound nouns data set from Standard Korean Language Dictionary, which consists of more than 3 characters and is semantically tagged. From the experiments, the accuracy of compound noun decomposition is 99.26%, and the accuracy of semantic tagging is 95.38% respectively.

• Asia pacific journal of information systems
• /
• v.14 no.1
• /
• pp.79-100
• /
• 2004

As a part of ebXML(Electronic Business using eXtensible Markup Language) framework, BPSS(Business Process Specification Schema) has been provided to support the direct specification of the set of elements required to configure a runtime system in order to execute a set of ebXML business transactions. The BPS,' is available in two stand-alone representations, a UML version and an XML version. Due to the limitations of UML notations and XML syntax, however, current ebXML BPSS specification fails to specify formal semantic constraints completely. In this study, we propose a constraint classification scheme for the BPSS specification and describe how to formally represent those semantic constraints using OCL(Object Constraint Language). As a way to validate p Business Process Specification(BPS) with the formal semantic constraints, we suggest a rule-based approach to represent the formal constraints and demonstrate its detailed mechanism for applying the rule-based constraints to the BPS with a prototype implementation.

• Korean Journal of Cognitive Science
• /
• v.10 no.1
• /
• pp.45-55
• /
• 1999

This paper argues that the basic modes of spatial cognition can be best identified in terms of argument/participant location, and shows that natural language uses‘simple’types of semantic denotations to encode spatial cognition, and further notes that spatial expressions should be interpreted not as locating an event/state as a whole but as locating arguments/participants of the event. The ways of locating events/states are identified in terms of argument orientation(AO), Which indicates semantic patterns of linkiarticipant location. and shows that natural langrage uses ng locatives to specific arguments. Four patterns of argument orientation described here reveal substantial modes of spatial cognition. and the AO patterns are mostly determined by the semantic classes of English verbs combining with locative expressions, i.e., by the event type of the predicate. As for the denotational constraint of locatives, the paper concludes that semantic denotations of locative PPs are restricted to the intersecting functions mapping relations to relations.

• The Journal of the Korea Contents Association
• /
• v.8 no.8
• /
• pp.274-284
• /
• 2008

XBRL is an XML-based language, actively used for diverse business reporting applications including financial reporting. It can be flexibly applied to each application by defining concepts and their relationships existing within the application. In these business reporting processes, it is very important for senders and receivers to validate the consistency and completeness of reporting contents in the syntatic and semantic levels. The basic method is to directly represent and validate the semantic constraints using application program codes. However, the method makes it difficult to represent, change, share semantic constraints. While XML constraint languages for XML documents such as XSLT and Schemantron support explicit representation and sharing of semantic constraints, they are limited in the efficiency and effectiveness of representing XBRL semantic constraints. This paper reviews XBRL formula, actively being discussed recently for standardization, and discusses the representation capability and limitations through a case analysis, which applies XBRL formula to business documents in the area of financial reporting.