• Title/Summary/Keyword: parsing

Search Result 506, Processing Time 0.025 seconds

(Prediction of reduction goals : deterministic approach) (리덕션 골의 예상: 결정적인 접근 방법)

  • 이경옥
    • Journal of KIISE:Software and Applications
    • /
    • v.30 no.5_6
    • /
    • pp.461-465
    • /
    • 2003
  • The technique of reduction goal prediction in LR parsing has several applications such as the computation of right context. An LR parser generating the set of pre-determined reduction goals was previously suggested. The set approach is nondeterministic, and so it is inappropriate in some applications. This paper suggests a deterministic technique to give a uniquely predictable reduction symbol.

Dependency Grammar and the Parsing of Chinese Sentences

  • Lai, Bong-Ycung-Tom;Huang, Changning
    • 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.

  • PDF

Parsing the Wh-Interrogative Construction in Korean

  • Yang, Jaehyung;Kim, Jong-Bok
    • Language and Information
    • /
    • v.17 no.2
    • /
    • pp.51-66
    • /
    • 2013
  • Korean is a wh-in-situ language where the wh-expression stays in situ with an obligatory Q-particle marking its interrogative scope. This paper briefly reviews some basic properties of the wh-question construction in Korean and shows how a typed feature structure grammar, HPSG (Pollard and Sag 1994, Sag et al. 2003), together with the notions of 'type hierarchy' and 'constructions', can provide a robust basis for parsing the wh-construction in the language. We show that this system induces robust syntactic structures as well as enriched semantic representations for real-time applications such as machine translation, which require deep processing of the phenomena concerned.

  • PDF

Morphological Processing with LR Techniques (LR 테크닉을 이용한 형태소 분석)

  • 이강혁
    • Korean Journal of Cognitive Science
    • /
    • v.4 no.2
    • /
    • pp.115-143
    • /
    • 1994
  • In this paper,I present an extended two-level model using LR parsing techniques.The LR-based two-level model not only guarantees effcient morphological processing but also achieves a higher degree of descriptive adequacy than Koskenniemi's original model.The two-level model is augmented with an independent morphosyntactic module based on feature-based CF word grammar.By adopting a CF word grammar,our model is capable of dealing with complex words with discontinuous dependencies without having duplicate lexicons.It is shown how LR predictions manifested in the parsing table can help the morphological processor to minimize the dictionary lookup process.

Application of Natural Language Processing(1) : Understanding of the Hangul Sentences for Simple Computer Manipulation (자연어 활용(1) : 간편한 컴퓨터 조작을 위한 한글 문장 이해에 관한 연구)

  • 장덕성;이동애
    • Korean Journal of Cognitive Science
    • /
    • v.3 no.1
    • /
    • pp.41-60
    • /
    • 1991
  • Most of the PC users manipulate the computer by using a few commands which are familiar with them. However by using Hangul sentences instead of using DOS commands, the optimal commands can be generated and flexibility can be provided. For this purpose, the conversion method of the input sentence into DOS commands is studied by means of morphological analysis, syntactic analysis, semantic analysis, and conceptual analysis. Tabular parsing is used in morphological analysis. case grammar is used in syntactic and semantic analysis. Case grammar is used in syntactic and semantic analysis. The meaning of sentence is represeented by the semantic network, from which we can generate a sequence DOS commands.

Structure Based Information Retrieval Algorithm Using XML Technology and String Matching Algorithm (XML 기술과 스트링 매칭 기법을 이용한 구조 기반 정보 검색 알고리즘)

  • Han, Gi-Deok;Kwon, Hyuk-Chul
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2007.06c
    • /
    • pp.171-176
    • /
    • 2007
  • Parsing 작업의 결과인 Parse Tree 정보는 문장에 관한 구조적 정보를 가지고 있는 Tree 정보로 이 정보를 이용하여 정보 검색에 활용하는 알고리즘을 제안한다. 제안하는 알고리즘은 XML 기술과 스트링 매칭 기법을 이용하였으며, 사용한 스트링 매칭 기법은 Approximate String Matching 기법이다. Query 정보와 문서 정보를 Parsing하여 얻은 Parse Tree를 XML 형태의 정보로 변환한 후, 두 정보를 가지고 Approximate String Matching 기법을 적용하여 Query 정보와 문서 정보 간의 유사도를 계산한다. 제안하는 알고리즘의 장점은 구조 기반의 정보 검색 기능이 가능하고 비슷한 정보에 대한 검색 기능이 가능하며 비슷한 구조에 대한 검색 기능이 가능하다는 것이다.

  • PDF

Improved Deep Biaffine Attention for Korean Dependency Parsing (한국어 의존 구문 분석을 위한 개선된 Deep Biaffine Attention)

  • O, Dongsuk;Woo, Jongseong;Lee, Byungwoo;Kim, Kyungsun
    • Annual Conference on Human and Language Technology
    • /
    • 2018.10a
    • /
    • pp.608-610
    • /
    • 2018
  • 한국어 의존 구문 분석(Dependency Parsing)은 문장 어절의 중심어(head)와 수식어(modifier)의 의존관계를 표현하는 자연어 분석 방법이다. 최근에는 이러한 의존 관계를 표현하기 위해 주의 집중 메커니즘(Attention Mechanism)과 LSTM(Long Short Term Memory)을 결합한 모델들이 높은 성능을 보이고 있다. 본 논문에서는 개선된 Biaffine Attention 의존 구문 분석 모델을 제안한다. 제안된 모델은 기존의 Biaffine Attention에서 의존성과 의존 관계를 결정하는 방법을 개선하였고, 한국어 의존 구문 분석을 위한 입력 열의 형태소 표상을 확장함으로써 기존의 모델보다 UAS(Unlabeled Attachment Score)가 0.15%p 더 높은 성능을 보였다.

  • PDF

A Study of Main Contents Extraction from Web News Pages based on XPath Analysis

  • Sun, Bok-Keun
    • Journal of the Korea Society of Computer and Information
    • /
    • v.20 no.7
    • /
    • pp.1-7
    • /
    • 2015
  • Although data on the internet can be used in various fields such as source of data of IR(Information Retrieval), Data mining and knowledge information servece, and contains a lot of unnecessary information. The removal of the unnecessary data is a problem to be solved prior to the study of the knowledge-based information service that is based on the data of the web page, in this paper, we solve the problem through the implementation of XTractor(XPath Extractor). Since XPath is used to navigate the attribute data and the data elements in the XML document, the XPath analysis to be carried out through the XTractor. XTractor Extracts main text by html parsing, XPath grouping and detecting the XPath contains the main data. The result, the recognition and precision rate are showed in 97.9%, 93.9%, except for a few cases in a large amount of experimental data and it was confirmed that it is possible to properly extract the main text of the news.

Prediction of Prosodic Boundaries Using Dependency Relation

  • Kim, Yeon-Jun;Oh, Yung-Hwan
    • The Journal of the Acoustical Society of Korea
    • /
    • v.18 no.4E
    • /
    • pp.26-30
    • /
    • 1999
  • This paper introduces a prosodic phrasing method in Korean to improve the naturalness of speech synthesis, especially in text-to-speech conversion. In prosodic phrasing, it is necessary to understand the structure of a sentence through a language processing procedure, such as part-of-speech (POS) tagging and parsing, since syntactic structure correlates better with the prosodic structure of speech than with other factors. In this paper, the prosodic phrasing procedure is treated from two perspectives: dependency parsing and prosodic phrasing using dependency relations. This is appropriate for Ural-Altaic, since a prosodic boundary in speech usually concurs with a governor of dependency relation. From experimental results, using the proposed method achieved 12% improvement in prosody boundary prediction accuracy with a speech corpus consisting 300 sentences uttered by 3 speakers.

  • PDF

Redundancy assessment of PIMS and PIPL by parsing (구문분석을 통한 PIMS와 PIPL의 중복성 평가)

  • Kim, So-Ra;Kim, Tae-Sung
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.26 no.3
    • /
    • pp.745-756
    • /
    • 2016
  • As infringement accidents of personal information have often occurred and estimates of damages are too large, the government introduces many certifications related with personal information management system for protecting personal information. Among them, PIMS and PIPL share many points in common, so many complaints about duplicate regulation have been suggested. This study evaluates the duplication of two certifications in order to examine redundancy between PIMS and PIPL both of which have been controversial.