• Korean Journal of Cognitive Science
• /
• v.12 no.3
• /
• pp.1-18
• /
• 2001

The goal of this paper is the pedagogical application of a Korean Spell/Grammar Checker to the web-based language learning system for Korean writing. To maximize the efficient instruction of our learning system \\`Urimal Baeumteo\\` we have to improve our Korean Spell/Grammar Checker. Today the NLP system\\`s performance defends on its semantic processing capability. In our Korean Spell/Grammar Checker. the tasks accomplished in the semantic level are: the detection and correction of misused derived and compound nouns in a Korean spell-checking device and the detection and correction of syntactic and semantic errors in a Korean grammars-checking device. We describe a common approach to the partial parsing using collocation rules based on the dependency grammar. To provide more detailed semantic rules. we classified nouns according to their concepts. and subcategorized verbs referring to their syntactic and semantic features. Improving a Korean Spell/Gl-Grammar Checker makes our learning system active and intelligent in a web-based environment. We acknowledge the flaws in our system: the classification of nouns based on their meanings and concepts is a time consuming task. the analytic unit of this study is principally limited to the phrases in a sentence therefore the accurate parsing of embedded sentences remains a difficult problem to solve. Concerning the web-based language learning system. it is critically important to consider its interface design and structure of its contents.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.49 no.4
• /
• pp.77-84
• /
• 2012

Face classification has wide applications in intelligent video surveillance, content retrieval, robot vision, and human-machine interface. Pose and expression changes, and arbitrary illumination are typical problems for face recognition. When the face is captured at a distance, the image quality is often degraded by blurring and noise corruption. This paper investigates the efficacy of multi-classifier decision level fusion for face classification based on the photon-counting linear discriminant analysis with two different cost functions: Euclidean distance and negative normalized correlation. Decision level fusion comprises three stages: cost normalization, cost validation, and fusion rules. First, the costs are normalized into the uniform range and then, candidate costs are selected during validation. Three fusion rules are employed: minimum, average, and majority-voting rules. In the experiments, unfocusing and motion blurs are rendered to simulate the effects of the long distance environments. It will be shown that the decision-level fusion scheme provides better results than the single classifier.

• Journal of Digital Convergence
• /
• v.11 no.1
• /
• pp.225-236
• /
• 2013

The voice recognition has been made continuously. Now, this technology could support even natural language beyond recognition of isolated words. Interests for the voice recognition was boosting after the Siri, I-phone based voice recognition software, was presented in 2010. There are some occasions implemented voice enabled services using Korean voice recognition softwares, but their accuracy isn't accurate enough, because of background noise and lack of control on voice related features. In this paper, we propose a sort of multi-purpose preprocessor to improve this situation. This supports Keyword spotting in the continuous speech in addition to noise filtering function. This should be independent of any voice recognition software and it can extend its functionality to support continuous speech by additionally identifying the pre-predicate and the post-predicate in relative to the spotted keyword. We get validation about noise filter effectiveness, keyword recognition rate, continuous speech recognition rate by experiments.

• The KIPS Transactions:PartA
• /
• v.15A no.3
• /
• pp.161-166
• /
• 2008

In this paper, an efficient digit-serial systolic array is proposed for multiplication in finite field GF($2^m$) using the polynomial basis representation. The proposed systolic array is based on the most significant digit first (MSD-first) multiplication algorithm and produces multiplication results at a rate of one every "m/D" clock cycles, where D is the selected digit size. Since the inner structure of the proposed multiplier is tree-type, critical path increases logarithmically proportional to D. Therefore, the computation delay of the proposed architecture is significantly less than previously proposed digit-serial systolic multipliers whose critical path increases proportional to D. Furthermore, since the new architecture has the features of a high regularity, modularity, and unidirectional data flow, it is well suited to VLSI implementation.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.04a
• /
• pp.24-26
• /
• 2000

본 논문에서는 RSA 암호 시스템의 핵심 과정인 모듈로 멱승(Modular Exponentiation) 연산에 대한 새로운 하드웨어 구조를 제시한다. 기존의 몽고메리 알고리즘을 사용하였지만 다른 논문들이 Dependence Graph를 수직으로 매핑(Mapping)한 것과는 달리 여기서는 수평으로 매핑하여 1차원 선형 어레이(linear array) 구조를 구성하였다. 본 논문에서 사용한 방법의 장점은 결과가 시리얼(serial)로 나와서 바로 입력으로 들어갈 수 있기 때문에 100%의 처리율(throughput)을 이룰 수 있고, 수직 매핑 방식에 비해 절반의 클럭 횟수로 연산을 해낼 수 있다는 점이다. 또한 내부 계산 구조의 지역성(Locality) , 규칙성(Regularity) 및 모듈성(Modularity) 등으로 인해 실시간 고속 처리를 위한 VLSI 구현에 적합하다.

• Annual Conference on Human and Language Technology
• /
• 1999.10e
• /
• pp.121-127
• /
• 1999

기계번역기의 방법론인 규칙기반, 예제기반, 패턴기반, 통계기반 각각이 기계번역의 모든 면모를 만족시킬 수 없다는 데에는 이의가 없다. 이러한 여러 방법론의 적절한 융합을 위하여, 이 논문에서는 혼합형 파이프라인 다엔진형 기계번역기로서 중한기계번역기 MATES/CK에 대한 설계 철학, 부분 모듈, 구현 등에 관하여 소개하고자 한다. MATES/CK의 원형시스템(prototype system)은 이미 구축되었으며 전체 시스템은 여전히 구현 및 보완 중에 있다.

• Journal of KIISE:Software and Applications
• /
• v.30 no.10
• /
• pp.894-903
• /
• 2003

Though XML is widely used, it is still hard for end users to write XML documents. A lot of XML documents are data-centric documents which have formal data format. Even novices can easily write the data-centric XML documents if they use form-based GUIs. In this paper, we introduce a new method for generating form-based XML editor for data-centric XML documents automatically and an XML editor generator called XED. The DTD consists of sequence, choice, and repetition, and this structure can be represented with Document Decomposition Graph(DDG). XED allows users to generate an XML editor by applying the presentation rules to DDG. It also permits users to modify generated editor through changing editor`s GUI properties with direct manipulation.

• Annual Conference of KIPS
• /
• 2000.10a
• /
• pp.55-58
• /
• 2000

컴퓨터의 사용이 보편화되고, 정보화 사회로 발전해감에 따라 이 기종간의 문서 정보 교환 및 인터넷과 네트웍 인프라의 향상으로 인한 문서 처리량은 계속 증대되고 있다. 또한 문서의 표현 방법 및 문서량의 증대로 인해 사용자의 요구는 다양해져가고 있다. 기존의 웹(Web)에서 사용되고 있는 HTML(Hyper-Text Markup Language)은 고정된 태그를 사용해서, 사용자가 직접 논리적인 구조를 갖는 문서를 작성할 수 가 없었다. 이에 W3C에서는 XML을 발표하여, 사용자가 논리 구조를 가진 문서를 작성할 수 있도록 하였다. 이러한 XML 문서의 논리적인 구조를 표현하려면, XML 문서 안에 어떤 것을 담을 수 있는지에 대한 규칙들의 집합인 스키마(Schema)가 필요하다. 현재 여러 종류의 스키마가 사용되고 있으며, 이를 이용한 다양한 문서들이 사용되고 있다. 본 논문에서는 현재 가장 많이 사용되고 있는 스키마인 DTD를 보다 쉽게 작성할 수 있는 자바 기반의 스키마 편집기를 설계 및 구현하였다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.8
• /
• pp.1705-1712
• /
• 2009

Recently, most Korean syntactic analysis systems use Dependency Grammar, because it is quite good to analysis of Korean language structures. But Dependency Grammar makes many ambiguities during syntax analysis of Korean. We implement a system which decreases many ambiguities in syntax analysis. To decrease ambiguities we suggest several methods. First, we use about 200 dependency rules, second, we suggest a new segmentation method and third, one predicate can not have more than one subject or object. Using these methods, we can reduce many ambiguities in Korean syntactic analysis.

• Journal of the Institute of Convergence Signal Processing
• /
• v.5 no.2
• /
• pp.91-95
• /
• 2004

In this paper, we propose a fuzzy controller for the evaluation of the quantization parameters in the H.263 coder. Our method adopts the Mamdani method for fuzzification and adopts the centroid method for defuzzification respectively. The inputs are variance, entropy in the spatial domain, current motion vector and previous motion vector in the temporal. Fuzzy variables are determined to be compatible in visual characteristics and fuzzy membership function is induced and then, FAM banks are designed to reduce the number of rules. In this paper, fuzzy quantization has been applied to a practical video compression. This results show that the quality of decode image enhances and the rate control method using fuzzy quantization is effective.