• 제목/요약/키워드: Syntactic Complexity

Search Result 38, Processing Time 0.025 seconds

Three-Phase English Syntactic Analysis for Improving the Parsing Efficiency (영어 구문 분석의 효율 개선을 위한 3단계 구문 분석)

  • Kim, Sung-Dong
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.5 no.1
    • /
    • pp.21-28
    • /
    • 2016
  • The performance of an English-Korean machine translation system depends heavily on its English parser. The parser in this paper is a part of the rule-based English-Korean MT system, which includes many syntactic rules and performs the chart-based parsing. The parser generates too many structures due to many syntactic rules, so much time and memory are required. The rule-based parser has difficulty in analyzing and translating the long sentences including the commas because they cause high parsing complexity. In this paper, we propose the 3-phase parsing method with sentence segmentation to efficiently translate the long sentences appearing in usual. Each phase of the syntactic analysis applies its own independent syntactic rules in order to reduce parsing complexity. For the purpose, we classify the syntactic rules into 3 classes and design the 3-phase parsing algorithm. Especially, the syntactic rules in the 3rd class are for the sentence structures composed with commas. We present the automatic rule acquisition method for 3rd class rules from the syntactic analysis of the corpus, with which we aim to continuously improve the coverage of the parsing. The experimental results shows that the proposed 3-phase parsing method is superior to the prior parsing method using only intra-sentence segmentation in terms of the parsing speed/memory efficiency with keeping the translation quality.

Derivational approach and representational approach in generative grammar (생성문법에서 도출적 접근과 표시적 접근)

  • Choe, Sook-Hee
    • English Language & Literature Teaching
    • /
    • v.10 no.1
    • /
    • pp.179-200
    • /
    • 2004
  • The purpose of this study is to investigate the adequacy of derivational approach and representational approach to syntactic theories in generative grammar. As the generative grammar is based on the derivational process of syntactic theories, it is suggested that derivational approach is more valid than representational approach. Move, Economy Principle, Local Economy and Label-free Phrase Structure in Minimalist framework support the preference of derivational approach to representational approach with the elimination of computational complexity, minimality, and label-free phrase structure. Syntactic structure is considered as the result of the interaction of the properties of lexical items containing probe and economy conditions constrained by bare output conditions. On the other hand, Pseudogapping in Lasnik(1999) is analyzed in terms of Object Shift, that is, overt raising to Spec of $Agr_o$ and the PF deletion of VP in representational approach. Hence, it is suggested that the combination of derivational and representational approaches to syntactic theories can be admitted in generative grammar.

  • PDF

Processing Dependent Nouns Based on Chunking for Korean Syntactic Analysis (한국어 구문분석을 위한 구묶음 기반 의존명사 처리)

  • Park Eui-Kyu;Ra Dong-Yul
    • Korean Journal of Cognitive Science
    • /
    • v.17 no.2
    • /
    • pp.119-138
    • /
    • 2006
  • It is widely known that chunking is beneficial to syntactic analysis. This paper introduces a method of chunking thai is useful for structural analysis of sentences in Korean. Dependent nouns in Korean usually tend to make sentences complex and long. By performing chunking operations related with dependent nouns, it is possible to reduce sentence complexity and thus make syntactic analysis easier. With this aim in mind we investigated techniques for chunking related with dependent nouns. We proposed a variety of chunking schemes according to the types of dependent nouns. The experiments showed that carrying out chunking leads to significant improvement of performance in syntactic analysis for Korean.

  • PDF

Mismatches in Korean Copula Constructions and Linearization Effects

  • Chan Chung;Kim, Jong-Bok
    • Proceedings of the Korean Society for Language and Information Conference
    • /
    • 2002.02a
    • /
    • pp.36-49
    • /
    • 2002
  • One main complexity of the copula constructions concerns a mismatch between morphology and syntactic constituency: the copula seems to form a morphological unit with the immediately preceding element, whereas in terms of syntax the copula appears to take this as its syntactic complement. In capturing such mismatches, we show that the copula is treated as an independent verb at the level of tectogrammatical structure (or syntax tree), whereas as a bound morpheme at the level of phonogram-matical structure (or domain tree), in terms of Dowty 1992 (or Reape 1994). This paper, adopting the notion of DOMAIN in HPSG, shows that copula constructions are a subtype of compacting-constructions. These constructions compact the domain value of the copula and that of its preceding element together into one domain unit, eventually making it inert to syntactic phenomena such as scrambling, deletion and pro-form substitution. This construction-based approach provides a clean analysis for the formation of the copula construction and related phenomena.

  • PDF

Pattern Recognition Using Attributed Grammar (속성문법에 의한 물체인식)

  • Yim, Seung-Cheol;Kim, Tae-Kyun;Kwon, Oh-Suk
    • Proceedings of the KIEE Conference
    • /
    • 1988.07a
    • /
    • pp.675-678
    • /
    • 1988
  • This paper describes the method of syntactic-semantic pattern recognition and description for two dimensional object which is adjusted or changed in size and its orientation. To avoid the complexity and ambiguity which is arised in the case of syntactic or decision-theoretic method is used individually, an attributed grammar is introduced which applies computative attributes to pattern primitives, and then uses decision-theoretic method for attributes and syntactic method for pattern structure. A primitive extraction embedding parsing and grobal rule for classification is also applied for more effective pattern recognition and description.

  • PDF

Software Complexity Measure Based on Program Control Structure Using Petri Nets (패트리넷트를 이용한 프로그램의 제어구분적 복잡도)

  • Lee, Jong-Geun;Song, Yu-Jin
    • The Transactions of the Korea Information Processing Society
    • /
    • v.2 no.3
    • /
    • pp.335-342
    • /
    • 1995
  • In this pater, we present a syntactic software complexity measure based on program control structure using Petri Nets. Since control structure in program may be segregated by three structures such as sequence, condition and iteration structures, we are proposed a structured complexity measure based on program control structure after represented by Petri Nets. Finally, we compare our result with other measures of program complexity.

  • PDF

An Abstraction Method for State Minimization based on Syntactic and Semantic Patterns in the Execution Space of Real-Time Systems (실시간 시스템의 실행 공간상에서 구문 및 의미패턴에 기반한 상태 최소화를 위한 추상화 방법)

  • 박지연;조기환;이문근
    • Journal of KIISE:Software and Applications
    • /
    • v.30 no.1_2
    • /
    • pp.103-116
    • /
    • 2003
  • States explosion due to composition of spaces of data, temporal, and locational values is one of the well-known critical problems which cause difficulty in understanding and analysing real-time systems specified with state-based formal methods. In order to overcome this problem, this paper presents an abstraction method for state minimization based on an abstraction in system specification and an abstraction in system execution. The first is named the syntactic in system specification and an abstraction in system execution. The first is named the syntactic abstraction, through which the patterns of the unconditionally internalized computation and the repetition and selection structures are abstracted. The latter is named the semantic abstraction, through which the patterns of the execution space represented with data. Through the abstractions, the components of a system in specification and execution model is hierarchically organized. The system can be analyzed briefly in the upper level in an skeleton manner with low complexity. The system, however, can be abstraction method for the state minimization and the decrease in analysis complexity through the abstraction with examples.

Combinatory Categorial Grammar for the Syntactic, Semantic, and Discourse Analyses of Coordinate Constructions in Korean (한국어 병렬문의 통사, 의미, 문맥 분석을 위한 결합범주문법)

  • Cho, Hyung-Joon;Park, Jong-Cheol
    • Journal of KIISE:Software and Applications
    • /
    • v.27 no.4
    • /
    • pp.448-462
    • /
    • 2000
  • Coordinate constructions in natural language pose a number of difficulties to natural language processing units, due to the increased complexity of syntactic analysis, the syntactic ambiguity of the involved lexical items, and the apparent deletion of predicates in various places. In this paper, we address the syntactic characteristics of the coordinate constructions in Korean from the viewpoint of constructing a competence grammar, and present a version of combinatory categorial grammar for the analysis of coordinate constructions in Korean. We also show how to utilize a unified lexicon in the proposed grammar formalism in deriving the sentential semantics and associated information structures as well, in order to capture the discourse functions of coordinate constructions in Korean. The presented analysis conforms to the common wisdom that coordinate constructions are utilized in language not simply to reduce multiple sentences to a single sentence, but also to convey the information of contrast. Finally, we provide an analysis of sample corpora for the frequency of coordinate constructions in Korean and discuss some problematic cases.

  • PDF

Terrain Matching Technique Using 3-D Terrain Maps (3차원 지형정보를 이용한 지형영상의 정합기법)

  • 김준식;강민석;박래홍;이쾌희
    • Korean Journal of Remote Sensing
    • /
    • v.7 no.1
    • /
    • pp.13-27
    • /
    • 1991
  • DEM(digital elevation map) is a very useful information in various applications. In this paper, we have studied on the terrain matching algorithm using the DEM, which was proposed by Rodriguez and Aggarwal(1990) for an aircraft navigation system. We evaluated its performance using syntactic images. Cliff maps and critical points are used for the reduction of computation time and information size to be processed. The computer simulation shows that though the computational complexity is high, the technique is efficient even to noisy images.

Analysis of Web Browser Security Configuration Options

  • Jillepalli, Ananth A.;de Leon, Daniel Conte;Steiner, Stuart;Alves-Foss, Jim
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.12
    • /
    • pp.6139-6160
    • /
    • 2018
  • For ease of use and access, web browsers are now being used to access and modify sensitive data and systems including critical control systems. Due to their computational capabilities and network connectivity, browsers are vulnerable to several types of attacks, even when fully updated. Browsers are also the main target of phishing attacks. Many browser attacks, including phishing, could be prevented or mitigated by using site-, user-, and device-specific security configurations. However, we discovered that all major browsers expose disparate security configuration procedures, option names, values, and semantics. This results in an extremely hard to secure web browsing ecosystem. We analyzed more than a 1000 browser security configuration options in three major browsers and found that only 13 configuration options had syntactic and semantic similarity, while 4 configuration options had semantic similarity, but not syntactic similarity. We: a) describe the results of our in-depth analysis of browser security configuration options; b) demonstrate the complexity of policy-based configuration of web browsers; c) describe a knowledge-based solution that would enable organizations to implement highly-granular and policy-level secure configurations for their information and operational technology browsing infrastructures at the enterprise scale; and d) argue for necessity of developing a common language and semantics for web browser configurations.