• 전자공학회논문지B
• /
• 제33B권4호
• /
• pp.183-190
• /
• 1996

The purpose of this paper is to show that the solutions of the problem for the anaphor ocured in korean senstence, by means of one-direction activated chart parsing leaded by a head. This is the phenomenon frequently occured in the conversation of natural language and the part necessarily required in the construction of natural language processing system for the practical use. To solve the problem of anaphor in the korean language, we have computerized definition and the management conditions necessary in the semantic classification between the anaphor and its antecedent and index are added in the feature structure in lexicon. To deal with anaphor in parser and algorithm is proposed to solve the problem for anaphor. The range of management of pareser is extended to solve the problem for anaphor of the indeclinable parts of speech in korean occured in all the sentences the parser HPSG developed previously manages.

• 한국언어정보학회지:언어와정보
• /
• 제15권1호
• /
• pp.63-78
• /
• 2011

This study investigates the binding behavior of the Korean anaphor 'caki', which has been regarded thus far as a long-distance anaphor (LDA). Given that even local anaphors can be bound long-distance when they function as exempt anaphors in certain languages (Pollard and Sag 1992; Kim and Yoon 2009a, b), I investigated the binding behavior of LD-bound 'caki', in order to determine whether LD-bound 'caki' differs from LD-bound 'caki-casin' in the same contexts. In the experiment, subjects were required to rate the grammaticality of Korean sentences representing various types of LD binding of 'caki' and to determine whether the sloppy or the strict reading was more prominent in elliptical VPs containing the anaphor. The results are discussed with respect to the typology of LDAs proposed by Cole, Hermon and Huang (2001).

• 한국언어정보학회지:언어와정보
• /
• 제3권2호
• /
• pp.51-66
• /
• 1999

This paper argues that the de se reading is a composite of the corresponding de re one plus the presupposition that there exists a strong epistemic relation between the object of attitude, linguistically realized as an anaphor, and the attitude-bearer, the referent of the anaphor's antecedent. Close examination of the relation between the attitudes de se and anaphora reveals that the notion de se, as currently understood, should be generalized to explain the choice of anaphors. A taxonomy of anaphors in terms of a general notion like presupposition provides further empirical support for the approach taken here.

• 한국언어정보학회:학술대회논문집
• /
• 한국언어정보학회 1996년도 Language, Information and Computation = Selected Papers from the 11th Pacific Asia Conference on Language, Information and Computation, Seoul
• /
• pp.307-316
• /
• 1996

• 한국영어학회지:영어학
• /
• 제1권4호
• /
• pp.629-649
• /
• 2001

This paper aims to provide an account for the English anaphors under the framework of the recent development of minimalism (Chomsky 1999, 2001). I propose that the anaphor has the uninterpretable [a] feature. The Agree operation erases the [a] feature by feature match. Once the [a] is deleted, the derivation converges, providing a proper interpretation of the anaphor. When there is no matching phi-features, the [a] cannot be eliminated, inducing the derivation to crash. The Agree operation can account for not only the typical local binding cases in English but the apparent long-distance binding cases in the picture-DP and expletive constructions. Consequently, the traditional concept of the binding domain and dichotomy between local and long-distance types are abandoned in favor of the analysis under the framework of minimalism. The minimalist accounts thus maximally simplifies the binding principles, using the general operation Agree only.

• 한국언어정보학회:학술대회논문집
• /
• 한국언어정보학회 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.

• 인지과학
• /
• 제1권1호
• /
• pp.145-164
• /
• 1989

본 논문은 언어습득 초기단계의 아동이 모국어의 주요분기방향(principal branching direction)에따라 종응사규칙을 습득한다는 최근의 연구결과에 의거한다(Lust,1986).이 연구에 의하면,가령 한국어는 좌행 분기어임을 한국아동은 죄행생략형을 선호할 것이라고 한다.이가설을 시험하기 위해 서울에 거주하는 4:1-9:7의 96명의 아동을 모방유도실험으로 개별연구하였다.문장유형으로는 중복형,우행생략형 및 좌행생략형 등이 이용되었다.실험결과,Lust의 예측과는 달리 좌행분기어인 한국어 습득아동도 우행분기어인 영어습득아동처럼 우행 생략형을 좌행생략형보다 용이하게 일찍 습득하고 있음을 발견하였다.이것은 인간에게 분기방향과 같은 문법적 요소에 상관없이 선행사가 공조응사보다 앞서 언급되는 형태(우행생략형) 를 선호하는 인지적기재가 있음을 시사한다고 사려된다.

• 지능정보연구
• /
• 제21권2호
• /
• pp.131-150
• /
• 2015

영어와 달리 한국어나 일본어 문장의 경우 용언의 필수격을 채우는 명사구가 생략되는 무형대용어 현상이 빈번하다. 특히 백과사전이나 위키피디아의 문서에서 표제어로 채울 수 있는 격의 경우 그 격이 문장에서 더 쉽게 생략된다. 정보검색, 질의응답 시스템 등 주요 지능형 응용시스템들은 백과사전류의 문서에서 주요한 정보를 추출하여 수집하여야 한다. 그러나 이러한 명사구 생략 현상으로 인해 양질의 정보추출이 어렵다. 본 논문에서는 백과사전 종류 문서에서 생략된 명사구 즉 무형대용어를 복원하는 시스템의 개발을 다루었다. 우리 시스템이 다루는 문제는 자연어처리의 무형대용어 해결 문제와 거의 유사하나, 우리 문제의 경우 문서의 일부가 아닌 표제어도 복원에 이용할 수 있다는 점이 다르다. 무형대용어 복원을 위해서는 먼저 무형대용어의 탐지 즉 문서 내에서 명사구 생략이 일어난 곳을 찾는 작업을 수행한다. 그 다음 무형대용어의 선행어 탐색 즉 무형대용어의 복원에 사용될 명사구를 문서 내에서 찾는 작업을 수행한다. 문서 내에서 선행어를 발견하지 못하면 표제어를 이용한 복원을 시도해 본다. 우리 방법의 특징은 복원에 사용된 문장성분을 찾기 위해 Structural SVM을 사용하는 것이다. 문서 내에서 생략이 일어난 위치보다 앞에 나온 명사구들에 대해 Structural SVM에 의한 시퀀스 레이블링(sequence labeling) 작업을 시행하여 복원에 이용 가능한 명사구인 선행어를 찾아내어 이를 이용하여 복원 작업을 수행한다. 우리 시스템의 성능은 F1 = 68.58로 측정되었으며 이는 의미정보의 이용 없이 달성한 점을 감안하면 높은 수준으로 평가된다.

• 한국언어정보학회지:언어와정보
• /
• 제9권2호
• /
• pp.127-139
• /
• 2005

In this paper I investigate whether Korean-speaking children know the basic meaning of reciprocal anaphors like each other. I further examine whether they have knowledge of subtle differences in the interpretations of such anaphors depending on the two types of verbs. Fiengo and Lasnik (1973) pointed out a contrast between reciprocal sentences with active verbs and stative verbs. For example, a sentence with an active verb like The men in the room are hitting each other, has both a strong reciprocal reading (i.e., everyone of them in the room is hitting every other one) and a weak reciprocal reading (i.e., certain pairs of men are not engaged in the action of hitting each other). In contrast, a sentence with a stative verb like The men in the room know each other allows only a strong reciprocal reading (i.e., everyone of them know every other one). 16 Korean children and 15 Korean adults were tested using the Truth Value Judgment Task methodology. The results of the present study show that like English children, Korean children know the meaning of reciprocal anaphor, and that they also know the semantic difference of reciprocal sentences with active and stative verbs. Therefore, the present study strongly supports the claim that the semantic distinction of reciprocal sentences with active and stative verbs may be universal, and that children's ability of this semantic distinction might be innately given.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권4호
• /
• pp.1409-1425
• /
• 2021

In wide-ranging information society, fast and easy access to information in language of one's choice is indispensable, which may be provided by using various multilingual Natural Language Processing (NLP) applications. Natural language text contains references among different language elements, called anaphoric links. Resolving anaphoric links is a key problem in NLP. Anaphora resolution is an essential part of NLP applications. Anaphoric links need to be properly interpreted for clear understanding of natural languages. For this purpose, a mechanism is desirable for the identification and resolution of these naturally occurring anaphoric links. In this paper, a framework based on Hobbs syntactic approach and a system developed by Lappin & Leass is proposed for resolution of reflexive anaphoric links, present in Urdu text documents. Generally, anaphora resolution process takes three main steps: identification of the anaphor, location of the candidate antecedent(s) and selection of the appropriate antecedent. The proposed framework is based on exploring the syntactic structure of reflexive anaphors to find out various features for constructing heuristic rules to develop an algorithm for resolving these anaphoric references. System takes Urdu text containing reflexive anaphors as input, and outputs Urdu text with resolved reflexive anaphoric links. Despite having scarcity of Urdu resources, our results are encouraging. The proposed framework can be utilized in multilingual NLP (m-NLP) applications.