Implementation of Long-distance Reflexives in Korean : A Categorial Grammar Approach

Implementation of Long-distance Reflexives in Korean A Categorial Grammar Approach Yong-hun Lee Dept. of Linguistics, UIUC 707 S. Mathews Ave. Rm. 4088 Urban, IL 61801, USA ylee@uiuc.edu Abstract 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 of a long-distance reflexive caki with a more unified way. 1� Introduction Anaphora has been one of the hottest topics in Linguistics. Various theories have been developed under the name of Binding. There have been roughly two types of Binding Theories. The first group uses tree-theoretic notions to search an antecedent for the anaphora. Chomskyan traditions, especially GB framework, belong to this type of approach. The other utilizes argument-functor relations, instead of structural configurations, for anaphora resolution. This strategy is taken by GPSG (Generalized Phrase Structural Grammar), PLG (Phrase Linking Grammar), and CG (Categorial Grammar). Chierchia (1988)'s theory in Categorial Grammar is a good example. There have been lots of observations that the distributions of reflexives are different from those of pronominals. That is, reflexives have some more restrictions that pronominals do not obey. In order to implement this intuition, many theories adopted two kinds of different mechanisms, one for reflexives and the other for pronominals. The conditions by which reflexives are licensed are different from those for pronominals. Korean reflexives have characteristics that English counterparts do not exhibit. In Korean, long-distance reflexives are possible in addition to ordinary sentence-bound ones. The distributions of caki in (1), (2), and (3) illuminate this fact"2. (1) Chelsoo 1-ka� caki1-lul� �Chelsoo.NOM self.ACC�salangha-n-ta. love.PRES.DECL Thelsoo loves himself.' 1 Korean has another kind of reflexive that permits only sentence-bound reading. Cakicasin in (i) is an example. (i) Chelsoo1-nun� �Chelsoo.TOP�[ Y ounghee2-ka cakicasin. 112-ul salangha-n-ta-ko�sayngkakha-n-ta. Younghee.NOMself.ACC� love.PRES.DECL.COMP think.PRES.DECL a. *Chelsoo thinks that Younghee loves him. b. Chelsoo thinks that Younghee loves herself. In (i), cakicasin can refer to only Y ounghee, not Chelsoo. This paper does not deal with this sentence-bound reflexive cakicasin. Instead, it focuses on two readings of a long-distance reflexive caki. But we can provide resolution algorithms for cakicasin by slight modifying those for caki. For the different distributions and resolution algorithm for cakicasin, see Lee (2001b). 2 According to Moon (1996) and others, long-distance reading (3a) is superior to sentence-bound interpretation in (3b) for the sentence. 296 (2) Chelsoornun [cakii-ka� ttokttokha-ta-ko ]� sayngkakha-n-ta. Chelsoo.TOP self.NOM� be smart.DECL.COMP think.PRES.DECL Thelsoo thinks that he is smart.' (3) Chelsoornun [ Y ounghee2-ka� Chelsoo.TOP Younghee.NOM�salangha-n-ta-ko] self.ACC love.PRES.DECL.COMP sayngkakha-n-ta. think.PRES.DECL a. Chelsoo thinks that Younghee loves him. b. Chelsoo thinks that Younghee loves herself. In (1), caki is sentence-bound, i.e., the antecedent of caki is within the sentence boundary. In (2), Chelsoo, an antecedent, is outside …

Content truncated to 500 words