• International Journal of Contents
• /
• v.10 no.4
• /
• pp.30-37
• /
• 2014

The current study was conducted to examine the temporal and spatial activation sequences related to morphosyntactic, semantic and orthographic-lexical sentences, focusing on the morphological-orthographic and lexical-semantic deviation processes in Korean language processing. The Event-related Potentials (ERPs) of 15 healthy students were adopted to explore the processing of head-final critical words in a sentential plausibility task. Specifically, it was examined whether the ERP-pattern to orthographic-lexical violation might show linear precedence over other processes, or the presence of additivity across combined processing components. For the morphosyntactic violation, fronto-central LAN followed by P600 was found, while semantic violation elicited N400, as expected. Activation of P600 was distributed in the left frontal and central sites, while N400 appeared even in frontal sites other than the centro-parietal areas. Most importantly, the orthographic-lexical violation process revealed by earlier N2 with fronto-central activity was shown to be complexes of morphological and semantic functions from the same critical word. The present study suggests that there is a linear precedence over the morphological deviation and its lexical semantic processing based on the immediate possibility of lexical information, followed by sentential semantics. Finally, late syntactic integration processes were completed, showing different topographic activation in order of importance of ongoing sentential information.

• The KIPS Transactions:PartD
• /
• v.13D no.1 s.104
• /
• pp.117-124
• /
• 2006

Hardware and software codesign framework called PeaCE(Ptolemy extension as a Codesign Environment) was developed. It allows to express both data flow and control flow which is described as fFSM which extends traditional finite state machine. While the fFSM model provides lots of syntactic constructs for describing control flow, it has a lack of their formality and then difficulties in verifying the specification. In order to define the formal semantics of the fFSM, in this paper, firstly the hierarchical structure in the model is flattened and then the step semantics is defined. As a result, some important bugs such as race condition, ambiguous transition, and circulartransition can be formally detected in the model.

• Journal of KIISE:Computing Practices and Letters
• /
• v.6 no.6
• /
• pp.608-619
• /
• 2000

In this paper, we give a formal semantics for Statechart via a translation into Algebra of Communicating Shared Hesources(ACSR). Statechart is a very rich graphical specification language, which is suitable to specify complicated reactive systems. However, the incorporation of graph into specification and rich syntax makes Statechart semantics very complicated and ambiguous. Thus, it is very difficult to verify the correctness of Statechart specifications. Also, we propose the formal verification method for Statechart specifications by showing equivalence relation between two Statechart specifications. This makes it possible to combine the advantages of a graphical language with the rigor of process algebra.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.11a
• /
• pp.801-802
• /
• 2009

Currently, XML and its schema language have become the standard for data representation and information exchange format on the current web. Unfortunately, problems happen when integrating different data sources since XML mainly supports the document structure but lack consideration on sharing knowledge of data. Meanwhile, Semantic Web technologies, such as Web Ontology Language (OWL), can include the structure as well as the semantics of the data. Therefore, finding a way to integrate XML data as OWL ontology receives a high interest nowadays. In this paper we present a mapping notation to convert XML Schema to OWL domain knowledge and an effective method to transform XML instances into OWL individuals. While keeping the XML original structure, our work also adds more semantics for the XML document. Moreover, whole of the transformation processes are done automatically without any user interference. Further, our transforming approach provides the solution for duplicate element names in XML document which has not mentioned in the previous work. Our results in existing OWL syntaxes can be loaded immediately by OWL editors and Semantic Web applications.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.29 no.3
• /
• pp.119-127
• /
• 2006

In this paper, we present a systematic approach to translating BPML(Business Process Modeling Language) into the ${\pi}-Calculus$. BPML is an executable business process modeling language, like BPEL4WS(Business Process Execution Language for Web Services). It is difficult to find a systematic approach to formalizing these languages; but, by formalizing them, the behavior of the processes can be analyzed and compared so that optimal processes can be designed. For this formalization, we analyzed the activity types and contexts of BPML and suggested the definitions of semantics for each type and context by using the ${\pi}-Calculus$. In addition, we have shown the usefulness of our formalization scheme in that a typical order fulfillment process represented in BPML can be translated into the ${\pi}-Calculus$.

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

Evaluation of multilingual translation fundamentally involves measurement of meaning equivalences between the formally mapped discourses/texts of SL(source language) and TL(target language) both represented by a metalanguage called IL(interlingua). Unlike a usaal uni-directional MT(machine translation) model(e.g.:SL $\rightarrow$ analysis $\rightarrow$ transfer $\rightarrow$ generation $\rightarrow$ TL), a bi-directional(by 'negotiation') model(i.e.: SL $\rightarrow$ IL/S $\leftrightarrow$ IL $\leftrightarrow$ IL/T \leftarrow TL) is proposed here for the purpose of evaluating multilingual, not merely bilingual, translation. The IL, as conceived of in this study, is an English-based predicate logic represented in the framework of MRS(minimal recursion semantics), an MT-oriented off-shoot of HPSG(Head-driven Phrase Structure Grammar). In addition, a list of semantic and pragmatic checkpoints are set up, some being optional depending on the kind and use of the translation, so sa to have the evaluation of translation fine-grained by computing matching or mismatching of such checkpoints.

• Journal of Information Processing Systems
• /
• v.14 no.4
• /
• pp.824-836
• /
• 2018

The automatic extraction of temporal information from written texts is a key component of question answering and summarization systems and its efficacy in those systems is very decisive if a temporal expression (TE) is successfully extracted. In this paper, three different approaches for TE extraction in Uyghur are developed and analyzed. A novel approach which uses lexical semantics as an additional information is also presented to extend classical approaches which are mainly based on morphology and syntax. We used a manually annotated news dataset labeled with TIMEX3 tags and generated three models with different feature combinations. The experimental results show that the best run achieved 0.87 for Precision, 0.89 for Recall, and 0.88 for F1-Measure in Uyghur TE extraction. From the analysis of the results, we concluded that the application of semantic knowledge resolves ambiguity problem at shallower language analysis and significantly aids the development of more efficient Uyghur TE extraction system.

• Journal of Korean Port Research
• /
• v.14 no.1
• /
• pp.47-55
• /
• 2000

In order to cope with the changes of container terminal situation in these days, many simulation studies for container terminal have been accomplished. But previous simulation studies using simulation language have limitations in model representation and difficulties in modeling of large scaled container terminal system. To make these problems better, this paper addresses an object-oriented simulation of container terminal system using a DEVS formalism. The DEVS(Discrete Event System Specification) formalism, developed by Zeigler, supports specification of discrete event system in a hierarchical and modular manner. The formalism provides a mathematical basis for studying discrete event systems with better understood and sounder semantics. In a step of system modeling, a DEVS formalism aims at the exact system modeling that has a basis of semantics and utilizing the object-oriented manner can flexibly cope with the changes of system environment. In this study a model is developed and verified through the simulation of some alternatives.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.2S
• /
• pp.711-720
• /
• 2000

BADA-IV/XML is a system designed specifically for managing XML. Documents and is essential to various electronic document applications as a fundamental system. BADA-IV/XML supports all of aspects of data model, querying and manipulation operations for managing XML documents. This paper provides an overview of these aspects of the BADA-IV/XML, as well as defines schema classes for stroing, querying and maintaining hierarchical semantics of multimedia documents and structural semantics of complex documents linked with each other, Also a multimedia document query language is designed and implemented to support essential operations for efficient searching and managing multimedia documents. Finally, some simulation results show the performance of the paged VF(Virtual Fragmentation) model and the search model using element's identifier as compared with a general model.

• Korean Journal of Cognitive Science
• /
• v.18 no.4
• /
• pp.457-483
• /
• 2007

Database Semantics (DBS) attempts to provide a comprehensive and integrated approach to human communication which seeks theory-implementation transparency. Two key components of DBS are Word bank as a data structure and left-Associative Grammar (LAG) as an algorithm. This study aims to provide a pilot implementation of Korean in DBS. First, it is shown how the three separate modules of grammar in DBS, namely, Hear, Think, and Speak, combine to form an integrated system that simulates a cognitive agent by making use of a simple Korean sentence as an example. Second, we provide a detailed analysis of the structure in Korean that is a characteristic of Korean involving numerals, classifiers, and nouns, thereby illustrating how DBS can be applied to Korean. We also discuss an issue raised in the literature concerning a problem that arises when we try to apply the LAG algorithm to the analysis of head-final language like Korean, and then discuss some possible solution to the problem.