Abstract
In this paper, we are presenting our work towards building a dependency parser for Sanskrit language that uses deterministic finite automata(DFA) for morphological analysis and ’utsarga apavaada’ approach for relation analysis. A computational grammar based on the framework of Panini is being developed. A linguistic generalization for Verbal and Nominal database has been made and declensions are given the form of DFA. Verbal database for all the class of verbs have been completed for this part. Given a Sanskrit text, the parser identifies the root words and gives the dependency relations based on semantic constraints. The proposed Sanskrit parser is able to create semantic nets for many classes of Sanskrit paragraphs(अनुचछेद). The parser is taking care of both external and internal sandhi in the Sanskrit words.
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
Bonet, B., Geffner, H.: Planning as heuristic search. Artificial Intelligence 129 (2001)
Ferro, M.V., Souto, D.C., Pardo, M.A.A.: Dynamic programming as frame for efficient parsing. Computer science (1998)
Ivanov, Y.A., Bobick, A.F.: Recognition of visual activities and interactions by stochastic parsing. IEEE Transactions on Pattern Analysis and Machine Intelligence 22(8), 852–872 (2000)
Briggs, R.: Knowledge Representation in Sanskrit and artificial Intelligence. The AI Magazine, 33–39 (1985)
Huet, G.: The Zen Computational Linguistics Toolkit. ESSLLI 2002, Lectures, Trento, Italy (2002)
Huet, G.: A Functional Toolkit for Morphological and Phonological Processing, Application to a Sanskrit Tagger. Journal of Functional Programming 15(4), 573–614 (2005)
Huet, G.: Shallow syntax analysis in Sanskrit guided by semantic nets constraints. LNCS. Springer, Heidelberg (2007)
Bureau of Indian Standards. ISCII: Indian Script Code for Information Interchange. ISCII-91(1999)
Bharati, A., Sangal, R.: Parsing Free Word Order Languages in the Paninian Framework. In: Proc. of Annual Meeting of Association for Computational Linguistics, New Jersey, pp. 105–111 (1993)
Kale, M.R.: A Higher Sanskrit Grammar, 4th edn. Motilal Banarasidass Publishers Pvt. Ltd. (1967)
Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation, 2nd edn. Pearson Education Pvt. Ltd., London (2002)
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
Goyal, P., Arora, V., Behera, L. (2009). Analysis of Sanskrit Text: Parsing and Semantic Relations. 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_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-00155-0_7
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)