Parsing Techniques using Paninian Framework on Nepali Language
Journal: DJ Journal of Engineering and Applied Mathematics (Vol.1, No. 1)Publication Date: 2015-11-27
Authors : Archit Yajnik Dhanapati Sharma;
Page : 23-29
Keywords : Parsing; Paninian framework; Karaka-Vibhakti; Bipartite matching problem; Hopfield network.;
Abstract
This paper presents three parsing techniques for establishing karaka-vibhakti relations using Paninian framework for nepali language. It uses the concept of karaka relation between verbs and nouns in the sentence. The constraints problem reduces to bipartite graph matching problem because of the nature of constraints and bipartite graph reduces to hopfield network. Upon employing these three techniques viz. constraint based , bipartite graph matching problem and hopfield networks using the Paninial framework to the sentences of nepali language an elegant account of the relation between surface form (vibhakti) and semantic (karaka) roles is obtained. All the three techniques are demonstrated by forming parsing structure in various nepali sentences.
Other Latest Articles
- Numerical Solution of Integral Equations by using Discrete GHM Multiwavelet
- Controllability of Sobolev-Type Neutral Mixed Integrodifferential Evolution System in Banach Spaces
- On Evolutionary Games with Periodic Payoffs
- Automatic Sorting in Process Industries using PLC
- Effect on the Engineering Properties of Pervious Concrete by Partial Replacement of Cement with GGBS
Last modified: 2018-02-15 07:39:18