Two approaches for building an unsupervised dependency parser and their other applications

  • Authors:
  • Jagadeesh Gorla;Amit Goyal;Rajeev Sangal

  • Affiliations:
  • Language Technologies Research Centre, International Institute of Information Technology, Hyderabad, India;Language Technologies Research Centre, International Institute of Information Technology, Hyderabad, India;Language Technologies Research Centre, International Institute of Information Technology, Hyderabad, India

  • Venue:
  • AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Much work has been done on building a parser for natural languages, but most of this work has concentrated on supervised parsing. Unsupervised parsing is a less explored area, and unsupervised dependency parser has hardly been tried. In this paper we present two approaches for building an unsupervised dependency parser. One approach is based on learning dependency relations and the other on learning subtrees. We also propose some other applications of these approaches.