Minimum risk decoding is an interesting approach to decoding in MT models that seeks to optimize an alternative objective function. We will implement it in cdec: http://cdec-decoder.org/index.php?title=Main_Page

Installation issues

Team: Hassan Sajjad?, Gideon Maillette de Buy Wenniger?, Andrea Gesmundo?, Lars Bungum?

Relevant papers:

MBR (and approximations) on hypergraphs:

• http://aclweb.org/anthology-new/P/P09/P09-1019.pdf
• http://aclweb.org/anthology-new/P/P09/P09-1064.pdf

Tromble MBR paper on lattices (cited by the above):

• http://aclweb.org/anthology-new/D/D08/D08-1065.pdf

original MBR for MT paper:

• http://aclweb.org/anthology-new/N/N04/N04-1022.pdf

n-gram posterior computation:

• http://aclweb.org/anthology-new/P/P10/P10-2006.pdf
• http://aclweb.org/anthology-new/D/D09/D09-1005.pdf (note: only the first part of this is relevant; the paper is interesting but dense).

cdec:

• http://aclweb.org/anthology-new/P/P10/P10-4002.pdf

build instructions: http://cdec-decoder.org/index.php?title=Building_cdec_from_source

code guide: The relevant bit of the top-level translation loop is in file decoder/cdec.cc, from around lines 384-428. It breaks up the computation into several discrete steps that can be understood as manipulations on hypergraph objects. The goal of the project will be to add two extra steps: computation of n-gram posteriors and then maximization.

Code editing with eclipse: See :

• http://eclipsewebmaster.blogspot.com/2007/01/remote-editing-using-eclipse.html

This explains how you can acces remote code with a local version of eclipse

Drawing graphs in cdec

Page last modified on September 15, 2010, at 04:03 PM