• The KIPS Transactions:PartB
• /
• v.9B no.3
• /
• pp.383-388
• /
• 2002

We developed a spatial parser generator, SPG, which can automatically create a spatial parser if CMG(Constraint Multiset Grammars) grammars for a visual language are provided by the user with GUI(Graphical User Interface). SPG has the following features. (1) The user uses a visual editor to define the grammars of a virtual language and draw the visual language which should be parsed. (2) The user roughly defines CMG grammars in a visual wan at first. Then the user modifies them and defines final grammars. (3) Because SPG has a constraint solver, it maintains constraints in the parsed virtual language according to the grammars.

• Korean Journal of Cognitive Science
• /
• v.22 no.4
• /
• pp.429-447
• /
• 2011

In this paper, we propose a modified deterministic Korean dependency parser using a projectivity. The modified parser is improved by finding errors, such as cross dependency, from the original parsing results and correcting them according to the projectivity and head-final principles. Our parser also uses parsing history information in addition to rich features, which only a deterministic algorithm can use. Results on the modified parser for ETRI(2005) corpus, that consists of complex sentences, show that our parser outperforms other parsers.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.5
• /
• pp.495-508
• /
• 1992

This paper describes on implementation of SGML(Standardized General Markup Language )parser, which can analize SGML documents and its DTD(Document Type Deflnitton) defined according to the SGML( ISO 8879) .We have constructed a yacc definition file to present the rules of SGML DTD and documents, by which incoming SGML DTD and documents can be parsed Into the appropriate tokens. with the tokens a database with the stuctures such as entity table, element table and so on is built to vali-date the logical structure of the inconung SGML documents. The additional functions of this parser Include the automatic transforminng of the incoming documents with the short references into the complete SGML documents. Several test SGML documents have tested to clarify an implementation of this parser and experimental results are satisfactory.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04c
• /
• pp.31-33
• /
• 2003

XML을 파싱하는 기존의 파싱 Model인 Document Object Model은 메모리 내에 트리 구조와 같은 문서의 컨텐츠를 구성하기 때문에 메모리 사용이 많으며 Event 기반의 Push Model은 Consumer의 상태와 관계없이 파싱된 정보를 이벤트 처리 메소드를 이용함으로 처리의 지연, 처리의 지연을 위한 메모리 사용 등의 단점이 있다. 이에 반해 Pull 파싱 Model은 Client가 파싱의 요청을 하는 Model로써 Streaming Data를 파싱 할 시에 적은 지연시간, 메모리의 효율적인 사용 파싱속도가 신속하다는 장점이 있다. 따라서 본 논문에서는 XML 파서 설계에 있어서 Pull 파싱 모델에 파서 Generator tool인 JFlex와 BYacc/J를 사용하여 기존의 Xml Parser보다 파싱 속도를 향상시키는 Pull 파서의 설계 방법을 제안하고자 한다.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.1384-1387
• /
• 1996

SCPI(Standard Commands for Programmable Instrument) is a standard command sets designed for controlling various types of instruments. In order to control FFT(Fast Fourier Transform) analyzing device using SCPI it is required to support sweep measurement function. We defined SCPI command set for FFT analysis and developed parser of defined command set using lex(Lexical Analyzer Generator) and yacc(Yet Another Compiler Compiler). After developing FFT analyzing test was performed with that parser. Up to audible signal frequency the result of FFT analysis was accurate and that result was agree with that of conventional FFT analyzer. As a result it is proved that various types of instruments including sweep measurement instrument can be controlled with appropriate SCPI command sets. Also when developing new instruments the method used in this experiment will contribute to reducing the time required to develop the SCPI parser and increasing reliability.

• ETRI Journal
• /
• v.25 no.4
• /
• pp.219-230
• /
• 2003

This paper describes a rule-based approach for syntactic disambiguation used by the English sentence parser in E-TRAN 2001, an English-Korean machine translation system. We propose Parser's Ambiguity Type Information (PATI) to automatically identify the types of ambiguities observed in competing candidate trees produced by the parser and synthesize the types into a formal representation. PATI provides an efficient way of encoding knowledge into grammar rules and calculating rule preference scores from a relatively small training corpus. In the overall scoring scheme for sorting the candidate trees, the rule preference scores are combined with other preference functions that are based on statistical information. We compare the enhanced grammar with the initial one in terms of the amount of ambiguity. The experimental results show that the rule preference scores could significantly increase the accuracy of ambiguity resolution.

• Proceedings of the KIEE Conference
• /
• 2007.04a
• /
• pp.278-280
• /
• 2007

In this paper, wd design the Program Specific Information (PSI) parser and its On-Screen Display (OSD) on the middleware of ALi M3330 MPEG-2 decoder processor to analyze DVB-T Transport Stream(TS) information. To test the functional operation of the designed parser, we implement the DVB-T test board including the RF-tuner using ALi M3330 MPEP-2 decoder processor and confirm the correct operation using the input TS stream generated by DVB-T stream generator. The developed PSI parser could be used for the test environment, various channel extension, and the development of DVB-T reception module.

• Proceedings of the Korean Society for Language and Information Conference
• /
• 2007.11a
• /
• pp.249-258
• /
• 2007

This paper presents an implementation of a gramar of Dynamic Syntax for Japanese. Dynamic Syntax is a grammar formalism which enables a parser to process a sentence in an incremental fashion, establishing the semantic representation. Currently the application of lexical rules and transition rules in Dynamic Syntax is carried out arbitrarily and this leads to inefficient parsing. This paper provides an algorithm of rule application and partitioned parsing state for efficient parsing with special reference to processing Japanese, which is one of head-final languages. At the present stage the parser is still small but can parse scrambled sentences, relative clause constructions, and embedded clauses. The parser is written in Prolog and this paper shows that the parser can process null arguments in a complex sentence in Japanese.

• Proceedings of the Korean Society for Language and Information Conference
• /
• 2007.11a
• /
• pp.358-364
• /
• 2007

Syntax parsers can benefit from speakers' intuition about constituent structures indicated in the input string in the form of parentheses. Focusing on languages like Korean, whose orthographic convention requires more than one word to be written without spaces, we describe an algorithm for passing the bracketing information across the tagger to the probabilistic CFG parser, together with one for heightening (or penalizing, as the case may be) probabilities of putative constituents as they are suggested by the parser. It is shown that two or three constituents marked in the input suffice to guide the parser to the correct parse as the most likely one, even with sentences that are considered long.

• Communications of the Korean Institute of Information Scientists and Engineers
• /
• v.5 no.2
• /
• pp.61-84
• /
• 1987

This paper deals with actual constructions of programs for experiments in several parsers based on the theoritical results of others that represent on of the most fruiful contributions in computer science. Specifically the report deals with (1) a general computer representation of grammar (2) a precedence parser generator, (3) a LL (1) parser generator, (4) a practical SLR (1)/LALR (1) parser generator.