A tutorial on dual decomposition and lagrangian relaxation for inference in natural language processing

M Rushalexander ,Collinsmichael

doi:10.5555/2444851.2444860

A tutorial on dual decomposition and lagrangian relaxation for inference in natural language processing

M Rushalexander , Collinsmichael

https://doi.org/10.5555/2444851.2444860

Copy DOI

Export

Save

Cite

Journal: Journal of Artificial Intelligence Research	Publication Date: Sep 1, 2012
Citations: 2

#Inference In Natural Language Processing #Dual Decomposition #Natural Language Processing #Natural Language #Inference #Inference Problems #Decomposition #Combinatorial #Language #Combinatorial Optimization

Abstract
Full-Text
Similar Papers

Abstract

Listen

Dual decomposition, and more generally Lagrangian relaxation, is a classical method for combinatorial optimization; it has recently been applied to several inference problems in natural language pr...

Full Text

Published Version

Check institute access

Open DOI Link

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Similar Papers

Paper Title

Journal

Date

Author

View more papers

More From: Journal of Artificial Intelligence Research

Paper Title

Journal

Date

Author

View more papers

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.

R Discovery Prime

A tutorial on dual decomposition and lagrangian relaxation for inference in natural language processing