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 reasonable. I wouldn't mind seeing this code cleaned up a bit and abstracted and formalised. I've made a start with the cleanup in my new decoder https://github.com/moses-smt/mosesdecoder/blob/perf_moses2/contrib/other-builds/moses2/Search/Search.cpp#L36 Search::CanExtend() There was an Aachen paper from years ago comparing different distortion limit heuristics - can't remember the authors or title. Maybe someone know more Hieu Hoang http://www.hoang.co.uk/hieu On 15 December 2015 at 20:59, Lane Schwartz <[email protected]> wrote: > 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 commented, so kudos to > whoever did that. :) > > That said, does anyone happen to have any slides that actually walk > through this process, specifically slides that take into account the > interaction with the distortion limit? That interaction is where most of > the complexity of this method comes from. I don't know about others, but > even having a pretty good notion of what's going on here, the discussion of > "the closest thing to the left" is still a bit opaque. > > Anyway, if anyone knows of a good set of slides, or even a good > description in a paper, of what's going on here, I'd appreciate any > pointers. > > Thanks, > Lane > > > _______________________________________________ > Moses-support mailing list > [email protected] > http://mailman.mit.edu/mailman/listinfo/moses-support > >
_______________________________________________ Moses-support mailing list [email protected] http://mailman.mit.edu/mailman/listinfo/moses-support
