• 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 the Institute of Electronics and Information Engineers
• /
• v.52 no.9
• /
• pp.135-140
• /
• 2015

Web-services employ XML that is the well-formed structure as a de-facto standard to represent data. SOAP or REST is one of the representative web-services using XML based massage passing systems. The XML parser can be divided into event driven and DOM tree. A streaming parser as an event driven is widely used for high-speed parsing. Since the streaming parser processes XML documents in sequence, they have any limitation to improve system performance. In order to improve speed of streaming XML parser, we present multibyte based streaming XML hardware parser using the element analyzer instead of the state machine. Compared to other parsers, the proposed MStreXHP can achieve about 2.72 times improvement in the number of clock cycles to be consumed in comparison of characters and sustain about 7.8Gbps throughput. Therefore, our MStreXHP is desirable for the streaming XML hardware parser on high-performance systems.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.05a
• /
• pp.72-75
• /
• 2009

XML과 웹서비스의 등장으로 전자문서 관리의 중요성이 대두되었고, 효율적인 관리를 위해 많은 기업들이 기술 개발을 해오고 있다. 그러나 웹언어나 프로토콜에 대한 공개 표준이 제정 되지 않아 기업들은 개별적으로 웹서비스를 구축하고 이는 인터넷 시장과 웹의 분열을 가져왔다. 이에 W3C에서는 웹 상호운용성을 목표로 XML표준안을 공표했다. MusicXML, MathML, CML(Chemistry Markup Language), WML(Wireless Markup Language)등은 모두 특정한 용도를 가지는 XML기반의 마크업 언어들이다. XML은 단지 웹 환경만을 위한 표준이 아니라 인터넷 전반에서 데이터를 생성, 저장, 변환하기 위한 보편적인 표준으로 자리 잡고 있다. 본 논문에서는 모바일환경과 웹 환경에서 동시 서비스가 가능한 XML 웹서비스를 구현하였다. XML 웹서비스는 인터넷 표준기술인 XML과 HTTP를 사용하는데, XML기반의 SOAP메시지를 파싱하기 위하여 WIPI와 HTML기반으로 설계, 개발하였다. 제안하는 XML Parser는 PULL모델을 변형한 이벤트 방식이다. 제안한 Parser는 모바일기기와 웹 환경에서 동시 사용가능한 인터넷 서점에 적용하였고, 제안하는 XML Parser와 기존의 Parser들과의 벤치마킹을 통해 속도비교를 함으로써 Parsing속도의 향상을 나타내었다.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.3
• /
• pp.14-23
• /
• 1994

A natural language processing system usually has the demerit that its processing time is relatively long. If an interactive system makes its user kept waiting long, it can't be said to be practical. In this paper, the on-line natural language parser in which its processing coincides with the sentence's inputting is designed. Since the greater part of morpholgical and syntatic semantic analysis is already performed during the keyboard input, user can get a prompt response. Moreover, the Korean parser is implemented in multitasking environment, and it is compared with an off-line parser. The on-line parser can be considered to be efficient for its real time processing.

• Annual Conference on Human and Language Technology
• /
• 2018.10a
• /
• pp.3-7
• /
• 2018

본 연구진은 모든 형태소 분석 후보에 적절한 의존관계를 부여하여 구문분석 트리 후보를 순위화하여 제시하는 한국어 구문 분석 시스템 BCD-KL-Parser를 개발하고 있다. 이 시스템의 최종목표는 형태소 분석후보와 구문분석 트리 후보를 줄여나감으로써, 구문분석의 정확도와 실행 속도를 높이는 것이다. 본 논문에서 소개하는 BCD-KL-Parser에서는 형태적 중의성 해소규칙을 정의하여 형태소 분석후보의 수를 줄이고, 용언의 하위범주화 정보와 선택제약 정보 그리고 의존관계 제약규칙을 정의하여 구문분석 트리 후보의 수를 최소화할 수 있었다. 그 결과 '21세기 세종계획 구문분석 말뭉치'에서 무작위로 추출한 2,167문장에 대하여 UAS 92.27%를 달성할 수 있었다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10a
• /
• pp.259-261
• /
• 2003

Xml 파서들의 벤치 마킹 결과에서 기존 파서와는 달리 JFlex와 BYacc/J를 사용한 Piccolo는 다른 파서들에 비해 0.5 ~ 1.5배 향상된 빠른 속도의 파싱 속도를 나타내었다. 하지만 XML Pull 모델의 표준 interface인 XPP(XML Pull Parser)가 제정되고 안정화됨에 따라서 MXP(XPP Version 3.0)［1］는 기존 XML 파서들과 달리 Parser Generator tool을 사용하여 가장 빠른 파싱 속도를 보였던 Piccolo 파서［2］보다도 빠른 파싱 속도를 나타내었고 이는 현 XML파서 중 가장 빠른 파싱 속도로 Pull 모델이 기존의 Object, Push 보다 빠른 모델이라는 점을 입증하였다. 본 논문에서는 Pull Parser를 구현하는데 있어 Piccolo에서 사용한 JFlex와 BYacc/J를 사용함으로 Pull 파서의 속도를 한층 더 높여 Piccolo, MXP 보다 빠른 파싱 속도를 내는 파서를 구현하기 위한 JFlex와 BYacc/J의 적용방안에 대해 연구하였다.

• The Journal of the Acoustical Society of Korea
• /
• v.20 no.4
• /
• pp.42-47
• /
• 2001

In this paper, we propose an interpreter, which recognizes the VoiceXML markups, verifies the validation of the document, and interprets the VoiceXML documents using DI parser and the generated AST by the parser. The VoiceXML interpreter consists of DI parser and executor, and the DI parser uses recursive descent parsing technology, and the executor uses FIA (Form Interpretation Algorithm) proposed by VXML forum. This system uses the Java language in order to develop the runtime environment for VoiceXML efficiently, thus this system has portability.

• Journal of KIISE:Software and Applications
• /
• v.28 no.5
• /
• pp.448-448
• /
• 2001

The definitions in Korean dictionary not only describe meanings of title, but also include various semantic information such as hypernymy/hyponymy, meronymy/holonymy, polysemy, homonymy, synonymy, antonymy, and semantic features. This paper purposes to implement a parser as the basic tool to acquire automatically the semantic information from the definitions in Korean dictionary. For this purpose, first we constructed the part-of-speech tagged corpus and the tree tagged corpus from the definitions in Korean dictionary. And then we automatically extracted from the corpora the frequency of words which are ambiguous in part-of-speech tag and the grammar rules and their probability based on the statistical method. The parser is a kind of the probabilistic chart parser that uses the extracted data. The frequency of words which are ambiguous in part-of-speech tag and the grammar rules and their probability resolve the noun phrase's structural ambiguity during parsing. The parser uses a grammar factoring, Best-First search, and Viterbi search In order to reduce the number of nodes during parsing and to increase the performance. We experiment with grammar rule's probability, left-to-right parsing, and left-first search. By the experiments, when the parser uses grammar rule's probability and left-first search simultaneously, the result of parsing is most accurate and the recall is 51.74% and the precision is 87.47% on raw corpus.

• KIPS Transactions on Software and Data Engineering
• /
• v.10 no.6
• /
• pp.235-242
• /
• 2021

In this work, we develop a Korean dependency parser based on a stack-pointer network that consists of a pointer network and an internal stack. The parser has an encoder and decoder and builds a dependency tree for an input sentence in a depth-first manner. The encoder of the parser encodes an input sentence, and the decoder selects a child for the word at the top of the stack at each step. Since the parser has the internal stack where a search path is stored, the parser can utilize information of previously derived subtrees when selecting a child node. Previous studies used only a grandparent and the most recently visited sibling without considering a subtree structure. In this paper, we introduce graph attention networks that can represent a previously derived subtree. Then we modify our parser based on the stack-pointer network to utilize subtree information produced by the graph attention networks. After training the dependency parser using Sejong and Everyone's corpus, we evaluate the parser's performance. Experimental results show that the proposed parser achieves better performance than the previous approaches at sentence-level accuracies when adopting 2-depth graph attention networks.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.8
• /
• pp.1851-1856
• /
• 2013

An XML is widely used for web services, such as SOAP(Simple Object Access Protocol) and REST (Representational State Transfer), and also de facto standard for representing data. Since the XML parser using DOM(Document Object Model) requires a preprocessing task creating a DOM-tree, and then storing it into memory, embedded systems with limited resources typically employ a streaming XML parser without preprocessing. In this paper, we propose a new architecture for the streaming XML parser using an APSearch(Adaptive Parallel Search) on FPGA(Field Programmable Gate Array). Compared to other approaches, the proposed APSearch parser dramatically reduces overhead on the software side and achieves about 2.55 and 2.96 times improvement in the time needed for an XML parsing. Therefore, our APSearch parser is suitable for systems to speed up XML parsing.