Dependency Parsing Algorithms

Rao, Ashwath B (2016) Dependency Parsing Algorithms. In: National Conference on Indian Language Computing, 26/02/2016, Cochin University of Science and Technology,Cochin.

[img] PDF
151.pdf - Published Version
Restricted to Registered users only

Download (402kB) | Request a copy

Abstract

Semantic analysis of sentences can only be carried out using Dependency Parsing. Dependency parser accepts words in a sentence and builds dependency relation among the words resulting in a unique tree for each sentence. An Indian Panini is the first to develop semantic analysis for Sanskrit using a dependency framework. Western researchers in the near past have also deliberated on dependency parsing so that automated dependency parser can be generated. Dependency Parser is useful in information extraction, question-answering, text summarization etc. For many indian languages namely Bengali, Kannada, Malayalam and Marathi a dependency based Treebank is in the development stage. Also for Hindi, Telugu and Tamil dependency Treebanks are already developed. The Treebank data can be used by a dependency parser generator like Maltparser to develop a Dependency parser. In this paper few dependency parsing algorithms are discussed

Item Type: Conference or Workshop Item (Paper)
Uncontrolled Keywords: Dependency Parser Algorithms, Covington Algorithm, Nivre et al. Algorithm
Subjects: Engineering > MIT Manipal > Computer Science and Engineering
Depositing User: MIT Library
Date Deposited: 16 Mar 2016 11:16
Last Modified: 16 Mar 2016 11:16
URI: http://eprints.manipal.edu/id/eprint/145577

Actions (login required)

View Item View Item