Thanks, Wilker. That does look promising.
I love this little footnote from the paper: "We do not know if WLd is
documented anywhere, but from inspection it is used in Moses (Koehn et al.,
2007). This was confirmed by Philipp Koehn and Hieu Hoang (p.c.)."
On Fri, Dec 18, 2015 at 10:12 AM, Wilker
Hi,
I hope it is not too late to add to this discussion.
If you are comfortable with weighted deduction, Adam Lopez's 2009 EACL
paper is very a good reference for phrase-based reordering spaces. If I
remember well the implementation in Moses does exactly what he shows with
the logic program WLd.
I've been looking at this and it is surprisingly complicated. I think the
code is designed to predetermine if extending a hypothesis will lead it
down a path that won't ever be completed.
Don't know any slide that explains the reasoning, Philipp Koehn explained
it to me once and it seems pretty
Hey all,
So the SearchNormal::ProcessOneHypothesis() method in SearchNormal.cpp is
responsible for taking an existing hypothesis, creating all legal new
extension hypotheses, and adding those new hypotheses to the appropriate
decoder stacks.
First off, the method is actually reasonably well
Hi Lane,
Well, you can find excellent descriptions of phrase-based decoding
algorithms in the literature, though possibly not all details of this
specific implementation.
I like this description:
R. Zens, and H. Ney. Improvements in Dynamic Programming Beam Search for
Phrase-based Statistical
