ResearchBib Share Your Research, Maximize Your Social Impacts
注册免费获得最新研究资源 注册 >> 登录

Parsing Techniques using Paninian Framework on Nepali Language

期刊名字: DJ Journal of Engineering and Applied Mathematics (Vol.1, No. 1)

Publication Date:

论文作者 : ;

起始页码 : 23-29

关键字 : Parsing; Paninian framework; Karaka-Vibhakti; Bipartite matching problem; Hopfield network.;

论文网址 : Downloadexternal 您也可以查找论文通过 : Google Scholarexternal

论文摘要

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.

更新日期: 2018-02-15 07:39:18