• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

DMCA

Incremental integer linear programming for non-projective dependency parsing (2006)

Cached

  • Download as a PDF

Download Links

  • [sebrie.freehostia.com]
  • [acl.ldc.upenn.edu]
  • [www.aclweb.org]
  • [acl.ldc.upenn.edu]
  • [www.aclweb.org]
  • [aclweb.org]
  • [aclweb.org]
  • [aclweb.org]
  • [wing.comp.nus.edu.sg]
  • [newdesign.aclweb.org]
  • [wing.comp.nus.edu.sg]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Sebastian Riedel , James Clarke
Venue:In EMNLP
Citations:63 - 6 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@INPROCEEDINGS{Riedel06incrementalinteger,
    author = {Sebastian Riedel and James Clarke},
    title = {Incremental integer linear programming for non-projective dependency parsing},
    booktitle = {In EMNLP},
    year = {2006},
    pages = {129--137}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

Integer Linear Programming has recently been used for decoding in a number of probabilistic models in order to enforce global constraints. However, in certain applications, such as non-projective dependency parsing and machine translation, the complete formulation of the decoding problem as an integer linear program renders solving intractable. We present an approach which solves the problem incrementally, thus we avoid creating intractable integer linear programs. This approach is applied to Dutch dependency parsing and we show how the addition of linguistically motivated constraints can yield a significant improvement over stateof-the-art. 1

Keyphrases

incremental integer    non-projective dependency    machine translation    decoding problem    probabilistic model    significant improvement    integer linear program render    integer linear programming    complete formulation    global constraint    certain application    intractable integer linear program    non-projective dependency parsing   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University