Abstract
We propose a model for computer representation of the Pāṇinian system of sanskrit grammar. Based on this model, we render the grammatical data and simulate the rules of Aṣṭādhyāyī on computer. We then employ these rules for generation of morpho-syntactical components of the language. These generated components we store in a p-subsequential transducer. This we use to develop a lexicon on Pāṇinian principles. We report briefly its implementation.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
von Böhtlingk, O.: Pāṇini’s Grammatik. Olms, Hildesheim. Primary source text for our database (1887)
Dīkṣita, P.: Aṣṭādhyāyī sahajabodha, vol. 1-4. Pratibha Prakashan, Delhi, India (2006-2007)
Katre, S.M.: Aṣṭādhyāyī of Pāṇini. Motilal Banarsidass, Delhi, India (1989)
Mohri, M.: On some Applications of Finite-State Automata Theory to Natural Language Processing. Journal of Natural Language Engineering 2, 1–20 (1996)
Śāstrī, C.: Vyākaraṇacandrodaya, vols. 1-5. Motilal Banarsidass, Delhi, India (1971)
Vasu, S.C., Vasu, V.D.: The Siddhānta-Kaumudī of Bhaṭṭojī Dīkṣita, vols. 1-3. Panini Office, Bhuvanesvara Asrama, Allahabad, India. Primary source text for prakriyā (1905)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mishra, A. (2009). Simulating the Pāṇinian System of Sanskrit Grammar. In: Huet, G., Kulkarni, A., Scharf, P. (eds) Sanskrit Computational Linguistics. ISCLS ISCLS 2007 2008. Lecture Notes in Computer Science(), vol 5402. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00155-0_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-00155-0_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00154-3
Online ISBN: 978-3-642-00155-0
eBook Packages: Computer ScienceComputer Science (R0)