On Sat, 2015-02-28 at 16:45 +0000, Hieu Hoang wrote: > i've never seen the phrase-based n-best extraction explicitly > described. There was a paper on directed graph enumeration (I forget > which) that was helpful t me when I was implementing it.
Maybe this? Hart, P., Nilsson, N., and Raphael, B., "A Formal Basis for the Heuristic Determination of Minimum Cost Paths," IEEE Trans. Syst. Science and Cybernetics, SSC-4(2):100-107, 1968. http://ai.stanford.edu/~nilsson/OnlinePubs-Nils/PublishedPapers/astar.pdf > However, it's a fairly simple dynamic programming algorithm > > > The scfg-based extraction is different. I think it's based on 1 of > Liang Huang's paper, however, Phil can tell you more. > > > It was formerly based on the same algorithm as pb, but it was found > out to be incorrect and missing some paths > > Hieu Hoang > Research Associate (until March 2015) > > ** searching for interesting commercial MT position ** > > University of Edinburgh > http://www.hoang.co.uk/hieu > > > > On 25 February 2015 at 13:08, Lane Schwartz <[email protected]> > wrote: > Is there a particular paper that describes the current > technique(s) > used for n-best list extraction within Moses? > > 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 > The University of Edinburgh is a charitable body, registered in > Scotland, with registration number SC005336. -- The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. _______________________________________________ Moses-support mailing list [email protected] http://mailman.mit.edu/mailman/listinfo/moses-support
