• 한국영어학회지:영어학
• /
• 제3권1호
• /
• pp.89-108
• /
• 2003

As pronouns are resolved with their antecedents, definite NPs may enter into the anaphora-antecedent relations with indefinite NPs. This paper is to provide faster and more efficient computational algorithms by which definite NPs are resolved effectively, For this purpose, this paper extends Chierchia's Binding Theory in Categorial Grammar, and definite NPs are resolved with their antecedents by similar algorithms that are used to reflexive resolution. In these algorithms, the relations between indefinite NP and definite NP are represented with λ-expressions, and definite NPs are resolved with their antecedent by λ-conversions.

• 한국언어정보학회:학술대회논문집
• /
• 한국언어정보학회 2002년도 Language, Information, and Computation Proceedings of The 16th Pacific Asia Conference
• /
• pp.281-289
• /
• 2002

This paper aims to account for the backward anaphora that seem to be against the c-command requirements in the anaphor-antecedent relations. It was claimed that the binding conditions should apply at LF fur the backward binding cases involving phych-verbs and causatives. Under the recent development of minimalism where the concept of levels disappears to adopt a cyclic derivation, the data that show the backward binding phenomena have not been discussed in the area of the binding theory. In this paper, I argue that the backward binding cases can be incorporated into the core binding phenomena with the general assumptions on the thematic prominence. It is discussed how the dependency between NPs involving backward anaphora is determined by the thematic prominency. The Agree operation takes place between the probe T and the goal with the uninterpretable u[a] and [prominent] feature, by which an anaphor is valued, producing a proper interpretation.