• Journal of the Korean Institute of Telematics and Electronics
• /
• v.23 no.6
• /
• pp.908-915
• /
• 1986

In this paper, an English-Korean machine translation system which consists of a syntax analyzer, a semartic analyzer and a sentence generatodr is proposed. The intermediate language in the syntax analysis is described by a lambda categorial grammar that is based on Montague Grammar, and the augmented context free grammar is introduced in the description of object language. Much difficulty in constructing general rules and semantic representations of an object language in the parser can be avoided by using the knowledge from the user interface utility that can modify the contents of dictionary and grammar rules.

• Journal of Digital Contents Society
• /
• v.6 no.1
• /
• pp.89-94
• /
• 2005

In machine translation the goal of natural language generation is to produce an target sentence transmitting the meaning of source sentence by using an parsing tree of source sentence and target expressions. It provides generator with linguistic structures, word mapping, part-of-speech, lexical information. The purpose of this study is to research the Korean Characteristics which could be used for the establishment of an algorism in speech recognition and composite sound. This is a part of realization for the plan of automatic machine translation. The stage of MT is divided into the level of morphemic, semantic analysis and syntactic construction.

• Journal of Korea Society of Industrial Information Systems
• /
• v.9 no.1
• /
• pp.17-23
• /
• 2004

This paper proposes to determine word senses in Korean language processing by corpus-based ontology learning. Our approach is a hybrid method. First, we apply the previously-secured dictionary information to select the correct senses of some ambiguous words with high precision, and then use the ontology to disambiguate the remaining ambiguous words. The mutual information between concepts in the ontology was calculated before using the ontology as knowledge for disambiguating word senses. If mutual information is regarded as a weight between ontology concepts, the ontology can be treated as a graph with weighted edges, and then we locate the least weighted path from one concept to the other concept. In our practical machine translation system, our word sense disambiguation method achieved a 9％ improvement over methods which do not use ontology for Korean translation.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.04b
• /
• pp.502-504
• /
• 2002

본 논문에서는 대량의 말뭉치에서 추출된 잠재의미에 기반하여 단어간 유사도를 측정하고 이를 영한 기계 번역에서의 역어선택에 적용한다. 잠재의미 추출을 위해서는 latent semantic analysis(LSA)와 probabilistic LSA(PLSA)를 이용한다. 주어진 단어의 역어 선택시 기본적으로 연어(collocation) 사전을 검색하고, 미등록 단어의 경우 등재된 단어 중 해당 단어와 유사도가 높은 항목의 정보를 활용하며 이 때 $textsc{k}$-최근접 이웃 방법이 이용된다. 단어들간의 유사도 계산은 잠재의미 공간상에서 이루어진다. 실험에서, 연어사전만 이용하였을 경우보다 최고 15%의 성능 향상을 보였으며, PLSA에 기반한 방법이 LSA에 의한 방법보다 역어선택 성능 면에서 약간 더 우수하였다.

• Korean Journal of Computational Design and Engineering
• /
• v.14 no.3
• /
• pp.159-167
• /
• 2009

For the robust exchange of parametric CAD model data, it is very important to perform mapping rightly and accurately between different CAD models. However, data model mapping is usually performed on a case-by-case basis. This results in the problem that mapping quality fluctuates very widely depending on the abilities of developers. In order to solve this problem, the concept of symantic distance is adapted and applied to the translation of parametric CAD model data in order to measure the difference between different CAD models quantitatively in a computer-interpretable form and systematize the mapping process.

• Journal of KIISE:Databases
• /
• v.34 no.6
• /
• pp.528-545
• /
• 2007

Recently ontology has been an attractive technology along with the business strategy of providing a plenty of more intelligent services. The essential problem in application domains using ontology is that all members, agents, and application programs in the domains must share the same ontology concepts. However, a variety of mobile devices, sensing devices, and network components manufactured by various companies, a variety of common carriers, and a variety of contents providers make multiple heterogeneous ontologies more likely to coexist. We can see many past researches fallen into resolving this semantic interoperability. Such methods can be broadly classified into by-mapping, by-merging, and by-translation. In this research, we focus on by-translation among them which uses a translation rule directly made between two heterogeneous ontology data like OntoMorph. However, the manual composition of the direct translation rule is not convenient by itself and if there are N ontologies, the direct method has the rule composition complexity of $O(N^2)$ in the worst case. Therefore, in this paper we introduce the cascade composition of translation rules based on web openness in order to improve the complexity. The research result made us recognize some important factors in an ontology translation system, that is speediness of translation, and conveniency of translation rule composition, and some experiments and comparing analysis with existing methods showed that our cascade method has more conveniency with insuring the speediness and the correctness.

• The KIPS Transactions:PartB
• /
• v.10B no.2
• /
• pp.219-228
• /
• 2003

This paper presents an efficient construction method of determination rules of thematic roles from syntactic relations in Korean language processing. This process is one of the main core of semantic analysis and an important issue to be solved in natural language processing. It is problematic to describe rules for determining thematic roles by only using general linguistic knowledge and experience, since the final result may be different according to the subjective views of researchers, and it is impossible to construct rules to cover all cases. However, our method is objective and efficient by considering large corpora, which contain practical osages of Korean language, and case frames in the Sejong Electronic Lexicon of Korean, which is being developed by dozens of Korean linguistic researchers. To determine thematic roles more correctly, our system uses syntactic relations, semantic classes, morpheme information, position of double subject. Especially by using semantic classes, we can increase the applicability of the rules.

• Korean Journal of Cognitive Science
• /
• v.21 no.4
• /
• pp.505-534
• /
• 2010

The purpose of this study was aimed to compare the lexical access and representation of semantic system in the bilinguals. The participants(late Korean-English bilinguals) performed the word-picture matching task. The task was to decide whether the pictures presented after the words(basic-level categories) represent the Korean(L1) or English(L2) words' meaning or not. The stimuli were consisted of common object belonged to four different categories(animal, part of body, clothes, tool). To control the translation strategies, the SOA(stimulus onset asynchrony) were manipulated as 650ms(Exp. 1) and 200ms(Exp. 2). In both experiment, the RTs were faster in L1 condition. The decision time of the part of body categories were shorter than the animal in L1 condition. In L2 condition, clothes were responded faster than the tools. The differences of the lexical access time implied that the bilingual semantic system seemed to be structured by more sub-level categories than the super-level, living or non-living things, and the ways to access the bilingual lexicon might be differentiated according to the languages.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.6
• /
• pp.2049-2068
• /
• 2021

AI combined with NLP techniques has promoted the use of Virtual Assistants and have made people rely on them for many diverse uses. Conversational Agents are the most promising technique that assists computer users through their operation. An important challenge in developing Conversational Agents globally is transferring the groundbreaking expertise obtained in English to other languages. AI is making it possible to transfer this learning. There is a dire need to develop systems that understand secular languages. One such difficult language is Hindi, which is the fourth most spoken language in the world. Semantic similarity is an important part of Natural Language Processing, which involves applications such as ontology learning and information extraction, for developing conversational agents. Most of the research is concentrated on English and other European languages. This paper presents a Corpus-based word semantic similarity measure for Hindi. An experiment involving the translation of the English benchmark dataset to Hindi is performed, investigating the incorporation of the corpus, with human and machine similarity ratings. A significant correlation to the human intuition and the algorithm ratings has been calculated for analyzing the accuracy of the proposed similarity measures. The method can be adapted in various applications of word semantic similarity or module for any other language.

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