Efficient Lagrangian relaxation algorithms for exact inference in natural language tasks
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2011.
Main Author: | Rush, Alexander M. (Alexander Matthew) |
---|---|
Other Authors: | Michael Collins. |
Format: | Thesis |
Language: | eng |
Published: |
Massachusetts Institute of Technology
2011
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/66477 |
Similar Items
-
Lagrangian relaxation for natural language decoding
by: Rush, Alexander M. (Alexander Matthew)
Published: (2014) -
A Tutorial on Dual Decomposition and Lagrangian Relaxation for Inference in Natural Language Processing
by: Rush, Alexander Matthew
Published: (2013) -
Exact decoding of phrase-based translation models through Lagrangian relaxation
by: Chang, Yin-Wen, S.M. Massachusetts Institute of Technology
Published: (2012) -
On dual decomposition and linear programming relaxations for natural language processing
by: Rush, Alexander Matthew, et al.
Published: (2011) -
The Novikov theory for symplectic cohomology and exact Lagrangian embeddings
by: Ritter, Alexander F. (Alexander Friedrich)
Published: (2010)