• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.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.

• Language and Information
• /
• v.15 no.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).

• Language and Information
• /
• v.3 no.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.

• Proceedings of the Korean Society for Language and Information Conference
• /
• 1996.02a
• /
• pp.307-316
• /
• 1996

• Korean Journal of English Language and Linguistics
• /
• v.1 no.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.

• Proceedings of the Korean Society for Language and Information Conference
• /
• 2002.02a
• /
• 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.

• Korean Journal of Cognitive Science
• /
• v.1 no.1
• /
• pp.145-164
• /
• 1989

The present paper studies the development of null anaphor,with special attention to whether Korean children's use of null anaphora exhibits the type of directionality preforence predicted by Lust & Mangione(1983)and Lust(1986).If these researchers are correct,anaphora in Korean children's language should be constrained backward since Korean is a left-branching language.That is,it is predicted that Korean chidren would perfer backward anaphora to the forward pattern.For the purpose of this study, ninety-six children were individually tested in an elicited imitation task, twenty-four children from four age groups(4:1-9:7).Three types of constructions,sentences involving a redundant NP,forward patterns of ananphora,and backsward patterns of anaphora were devised.It was discovered that like English speaking children, Korean children prefer forward patterns of anaphora to backward structures.It was thus speculated that the forward preference may well be indedpendent of grammatical factors,reflecting instead processing considerations which favour mention of the referent befor the use of anaphoric elements.

• Journal of Intelligence and Information Systems
• /
• v.21 no.2
• /
• pp.131-150
• /
• 2015

Omission of noun phrases for obligatory cases is a common phenomenon in sentences of Korean and Japanese, which is not observed in English. When an argument of a predicate can be filled with a noun phrase co-referential with the title, the argument is more easily omitted in Encyclopedia texts. The omitted noun phrase is called a zero anaphor or zero pronoun. Encyclopedias like Wikipedia are major source for information extraction by intelligent application systems such as information retrieval and question answering systems. However, omission of noun phrases makes the quality of information extraction poor. This paper deals with the problem of developing a system that can restore omitted noun phrases in encyclopedia documents. The problem that our system deals with is almost similar to zero anaphora resolution which is one of the important problems in natural language processing. A noun phrase existing in the text that can be used for restoration is called an antecedent. An antecedent must be co-referential with the zero anaphor. While the candidates for the antecedent are only noun phrases in the same text in case of zero anaphora resolution, the title is also a candidate in our problem. In our system, the first stage is in charge of detecting the zero anaphor. In the second stage, antecedent search is carried out by considering the candidates. If antecedent search fails, an attempt made, in the third stage, to use the title as the antecedent. The main characteristic of our system is to make use of a structural SVM for finding the antecedent. The noun phrases in the text that appear before the position of zero anaphor comprise the search space. The main technique used in the methods proposed in previous research works is to perform binary classification for all the noun phrases in the search space. The noun phrase classified to be an antecedent with highest confidence is selected as the antecedent. However, we propose in this paper that antecedent search is viewed as the problem of assigning the antecedent indicator labels to a sequence of noun phrases. In other words, sequence labeling is employed in antecedent search in the text. We are the first to suggest this idea. To perform sequence labeling, we suggest to use a structural SVM which receives a sequence of noun phrases as input and returns the sequence of labels as output. An output label takes one of two values: one indicating that the corresponding noun phrase is the antecedent and the other indicating that it is not. The structural SVM we used is based on the modified Pegasos algorithm which exploits a subgradient descent methodology used for optimization problems. To train and test our system we selected a set of Wikipedia texts and constructed the annotated corpus in which gold-standard answers are provided such as zero anaphors and their possible antecedents. Training examples are prepared using the annotated corpus and used to train the SVMs and test the system. For zero anaphor detection, sentences are parsed by a syntactic analyzer and subject or object cases omitted are identified. Thus performance of our system is dependent on that of the syntactic analyzer, which is a limitation of our system. When an antecedent is not found in the text, our system tries to use the title to restore the zero anaphor. This is based on binary classification using the regular SVM. The experiment showed that our system's performance is F1 = 68.58%. This means that state-of-the-art system can be developed with our technique. It is expected that future work that enables the system to utilize semantic information can lead to a significant performance improvement.

• Language and Information
• /
• v.9 no.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)
• /
• v.15 no.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.