• Korean Journal of English Language and Linguistics
• /
• v.1 no.4
• /
• pp.609-627
• /
• 2001

Pronouns are frequently used in English, and their resolution is important to capture meaning of sentences. This paper provides a computational implementation for pronoun readings in English, based on Chierchia's (1988) Binding Theory in Categorial Grammar. A CCG-like system is newly devised for implementing his ideas, where syntactic phenomena are represented by the functor-argument relations of categories. This relation triggers resolution algorithms, and reflexives and pronominals are resolved succinctly. In sum, this paper gives an efficient resolution algorithm for English pronouns within Categorial Grammar.

• Korean Journal of English Language and Linguistics
• /
• v.4 no.2
• /
• pp.175-194
• /
• 2004

This paper provides computational algorithms for English Questions, by which we can effectively handle and implement Yes-No Questions and Wh-Questions. Those algorithms will be developed in Categorial Grammar. In this paper, we will modify and revise Steedman＇s Combinatory Categorial Grammar (CCG) so that we can computationally implement Questions effectively, which will be called a CCG-like system. In this system, semantic interpretations of Questions will be calculated compositionally based on the functor-arguments relations of the constituents. In sum, this paper provides analyses of Questions in Categorial Grammar, by which we can effectively implement Questions in English.

• Proceedings of the Korean Society for Language and Information Conference
• /
• 2002.02a
• /
• pp.296-307
• /
• 2002

This paper provides computational algorithms for a Korean reflexive caki, for which both sentence-bound and long-distance readings are possible. Its analyses are based on Chierichia's theory in Categorial Grammar, and a CCG-like system is introduced for the implementation. In this system, we can get both readings of caki with the same resolution mechanisms, while the difference is where the reflexive is resolved. These algorithms enable us to account for the distributions and characteristics off long-distance reflexive caki with a more unified way.

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

This paper investigates the nature of Japanese argument cluster (Steedman 2000b). Based on Combinatory Categorial Grammar, a type-raising analysis of case particles which captures some aspects of the information structure in Japanese is discussed, including contrastive interpretation of coordination, wh-constructions, and some theme and rheme-related grammatical phenomena. These observations offer further support for the study of syntax, semantics, and phonology interface and the earlier analysis of English information structure.

• 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.

• Korean Journal of Cognitive Science
• /
• v.2 no.1
• /
• pp.73-86
• /
• 1990

This study aims to give a syntactic and semantic analysis of the phe- nomenon of Quantifier Floating in the framework of Generalixed Cate- gorial Grammar. Floated quantifiers like neys-i as in Hakayngtul-i neys-i swul-ul masyessta are syntactically analyxed as VP modifiers(VP/VP), and semantically as involving nominalixed properties. Related forms like neys(NP/NP) and neys-ul(TV-TV) are also given rigorous syntactic and semantic analysis. A successful anaysis sheds light on the possiblity of using Categorial Grammar, which is subject to adjacency principle, for the (computer) processing od Korean.

• Language and Information
• /
• v.7 no.1
• /
• pp.1-22
• /
• 2003

Quantifier floating is one of the much studied phenomena in natural languages where quantifying expressions may appear in places other than their original prenominal one. Its presence is especially prominent in languages such as Korean that allow more or less free word order. We find that, in addition to what is described in the literature, there are other remarkable regularities in the way the language allows quantifiers to “float” with respect to various constructions including coordination, relative clauses, and embedded clauses. These regularities are captured syntactically in a combinatory categorial grammar (CCG) framework for Korean. We also show how to derive semantic representations for Korean quantifier floating in the same CCG framework.

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

Among the languages that allow long-distance reflexives, some languages have blocking effects, whereas others don't. The goal of this paper is to provide computational algorithms that can handle presence and absence of blocking effects of long-distance reflexives. We will examine the blocking effects in Chinese and Korea and develop computational algorithms for handling blocking effects in those two languages. The algorithms will be developed by incorporating Chierchia's Binding Theory into Steedman's Combinatory Categorial Grammar (CCG). Through the analyses and implementations, this paper illustrates how blocking effects can be implemented computationally.

• Language and Information
• /
• v.8 no.1
• /
• pp.53-76
• /
• 2004

Negative polarity items(NPIs), which function as quantifiers are licensed in a syntactically strict way by negatives, which function as qualifiers, resulting in universal negating interpretations as pairs. We present a proposal to explain the related phenomena, in which the syntax and the semantics are closely related to each other, with Combinatory Categorial Grammar. For this purpose, we first adopt the usual approach to scrambling, but control its overgeneration with the use of markers, taking into account the complex syntactic phenomena involving NPIs and scrambling in Korean. We also propose to utilize polarity intensity as a novel feature, in order to account for the universal negating interpretations when NPIs are combined with negatives. Our proposal also explains the difference in readings when other quantifiers or qualifiers intervene the NPI and the related negatives.

• Annual Conference on Human and Language Technology
• /
• 2010.10a
• /
• pp.118-122
• /
• 2010

격현상은 한국어의 여러 가지 문법현상들을 분석하고 이를 전산학적으로 구현하는데 아주 중요한 부분 중의 하나이다. 결합범주문법(Combinatory Categorial Grammar; CCG)을 이용한 대부분의 기존 연구들에서는 격조사나 보조사들에도 별도의 통사범주들을 할당한 후, 이들 조사들이 명사와 결합하여 하나의 명사구를 구성하는 것으로 조사들을 처리하고 있다. 그러나 이러한 방법들은 이론적인 문제점들뿐만 아니라 전산적 구현에 있어서도 문제점을 안고 있다. 본 논문에서는 이러한 문제점들을 해결하면서도 한국어의 격현상을 효과적으로 구현할 수 있는 방법을 소개한다. 본 논문에서 사용하려고 하는 문법공학 시스템은 한국어를 위한 유형상속 결합범주문법(Type-inherited Combinatory Categorial Grammar; TCCG)이다. 이 시스템 안에서는 명사구의 격조사나 보조사들이 별도의 통사범주들을 할당받지 않고, 명사의 굴절규칙(inflectional rules)에 의하여 명사와 결합하게 된다. 따라서 국어의 기본적인 격조사들을 효율적으로 구현할 수 있을 뿐만 아니라 보조사나 격조사 탈락현상들도 효과적으로 분석하고 구현할 수 있게 된다.