Archives


Rate this Article: (0) Votes

Research Article

Year : 2015 | Volume: 1 | Issue: 1 | Pages: 23-29

Parsing Techniques using Paninian Framework on Nepali Language

Archit Yajnik1*, Dhanapati Sharma2

DOI: 10.18831/djmaths.org/2015011004

Corresponding author

Archit Yajnik*

Department of Mathematics, Sikkim Manipal University, India.

  • 1. Department of Mathematics, Sikkim Manipal University, India.

Received on: 2015/10/19

Revised on: 2015/11/15

Accepted on: 2015/11/20

Published on: 2015/11/27

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.

Keywords

Parsing, Paninian framework, Karaka-Vibhakti, Bipartite matching problem, Hopfield network.