Computational Linguistics: A Research Survey on Ambiguity and Anaphora Resolution

In this paper we briefly discuss main areas of computational linguistics particularly focus on the problem of ambiguity in computational linguistics. Then we take up the issue of ambiguity with inclusion of term anaphora which is well known in most of the languages and it is seen under pronouns specifically reflexives and reciprocals. In general, we have total five sections in this paper. First section primarily deals with introduction related to the topic and elaborates it in detail. Second section defines ambiguity with its background investigations in relation with computational linguistics. Third section presents detailed study on anaphoric ambiguity with strict sloppy readings at syntax level. Fourth section discusses about anaphora and soon it adds anaphora resolution irrespective of any specific language and most of the work related to anaphora resolution is mentioned from natural language processing point of view. Fifth is the last section where we conclude that ambiguity and anaphora both are difficult tasks for machine translation until unless we don’t train machine (computer) to learn as per given instructions and all.