Computational theory of short distance reflexive anaphoric devices in Urdu discourse for effective machine translation

Authors:
Mohammad Naveed Ali;Mohammad Aamir Khan;Mohammad Abid Khan
Affiliations:
Edwardes College Peshawar, NWFP, Pakistan;University of Peshawar, NWFP, Pakistan;University of Peshawar, NWFP, Pakistan
Venue:
Proceedings of the 7th International Conference on Frontiers of Information Technology
Year:
2009

Citing 4
Cited 0

An algorithm for pronominal anaphora resolution

Computational Linguistics
Applying machine learning to anaphora resolution

Connectionist, Statistical, and Symbolic Approaches to Learning for Natural Language Processing
Robust pronoun resolution with limited knowledge

COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 2
A centering approach to pronouns

ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Computational treatment of natural languages is a very challenging task. For effective machine translation of multi-sentential discourse units from a source language into some target language, resolution of anaphoric expressions is of crucial importance. This paper presents the computational treatment of the rarely studied form of pronominal reference called reflexives. A knowledge-poor, rule-based algorithm has been developed to identify and resolve the reflexives in Urdu discourses. The proposed algorithm resolves the reflexives in Urdu discourses with more than 85% accuracy.