Anzeige
Erschienen in:
2010 | OriginalPaper | Buchkapitel
Generative Graph Grammar of Neo-Vaiśeṣika Formal Ontology (NVFO)
verfasst von : Rajesh Tavva, Navjyoti Singh
Erschienen in: Sanskrit Computational Linguistics
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
NLP applications for Sanskrit so far work within computational paradigm of string grammars. However, to compute ‘meanings’, as in traditional
śā
bdabodha
prakriyā
-s, there is a need to develop suitable graph grammars. Ontological structures are fundamentally graphs. We work within the formal framework of Neo-Vaiśeṣika Formal Ontology (NVFO) to propose a generative graph grammar. The proposed formal grammar only produces well-formed graphs that can be readily interpreted in accordance with
Vaiśeṣ
ika
Ontology. We show that graphs not permitted by
Vaiśeṣ
ika
ontology are not generated by the proposed grammar. Further, we write Interpreter of these graphical structures. This creates computational environment which can be deployed for writing computational applications of
Vaiśeṣ
ika
ontology. We illustrate how this environment can be used to create applications like computing
śā
bdabodha
of sentences.