• 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.

• 한국영어학회지:영어학
• /
• 제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.