Chennai-600 044
Anaphora play a major role in understanding a language, and resolving it is very important in many of the applications such as question answering and machine translation. One of the major entities that maintain cohesion in a text is by anaphora. In computational linguistics anaphora is defined as any entity that requires an antecedent at the back, whereas in linguistics only the Pronouns and reflexives are considered as anaphors. Here we take up anaphors from the computational point of view. Resolving such references have been considered a research area both in formal and computational linguistics. Theoretical aspects of referential entity have been worked out extensively in both European and South Asian languages, including Indian Languages. European languages have also seen substantial advancements on the Computational aspects of this problem. However, very little work has been done in South Asian languages, including Indian Languages, on the Computational aspects of the problem of Anaphora Resolution, despite there being a fair amount of work getting done in some of other computational areas such as Part of Speech tagging, NP chunking etc.
This tutorial we will give the over all state of the art of Anaphora Resolution as well as how corpus should be annotated for Anaphor and Antecedent. The different methods used for anaphora resolution will be given very high importance. We will be discussing about the available tools in this area.
4th Nov 2010
Complete list of accepted papers released.
2nd Nov 2010
The technical schedule has been released.
ICON-2010 Secretariat
Language Technologies Research Centre
International Institute of Information Technology
Gachibowli
Hyderabad - 500032, India
Tel: +91-40.66531144
Fax: +91-40.66531413
icon2010@iiit.ac.in