Abstract
The paper describes Sanskrit Analysis System (SAS) – a complete analysis system for Sanskrit. Some modules of this system have already been developed. The system accepts full text inputs in Devanāgarī Unicode (UTF-8). The sandhi module does the segmenting for complex tokens and then hands over the text for detailed processing. Currently, the SAS modules have independent interfaces for unit testing at http://sanskrit.jnu.ac.in. The authors are working on the integration process of these modules. The SAS has two major components - the shallow parser and the k(raka analyzer. The shallow parser has separate modules, some of them are partially implemented, and some of them are in the process of being implemented. The modules have been developed as java servlet in unicode using RDMBS techniques. The applications of the SAS will be many ranging from being a Sanskrit reading assistant to machine translation system from Sanskrit to other languages.
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
Vamdeva, A.: ‘Liṅga-Parijnānam’, Shabdatattva Prakāshan Varanasi (1990)
Muktanada, A.: Computational Identification and Analysis of Sanskrit Verb Forms of bhvādigaöa. Mphil degree at SCSS, JNU (submitted, 2007)
Manji, B.: Computational analysis of Gender in Sanskrit Noun Phrases for Machine Translation. Mphil degree at SCSS, JNU (submitted, 2007)
Bharati, A., Chaitanya, V., Sangal, R.: A Computational Gram-mar for Indian Languages Processing. Indian Linguistics Journal 52, 91–103 (1991)
Bharati, A., Chaitanya, V., Sangal, R.: Natural Language Processing: A Pan Perspective. Prentice-Hall of India, New Delhi (1995)
George, C.: Pāṇini’s syntactic categories. Journal of Oriental Institute Baroda 16, 201–215 (1967)
George, C.: Pāṇini His Work and Tradition (MLBD 1988), Delhi, vol. I (1988)
George, C.: Some Questions on Pāöini’s Derivational System. In: Procs. of Splash, iSTRANS, p. 3. Tata Macgraw-Hill, New Delhi (2004)
Chandrasekhar, R.: Part of Speech Tagging for Sanskrit. Phd degree at SCSS, JNU (submitted, 2007)
Daniel, J., Martin, J.: Speech and Language Processing. Prentice-Hall of India, New Delhi (2000)
Edgren, A.H.: On the verbal roots of the Sanskrit language and of the Sanskrit grammarians. Journal of American Oriental Society 11, 1–5 (1885)
Huet, G.: Towards Computational Processing of Sanskrit, Recent Advances in Natural Language Processing. In: Proceedings of the International Conference ICON, Mysore, India (2003)
Jha, Girish N., et al.: Towards a Computational analysis system for Sanskrit. In: Proc. of first National symposium on Modeling and Shallow parsing of Indian Languages at Indian Institute of Technology, Bombay, pp. 25–34 (2006)
Jha, Girish N.: A Prolog Analyzer/Generator for Sanskrit Noun phrase Padas, Language in India, vol. 3 (2003)
Jha, Girish N.: Generating nominal inflectional morphology in Sanskrit. In: SIMPLE 2004, IIT-Kharagpur Lecture Compendium, pp. 20–23. Shyama Printing Works, Kharagpur (2004)
Jha, Girish N.: Morphology of Sanskrit Case Affixes: A computational analysis, M.Phil dissertation, J.N.U., New Delhi (submitted, 1993)
Jha, Girish N.: The system of Panini. Language in India 4, 2 (2004)
Jha, Girish N., Mishra, Sudhir K.: Semantic processing in Pāṇini’s karaka system. In: Second International Sanskrit Computational Linguistics Symposium at Brown University (2008)
Joshi, S.D.: Verbs and nouns in Sanskrit. Indian linguistics 32, 60–63 (1962)
Kale, M.R.: A Higher Sanskrit Grammar. MLBD, New Delhi (1995)
Kapoor, K.: Semantic Structures and the Verb: a propositional analysis. Intellectual Publications, New Delhi (1985)
Sachin, K.: Sandhi Splitter and Analyzer for Sanskrit (with reference to ac Sandhi). Mphil degree at SCSS, JNU (submitted, 2007)
Mishra, Sudhir K., Jha, Girish N.: Identifying Verb Inflections in Sanskrit morphology. In: Proc. of SIMPLE 2004, IIT Kharagpur, pp. 79–81 (2004)
Mishra, Sudhir K., Jha, Girish N.: Sanskrit Karaka Analyzer for Machine Translation. In: SPLASH proc. of iSTRANS, pp. 224–225. Tata McGraw-Hill, New Delhi (2004)
Ruslan, M.: The Oxford Handbook of Computational Linguistics. Oxford University Press, Oxford
Mishra, N. (ed.): Kashika of Pt.Vamana and Jayaditya, Chaukhamba Sanskrit sansthan, Varanasi (1996)
Van Nooten, B.A.: Pāṇini’s replacement technique and the active finite verb. University of California, Berkeley
Sharma, R.N.: The Aṣtādhyayi of Pāṇini. Munshiram Manoharlal Publishers Pvt. Ltd, Delhi (2003)
Shastri, Bheemsen, Laghusiddhantakaumudi, Prakashan, B.: 537, Lajapatrai Market, New Delhi
Kumar, S.S.: Kṛdanta Recognition and Processing for Sanskrit. Mphil degree at SCSS, JNU (submitted, 2008)
Shastri, Dwarikadas, S.: The Madhaviya Dhatuvṛtti by Saya_acarya. Tara Book Agency, Varanasi (2000)
Sharma, D.: Structure and Meaning. Nag Publishers, New Delhi (1982)
Subash, Jha, Girish N.: Morphological analysis of nominal inflections in Sanskrit. In: Platinum Jubilee International Conference, L.S.I., p. 34. Hyderabad University, Hyderabad (2005)
Subash: Machine recognition and morphological analysis of Subanta-padas, M.Phil dissertation J.N.U., New Delhi (submitted, 2006)
Upadhye, P.V.: Dhaturupacandrika. Gopal Narayen & Co, Bombay (1927)
Whitney, W.D.: History of Sanskrit Grammar, Sanjay Prakashan, Delhi (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bhadra, M. et al. (2008). Sanskrit Analysis System (SAS). In: Kulkarni, A., Huet, G. (eds) Sanskrit Computational Linguistics. ISCLS 2009. Lecture Notes in Computer Science(), vol 5406. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-93885-9_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-93885-9_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-93884-2
Online ISBN: 978-3-540-93885-9
eBook Packages: Computer ScienceComputer Science (R0)