• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.1
• /
• pp.103-111
• /
• 2009

In SCA, the core framework must include the domain parser to parse the domain profile and thus reconstructs the platform on the time including the starting of the platform, the initialization of the new radio, and etc. The domain profile is described in XML and it includes the characteristics about the software component or the hardware device in a platform. Elementarily, the core framework has to have within the domain profile parser in order to parse the domain profile. In this paper, in order to apply to the limited environment like the mobile terminal, we propose the method for reducing the size of the domain profile parser and for strengthening the independency of the XML parser vendor to have with the domain profile parser. Therefore, domain profile parser can be solve the problem like the overhead about the DOM tree creation due to the repetitive parsing of the domain profile, the compatibility degradation by the specific XML parser vender, the dependency about the domain profile technique, and etc.

• Journal of KIISE:Software and Applications
• /
• v.27 no.7
• /
• pp.784-793
• /
• 2000

The conventional morphological analysis of Korean language presents various morphological ambiguities because of its agglutinative nature. These ambiguities cause syntactic ambiguities and they make it difficult to select the correct parse tree. This problem is mainly related to the auxiliary predicate or bound noun in Korean. They have a strong relationship with the surrounding morphemes which are mostly functional morphemes that cannot stand alone. The combined morphemes have a syntactic or semantic role in the sentence. We extracted these morphemes from 0.2 million tagged words and classified these morphemes into three types. We call these morphemes a syntactic morpheme and regard them as an input unit of the syntactic analysis. This paper presents the syntactic morpheme is an efficient method for solving the following problems: 1) reduction of morphological ambiguities, 2) elimination of unnecessary partial parse trees during the parsing, and 3) reduction of syntactic ambiguity. Finally, the experimental results show that the syntactic morpheme is an essential unit for reducing morphological and syntactic ambiguity.

• Journal of Internet Computing and Services
• /
• v.12 no.5
• /
• pp.73-85
• /
• 2011

Lots of valuable textual information is used to extract relations between named entities from literature. Composite kernel approach is proposed in this paper. The composite kernel approach calculates similarities based on the following information:(1) Phrase structure in convolution parse tree kernel that has shown encouraging results. (2) Predicate-argument structure patterns. In other words, the approach deals with syntactic structure as well as semantic structure using a reciprocal method. The proposed approach was evaluated using various types of test collections and it showed the better performance compared with those of previous approach using only information from syntactic structures. In addition, it showed the better performance than those of the state of the art approach.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.12
• /
• pp.673-681
• /
• 2004

As the use of digital videos is getting popular, there is an increasing demand for efficient browsing and retrieval of video. To support such operations, effective video indexing should be incorporated. One of the most fundamental steps in video indexing is to parse video stream into shots and scenes. Generally, it takes long time to parse a video due to the huge amount of computation in a traditional single computing environment. Previous studies had widely used Round Robin scheduling which basically allocates tasks to each slave for a time interval of one quantum. This scheduling is difficult to adapt in a heterogeneous environment. In this paper, we propose two different parallel parsing algorithms which are Size-Adaptive Round Robin and Dynamic Size-Adaptive Round Robin for the heterogeneous distributed computing environments. In order to show their performance, we perform several experiments and show some of the results.

• Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
• /
• v.7 no.9
• /
• pp.259-269
• /
• 2017

As emerging the '4th Industrial Revolution' by increasing the necessity of the intelligent system recently, 'Autonomic Control System' also has been the important issue. It is necessary to develop the system collecting data of machines and sensors for the autonomic control system to monitor the target system. But it is difficult to collect data because data formats of machines and sensors of the existing factories differ between each manufacturer. Therefore, this paper presents and implements data collecting and processing system that comprise 3 steps including 'ParseBuffer', 'ProcessData' and 'AddToBuffer' by using 'MTConnect' that is standard manufacturing facility data collecting middleware. Through the suggested system, we can get data in a common format usable in an autonomous control system. As a case study, we experimented with the generation and collection of AGV (Automated Guided Vehicle) data, which is an unattended transportation system in the factory. To accomplish this, we defined the data type in accordance with the MTConnect standard and confirmed the data collected through the proposed system.

• Korean Journal of Social Welfare Studies
• /
• v.42 no.2
• /
• pp.235-274
• /
• 2011

The purpose of this study is to understand suffering of torture for victims with suspicion of espionage under the military government in Korea by knowing meaning and structure of empirical phenomena. Methods is to applied to Phenomenological and heuristic Human Becoming Methodology, and the subjects of this study are text for three tortured victims. Results is the structure that the victims accepted their act of espionage under the torture and horror, living with retribution from heaven, surviving pressured times, and fighting for human rights upon release from prison. The conceptual integration of relationship issues were: valuing, imaging, languaging with powering and transforming under the process of revealing-concealing and enabling-limiting. Finally, discussion and practical meaning was reviewed.

• Journal of KIISE:Software and Applications
• /
• v.37 no.6
• /
• pp.486-490
• /
• 2010

Incremental parsing has been researched in the intention that the parse result of the original string is reused in the parsing of a new string. This paper proposes an improved method of the previous incremental LL(1) parser with nonterminal lookahead symbols. The previous work is time-inefficient because it repeatedly performs unnecessary steps when an error occurs. This paper gives a solution for the problem.

• ETRI Journal
• /
• v.30 no.1
• /
• pp.155-157
• /
• 2008

This letter introduces a new method to automatically acquire paraphrases using bilingual corpora. It utilizes the bilingual dependency relations obtained by projecting a monolingual dependency parse onto the other language's sentence based on statistical alignment techniques. Since the proposed paraphrasing method can clearly disambiguate the sense of the original phrases using the bilingual context of dependency relations, it would be possible to obtain interchangeable paraphrases under a given context. Through experiments with parallel corpora of Korean and English language pairs, we demonstrate that our method effectively extracts paraphrases with high precision, achieving success rates of 94.3% and 84.6%, respectively, for Korean and English.

• Proceedings of the Korean Society for Language and Information Conference
• /
• 1994.02a
• /
• pp.63-72
• /
• 1994

Dependency Grammar has been used by Iinguists as the basis of the syntactic components of their grammar formalisms. It has also been used in natural langauge parsing. In China, attempts have been made to use this grammar formalism to parse Chinese sentences using corpus based techniques. This paper reviews the properties of Dependency Grammar as embodied in four axioms for the well-formedness conditions for dependency structures. It is shown that allowing mul tiple governors as done by some followers of this formalism is unnecessary. The practice of augmenting Dependency Grammar with functional labels is discussed in the light of building functional structures when the sentence is parsed. This will also facilitate semantic interpretion.retion.

• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06b
• /
• pp.226-227
• /
• 2011

현재 국내의 음성도서 서비스는 수식을 정확하게 읽어주지 못하며, 수식을 읽기 위한 독음규칙의 부재로 수식의 음성 서비스에 혼란을 야기 시키고 있다. 이에 본 논문은 중학교 수학 교과서를 바탕으로 수식표현의 '한글 독음규칙'을 정의해보았으며, 수식의 국내 음성 서비스를 위해, 정의된 '한글 독음 규칙'을 매스 파스 트리(Math Parse tree)와 매핑 하여 최종적으로 음성서비스가 가능한 수식의 음성 변환 기법에 관해 연구하였다.