Abstract
The most authoritative description of the morphophonemic rules that apply at word boundaries (external sandhi) in Sanskrit is by the great grammarian Pāṇini (fl. 5th c. b. c. e.). These rules are stated formally in Pāṇini’s grammar, the Aṣṭ ādhyāyī ‘group of eight chapters’. The present paper summarizes Pāṇini’s handling of sandhi, his notational conventions, and formal properties of his theory. An XML vocabulary for expressing Pāṇini’s rules is introduced and the application to morphophonemic rules demonstrated. Although Pāṇini’s notation potentially exceeds a finite state grammar in power, individual rules do not rewrite their own output, and thus they may be automatically translated into a rule cascade from which a finite state transducer can be compiled.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Smith, H.: Brevity in Pāṇini. Journal of Indian Philosophy 20, 133–147 (1992)
Sharma, R.N.: The Aṣṭādhyāyī of Pāṇini. Introduction to the Aṣṭādhyāyī as a Grammatical Device, vol. 1. Munshiram Manoharlal, New Delhi (1987)
Cardona, G.: On Translating and Formalizing Pāṇinian Rules. Journal of the Oriental Institute, Baroda 14, 306–314 (1965)
Sharma, R.N.: The Aṣṭādhyāyī of Pāṇini. English Translation of Adhyāyas Seven and Eight with Sanskrit Text, Transliteration, Word-Boundary, Anuvṛtti, Vṛtti, Explanatory Notes, Derivational History of Examples, and Indices, vol. 6. Munshiram Manoharlal, New Delhi (2003)
Cardona, G.: Studies in Indian Grammarians: I. The Method of Description Reflected in the Śivasūtras. Transactions of the American Philosophical Society 59, 3–48 (1969)
Cardona, G.: On Pāṇini’s Morphophonemic Principles. Language 41, 225–237 (1965)
Wall, L., Christiansen, T., Orwant, J.: Programming Perl., 3rd edn. O’Reilly, Sebastapol (2000)
Scharf, P.M., Hyman, M.D.: Linguistic issues in encoding Sanskrit. Brown University (2008) (unpublished manuscript)
Unicode Consortium: The Unicode Standard, Version 5.0. Addison-Wesley, Boston (2006)
Kaplan, R.M., Kay, M.: Regular models of phonological rule systems. Computational Linguistics 20, 332–378 (1994)
Beesley, K.R., Karttunen, L.: Finite State Morphology. CSLI, Stanford (2003)
Aho, A.V., Sethi, R., Ullman, J.D.: Compilers: Principles, Techniques, and Tools. Addison-Wesley, Reading (1988)
Chomsky, N.: Three models for the description of language. IEEE Transactions on Information Theory 2, 113–124 (1956)
Prusinkiewicz, P., Lindenmayer, A.: The Algorithmic Beauty of Plants. Springer, New York (1990)
Chomsky, N., Halle, M.: The Sound Pattern of English. MIT Press, Cambridge (1968)
Mohri, M., Sproat, R.: An efficient compiler for weighted rewrite rules. In: 34th Annual Meeting of the Association for Computational Linguistics, Santa Cruz, CA, ACL, pp. 231–238 (1996)
Lindholm, T., Yellin, F.: The JavaTM Virtual Machine Specification, 2nd edn. Addison-Wesley, Reading (1999)
Free Software Foundation: The GNU compiler for the JavaTM programming language, http://gcc.gnu.org/java/
Aronoff, M.: Segmentalism in linguistics: The alphabetic basis of phonological theory. In: Downing, P., Lima, S.D., Noonan, M. (eds.) The Linguistics of Literacy. Typological Studies in Language, vol. 21, pp. 71–82. John Benjamins, Amsterdam (1992)
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
Hyman, M.D. (2009). From Pāṇinian Sandhi to Finite State Calculus. 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_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-00155-0_10
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)