A Computational Approach to Questions: Examples from Korean

A Computational Approach to Questions: Examples from Korean

This paper provides computational algorithms for Korean 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 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, the semantic interpretations of questions will be calculated compositionally based on the functor-arguments relations of the constituents. This paper also discusses how the indefinite pronoun nwukwu and the wh-pronoun nwukwu can be distinguished in semantic interpretations. In sum, this paper provides analyses of questions in Categorial Grammar, by which we can computationally implement questions in Korean.