• The KIPS Transactions:PartA
• /
• v.17A no.4
• /
• pp.173-180
• /
• 2010

To specify a formal semantics is to do a significant part for design, standardization and translation of programming languages. The existing studies of a formal semantics for Java have a weak point to describe a clear and practical semantics for an efficient translation. It is necessary to do research for a formal semantics to specify a static and dynamic semantics clearly in order to do an efficient translation. This paper presents the improved Action Equation that specifies a formal semantics for Java to extend the research using Action Equation. The Action Equation is a practical and accurate specification that describes object-oriented programming features and handles exceptions. The specified Action Equation is compared to other descriptions, in terms of readability, modularity, extensibility, and flexibility and then we verified that Action Equation is superior to other formal semantics.

• Journal of the Korea Society of Computer and Information
• /
• v.8 no.4
• /
• pp.21-27
• /
• 2003

In these paper, we define object models in order to represent a correct analysis model, propose translation method to formal specification necessary to uniform and standard. The translated model provide to correctness, consistency and completeness. If it is happen to error in the VDM specification, we can verify model to adapt initial object model step. It increase correctness to retrieval, reduce the costs and efforts of after development because of the verified model used to basic specification in design step.

• Journal of Institute of Control, Robotics and Systems
• /
• v.9 no.11
• /
• pp.952-957
• /
• 2003

We propose how to translate relay circuits to the EMFGs(Extended Mark Flow Graphs) formally and analyze the original one by using the mark flow of it. Firstly, the concepts of the output condition, the output-on condition and the output-off condition are introduced in the relay circuits. These can be used to find the structure and the operation of respective relay outputs but the sequential operations of them cannot be obtained from these. Secondly, a relay circuit is translated to the corresponding EMFG as the all output-on conditions and all output-off conditions of it are translated to EMFGs. For the adequate translation, the condition arc and the concepts of the generation transition and the degeneration transition are introduced, and the duality for the simplification of the result. Thirdly, we analyze the operation of the original circuit by analyzing the mark flow of the resulting EMFG. We can achieve easy and fast analysis based on the EMFG's operation algorithm. Finally, we apply these to the relay circuit for an electric furnace and analyze its operation with the mark flow of the resulting EMFG. The formal translation from relay circuits to EMFGs makes the analysis easy so that these results can be used to design, modelling, the fault detection and the maintenance.

• KIPS Transactions on Computer and Communication Systems
• /
• v.10 no.6
• /
• pp.163-172
• /
• 2021

To specify a formal semantics for a programming language is to do a significant part for design, standardization and translation of it. The Python is popular and powerful, it is necessary to do research for a formal semantics to specify a static and dynamic semantics for Python clearly in order to design a similar language and do an efficient translation. This paper presents the Action Equation 2.0 that specifies a formal semantics for Python to change and update Action Equation. To measure the execution time for Python programs, we implemented the semantic structure specified in Action Equation 2.0 in Java, and prove through simulation that Action Equation 2.0 is a real semantic structure that can be implemented. The specified Action Equation 2.0 is compared to other descriptions, in terms of readability, modularity, extensibility, and flexibility and then we verified that Action Equation 2.0 is superior to other formal semantics.

• Cross-Cultural Studies
• /
• v.19
• /
• pp.251-270
• /
• 2010

The subject of the paper is to discern the validity of the translation theory put forward by the ESIT(Ecole Sup?rieur d'Interpr?tes et de Tranducteurs, Universit? Paris III) and how it differentiates from the other translation theories. First, the paper will analyze the theoretical aspects put forward by examining the equivalence that may be discerned between the french and korean translation in relation to the original english text that is being translated. Employing the equivalence in translation may shed new insights into the unterminable discussions we witness today between the literal translation and the free translation. Contrary to the formal equivalence the dynamic equivalence by Nida suggests that the messages retain the same meanings whether it be the original or a translated text to the/for the reader. In short, the object of the dynamic equivalence is to identify the closest equivalence to the suggested source language. The concept of correspondence and equivalence defined by theoriticians of translation falls to the domain of dynamic equivalence suggested by Nida. In translation theory the domain of usage of language and the that of discourse is denoted separately. by usage one denotes the translation through symbols that make up language itself. In contrast to this, the discourse is suggestive of defining the newly created expressions which may be denoted as being a creative equivalence which embodies the original message for the singular situation at hand. The translator will however find oneself incorporating the two opposing theories in translating. Translation falls under the criteria of text and not of language, thus one cannot regulate or foresee any special circumstances that may arise in translation of discourse, the translation to reflect this condition should always be delimited. All other translation should be subject to translation by equivalence. The interpretation theory in translation (of ESIT) in effect is relative to both the empirical and philosophical approach and is suggestive of new perspective in translation. In conclusion, the above suggested translation theory is different from the skopos theory and the polysystem theory in that it only takes in to account the elements that are in close relation to the original text, and also that it was developed for educational purposes opening new perspectives in the domain of translation theories.

• Journal of Arbitration Studies
• /
• v.23 no.2
• /
• pp.141-164
• /
• 2013

The current Korean Arbitration Act (KAA) ${\S}37(2)$ requires that a formal copy of an arbitral award or a duly certified copy thereof and the original arbitration agreement or a duly certified copy thereof be produced for the recognition and enforcement of a arbitral award. But as the KAA provides that the recognition and enforcement of a foreign arbitral award to which the New York Convention applies shall be granted in accordance with the Convention, the duly authenticated original award should be produced instead of a formal copy in that case. The provision on the documents to produce for the recognition and enforcement of an arbitral award is set to establish a reasonable and transparent standard and to facilitate the recognition and enforcement of awards by prohibiting parochial refusal of the recognition and enforcement on the grounds of formalities. Therefore it is necessary to simplify those documents according to the internationally acknowledged standard. It would be desirable to amend KAA ${\S}37(2)$ to require only "the original arbitral award or a copy thereof" without authentication or certification and a translation into Korean without any condition, adopting the 2006 amendment to the UNCITRAL Model Law on International Commercial Arbitration.

• Journal of the Korea Society of Computer and Information
• /
• v.5 no.4
• /
• pp.48-54
• /
• 2000

This Paper classified korean Parts-of-speech for korean-english machine translation and investigated morphological characters of each parts-of-speech. Korean standard grammar classified parts-of-speech by semantic, functional and formal character. Many rules make a difficulties the understanding of grammar structure and parts-of-speech classification and it is necessary to preprocess at machine translation. This paper classified korean parts-of-speech by one rule. The parts-of-speech suggested in this paper have a same syntactic role and same parts-of-speech with english dictionary, and express the structure of korean sentence. And also it can make target language by pattern matching in korean-english translation.

• Proceedings of the IEEK Conference
• /
• 2000.07b
• /
• pp.703-706
• /
• 2000

In recent years. XML applications are being developed in diverse area. Especially, development of XML document repository system associated with database is carrying out widely. The previous researches of XML repository system have several defects which are update and retrieval limitations for the XML document, design limitation for a formal retrieval algorithm and data redundancy. In order to solve the above problems. in this paper, we suggest relational database schemes for overcoming limitations of updating, retrieving, and rebuilding document. And suggest query translation strategy using two-phase translation that consists of pattern analyzing phase and SQL generating phase.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.12
• /
• pp.953-957
• /
• 2009

This paper proposes a keyword-based query translation system for the semantic web. With the relationship between keywords and ontology structure information, the system converts keyword based queries into queries written by formal query language which is appropriate for the semantic web. As a result, casual web users could not only express queries easily but also obtain the better result.

• ETRI Journal
• /
• v.46 no.1
• /
• pp.127-136
• /
• 2024

The Korean language has written (formal) and spoken (phonetic) forms that differ in their application, which can lead to confusion, especially when dealing with numbers and embedded Western words and phrases. This fact makes it difficult to automate Korean speech recognition models due to the need for a complete transcription training dataset. Because such datasets are frequently constructed using broadcast audio and their accompanying transcriptions, they do not follow a discrete rule-based matching pattern. Furthermore, these mismatches are exacerbated over time due to changing tacit policies. To mitigate this problem, we introduce a data-driven Korean spoken-to-written transcription conversion technique that enhances the automatic conversion of numbers and Western phrases to improve automatic translation model performance.