Randomized decoding for selection-and-ordering problems

NAACL HLT 2007 - Human Language Technologies 2007: The Conference of the North American Chapter of the Association for Computational Linguistics, Proceedings of the Main Conference

Volumn , Issue , 2007, Pages 444-451

  Deshpande, Pawan ^a   Barzilay, Regina ^a   Karger, David R ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BEAM SEARCH; CORRECT SOLUTION; DECODING ALGORITHM; DECODING METHODS; EXACT SOLUTION; INTEGER LINEAR PROGRAMMING; MULTIPLE CONTEXTS; NP-HARD; TEXT GENERATIONS; TITLE GENERATION; WEIGHTED GRAPH;

ALGORITHMS; COMPUTATIONAL LINGUISTICS; DIRECTED GRAPHS; NATURAL LANGUAGE PROCESSING SYSTEMS;

DECODING;

EID: 45849112737     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (12)

1. N. Alon, R. Yuster, U. Zwick. 1995. Color-coding. Journal of the ACM (JACM), 42(4):844-856.
2. B. Awerbuch, Y. Azar, A. Blum, S. Vempala. 1995. Improved approximation guarantees for minimum-weight k-trees and prize-collecting salesmen. In Proceedings of the STOC, 277-283.
3. E. Balas. 1989. The prize collecting traveling salesman problem. Networks, 19:621-636.
4. M. Banko, V. O. Mittal, M. J. Witbrock. 2000. Headline generation based on statistical translation. In Proceedings of the ACL, 318-325.
5. S. Corston-Oliver, M. Gamon, E. Ringger, R. Moore. 2002. An overview of amalgam: A machine-learned generation module. In Proceedings of INLG, 33-40.
6. R. G. Downey, M. R. Fellows. 1995. Fixed-parameter tractability and completeness II: On completeness for W[1]. Theoretical Computer Science, 141(1-2):109-131.
7. J. Eisner, R. W. Tromble. 2006. Local search with very large-scale neighborhoods for optimal permutations in machine translation. In Proceedings of the HLT-NAACL Workshop on Computationally Hard Problems and Joint Inference in Speech and Language Processing.
8. U. Germann, M. Jahr, K. Knight, D. Marcu, K. Yamada. 2001. Fast decoding and optimal decoding for machine translation. In Proceedings of the EACL/ACL, 228-235.
9. F. Jelinek. 1969. A fast sequential decoding algorithm using a stack. IBM Research Journal of Research and Development.
10. R. Jin, A. G. Hauptmann. 2001. Automatic title generation for spoken broadcast news. In Proceedings of the HLT, 1-3.
11. R. Motwani, P. Raghavan. 1995. Randomized Algorithms. Cambridge University Press, New York, NY.
12. D. Roth, W. Yih. 2004. A linear programming formulation for global inference in natural language tasks. In Proceedings of the CONLL, 1-8.