• 한국영어학회지:영어학
• /
• 제4권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.

• 한국언어정보학회:학술대회논문집
• /
• 한국언어정보학회 2002년도 Language, Information, and Computation Proceedings of The 16th Pacific Asia Conference
• /
• 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.

• 한국영어학회지:영어학
• /
• 제1권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.