Recognition of Visual Activities and Interactions by Stochastic Parsing
IEEE Transactions on Pattern Analysis and Machine Intelligence
Artificial Intelligence - Special issue on heuristic search in artificial intelligence
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
Parsing free word order languages in the Paninian framework
ACL '93 Proceedings of the 31st annual meeting on Association for Computational Linguistics
A functional toolkit for morphological and phonological processing, application to a Sanskrit tagger
Journal of Functional Programming
Shallow syntax analysis in Sanskrit guided by semantic nets constraints
Proceedings of the 2006 international workshop on Research issues in digital libraries
Hi-index | 0.00 |
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.