Semi-supervised dependency parsing using lexical affinities

  • Authors:
  • Seyed Abolghasem Mirroshandel;Alexis Nasr;Joseph Le Roux

  • Affiliations:
  • Université Aix-Marseille, Marseille, France and Sharif university of Technology, Tehran, Iran;Université Aix-Marseille, Marseille, France;LIPN, Université Paris Nord & CNRS, Villetaneuse, France

  • Venue:
  • ACL '12 Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics: Long Papers - Volume 1
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Treebanks are not large enough to reliably model precise lexical phenomena. This deficiency provokes attachment errors in the parsers trained on such data. We propose in this paper to compute lexical affinities, on large corpora, for specific lexico-syntactic configurations that are hard to disambiguate and introduce the new information in a parser. Experiments on the French Treebank showed a relative decrease of the error rate of 7.1% Labeled Accuracy Score yielding the best parsing results on this treebank.