Abstract
Sanskrit is very rich in compound formation. Typically a compound does not code the relation between its components explicitly. To understand the meaning of a compound, it is necessary to identify its components, discover the relations between them and finally generate a paraphrase of the compound. In this paper, we discuss the automatic segmentation and type identification of a compound using simple statistics that results from the manually annotated data.
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
Bharati, A., Kulkarni, A.P., Sheeba, V.: Building a wide coverage Sanskrit Morphological Analyser: A practical approach. In: The First National Symposium on Modelling and Shallow Parsing of Indian Languages, IIT-Bombay (2006)
Bhat, G.M.: Samāsaḥ. Samskrita Bharati, Bangalore, Karnataka (2006)
Fortes, F.C.L., Roxas, R.E.O.: Optimality Theory in Morphological Analysis. In: National Natural Language Processing Research Symposium (January 2004)
Fosler, J.E.: On Reversing the Generation Process in Optimality Theory. In: Proceedings of the Association for Computational Linguistics (1996)
Gillon, B.S.: Exocentric Compounds in Classical Sanskrit. In: Proceeding of the First International Symposium on Sanskrit Computational Linguistics (SCLS 2007), Paris, France (2007)
Gillon, B.S.: Tagging Classical Sanskrit Compounds. In: Kulkarni, A., Huet, G. (eds.) Sanskrit Computational Linguistics. LNCS (LNAI), vol. 5406, pp. 98–105. Springer, Heidelberg (2009)
Hellwig, O.: Sanskrit Tagger: A Stochastic Lexical and POS Tagger for Sanskrit. In: Huet, G., Kulkarni, A., Scharf, P. (eds.) Sanskrit Computational Linguistics 2007/2008. LNCS (LNAI), vol. 5402, pp. 266–277. Springer, Heidelberg (2009)
Hellwig, O.: Extracting Dependency Trees from Sanskrit Texts. In: Kulkarni, A., Huet, G. (eds.) Sanskrit Computational Linguistics. LNCS (LNAI), vol. 5406, pp. 106–115. Springer, Heidelberg (2009)
Hoeks, J.C.J., Hendriks, P.: Optimality Theory and Human Sentence Processing: The Case of Coordination. In: Proceedings of the 27th Annual Meeting of the Cognitive Science Society, Erlbaum, Mahwah, NJ, pp. 959–964 (2005)
Huet, G.: Shallow syntax analysis in Sanskrit guided by semantic nets constraints. In: Proceedings of International Workshop on Research Issues in Digital Libraries, Kolkata (2006)
Huet, G.: Lexicon-directed Segmentation and Tagging of Sanskrit. In: XIIth World Sanskrit Conference, Helsinki, Finland (August 2003); Tikkanen, B., Hettrich, H. (eds.) Themes and Tasks in Old and Middle Indo-Aryan Linguistics, Motilal Banarsidass, Delhi, pp. 307–325 (2006)
Huet, G.: Formal structure of Sanskrit text: Requirements analysis for a Mechanical Sanskrit Processor. In: Huet, G., Kulkarni, A., Scharf, P. (eds.) Sanskrit Computational Linguistics 2007/2008. LNCS (LNAI), vol. 5402, pp. 162–199. Springer, Heidelberg (2009)
Huet, G.: Sanskrit Segmentation. In: South Asian Languages Analysis Roundtable XXVIII, Denton, Ohio (October 2009)
Jha, G.N., Mishra, S.K.: Semantic Processing in Pāṇini’s Kāraka System. In: Huet, G., Kulkarni, A., Scharf, P. (eds.) Sanskrit Computational Linguistics 2007/2008. LNCS (LNAI), vol. 5402, pp. 239–252. Springer, Heidelberg (2009)
Kulkarni, A.P., Shukla, D.: Sanskrit Morphological Analyser: Some Issues. To appear in Bh.K Festschrift volume by LSI (2009)
Kulkarni, A.P., Kumar, A., Sheeba, V.: Sanskrit compound paraphrase generator. In: Proceedings of ICON 2009: 7th International Conference on Natural Language Processing. Macmillan Publishers, India (2009)
Mahavira: Pādnini as Grammarian (With special reference to compound formation). Bharatiya Vidya Prakashan, Delhi (June 1978)
Mittal, V.: Automatic Sanskrit Segmentizer using Finite State Transducers. In: Proceeding of Association for Computational Linguistics - Student Research Workshop (2010)
Murty, M.S.: Sanskrit Compounds-A Philosophical Study. Chowkhamba Sanskrit Series Office, Varanasi, India (1974)
Ishvarachandra, P.: Aṣtādhyāyī. Chaukhamba Sanskrit Pratisthan, Delhi (2004)
Prince, A., Smolensky, P.: Optimality Theory: Constraint Interaction in Generative Grammar. In: RuCCS Technical Report 2 at Center for Cognitive Science, Rutgers University, Piscataway (1993)
Sarma, E.R.S.: Maṇikaṇa: A Navya-Nyāya Manual. The Adyar Library and research Centre, Madras (1960)
Scharf, P.M.: Levels in Pāṇini’s Aṣtādhyāyī. In: Kulkarni, A., Huet, G. (eds.) Sanskrit Computational Linguistics. LNCS (LNAI), vol. 5406, pp. 66–77. Springer, Heidelberg (2009)
Yuret, D., Biçici, E.: Modeling Morphologically Rich Languages Using Split Words and Unstructured Dependencies. In: ACL-IJCNLP, Singapore (2009)
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
Kumar, A., Mittal, V., Kulkarni, A. (2010). Sanskrit Compound Processor. 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_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-17528-2_5
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)