Abstract
This paper presents an algorithm, which identifies different types of pronominal and its antecedents in Sanskrit, an Indo-European language. The computational grammar implemented here uses very familiar concepts such as clause, subject, object etc., which are identified with the help of morphological information and concepts such as precede and follow. It is well known that natural languages contain anaphoric expressions, gaps and elliptical constructions of various kinds and that understanding of natural languages involves assignment of interpretations to these elements. Therefore, it is only to be expected that natural language understanding systems must have the necessary mechanism to resolve the same. The method we adopt here for resolving the anaphors is by exploiting the morphological richness of the language. The system is giving encouraging results when tested with a small corpus.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Byron, D., James, A.: Applying Genetic Algorithms to Pronoun Resolution. In: Proceedings of the Sixteenth National Conference on Artificial Intelligence AAAI (1999)
Carbonell, J., Brown, R.: Anaphora Resolution: A Multistrategy Approach. In: Proceedings of the 12th International Conference on Computational Linguistics, pp. 96–101 (1988)
Hobbs, J.: Resolving pronoun references. Lingua 44, 311–338 (1978)
Hock, H.H.: Studies in Sanskrit Syntax. Motilal Banarasidas, Delhi (1991)
Jha, G.N., Sobha, L., Mishra, D., Singh, S.K., Pralayankar, P.: Anaphors in Sanskrit. In: Proceedings of the Second Workshop on Anaphora Resoplution (WAR-II). Nealt Proceedings Series, vol. 2, pp. 11–25 (2008)
Jha, G.N., Sobha, L., Mishra, D.: Discourse Anaphor and Resolution Techniques in Sanskrit. In: Proceedings of the 7th Discourse Anaphora and Anaphora Resolution Colloquium, Goa, pp. 135–150 (2009)
Kennedy, C., Boguraev, B.: Anaphora for Everyone: Pronominal Anaphora Resolution without a Parser. In: Proceedings of the 16th International Conference on Computational Linguistics (COLING 1996), Denmark, pp. 113–118 (1996)
Lappin, S., Mccord, M.: Anaphora Resolution in Slot grammar. Computational Linguistics 16(4), 197–210 (1990)
Lappin, S., Leass, H.: An Algorithm for Pronominal Anaphora Resolution. Computational Linguistics 20(4), 535–561 (1994)
Mitkov, R.: Factors in Anaphora Resolution: They are not the only Things That Matter. A Case Study Based on Two Different Approaches. In: Proceedings of the ACL 1997/EACL 1997 Workshop on Operational Factors in Practical, Robust Anaphora Resolution, Spain, pp. 14–21 (1997)
Sobha, L., Patnaik, B.N.: An Algorithm for Pronoun and Reflexive Resolution in Malayalam. In: International Conference on Computational Linguistics, Speech and Document processing, pp. 63–66 (1998)
Sobha, L., Patnaik, B.N.: A Quantitative and a Non-Quantitative Approach to Resolve Reflexives and Pronouns in Malayalam. IJDL 27(1), 33–40 (1999)
Sobha, L.: An Anaphora Resolution System for Malayalam and Hindi (An unpublished doctoral thesis) Mahatma Gandhi University, Kottayam (1999)
Sobha, L., Pralayankar, P.: Anaphors in Sanskrit. In: International Conference on Referential Entity Resolution. AU-KBC, Chennai (2007)
Speyer, J.S.: Sanskrit Synta. E.J. Brill, Leyden (1886)
Viswanathan, S., Ramesh Kumar, S., Kumara Shanmugam, B., Arulmozi, S.: A Tamil Morphological analyser. In: Proceedings of International Conference on Natural Language Processing, pp. 31–39 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pralayankar, P., Devi, S.L. (2010). Anaphora Resolution Algorithm for Sanskrit. In: Jha, G.N. (eds) Sanskrit Computational Linguistics. ISCLS 2010. Lecture Notes in Computer Science(), vol 6465. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17528-2_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-17528-2_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17527-5
Online ISBN: 978-3-642-17528-2
eBook Packages: Computer ScienceComputer Science (R0)