12
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      An Ontology for Comprehensive Tutoring of Euphonic Conjunctions of Sanskrit Grammar

      Preprint
      , ,

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          Euphonic conjunctions (sandhis) form a very important aspect of Sanskrit morphology and phonology. The traditional and modern methods of studying about euphonic conjunctions in Sanskrit follow different methodologies. The former involves a rigorous study of the Paninian system embodied in Panini's Ashtadhyayi, while the latter usually involves the study of a few important sandhi rules with the use of examples. The former is not suitable for beginners, and the latter, not sufficient to gain a comprehensive understanding of the operation of sandhi rules. This is so since there are not only numerous sandhi rules and exceptions, but also complex precedence rules involved. The need for a new ontology for sandhi-tutoring was hence felt. This work presents a comprehensive ontology designed to enable a student-user to learn in stages all about euphonic conjunctions and the relevant aphorisms of Sanskrit grammar and to test and evaluate the progress of the student-user. The ontology forms the basis of a multimedia sandhi tutor that was given to different categories of users including Sanskrit scholars for extensive and rigorous testing.

          Related collections

          Author and article information

          Journal
          2014-10-10
          2015-02-03
          Article
          1410.2871
          d8bfdaee-a800-4144-a077-b4e38a70292b

          http://arxiv.org/licenses/nonexclusive-distrib/1.0/

          History
          Custom metadata
          European Journal of Scientific Research, ISSN 1450-216X / 1450-202X, Vol. 124, No. 4, September 2014, pp 460-467
          cs.CL

          Theoretical computer science
          Theoretical computer science

          Comments

          Comment on this article