Moses-support Digest, Vol 100, Issue 101

Send Moses-support mailing list submissions to
moses-support@mit.edu

To subscribe or unsubscribe via the World Wide Web, visit
http://mailman.mit.edu/mailman/listinfo/moses-support
or, via email, send a message with subject or body 'help' to
moses-support-request@mit.edu

You can reach the person managing the list at
moses-support-owner@mit.edu

When replying, please edit your Subject line so it is more specific
than "Re: Contents of Moses-support digest..."


Today's Topics:

1. Re: Documentation describing Moses n-best list extraction
(Matthias Huck)


----------------------------------------------------------------------

Message: 1
Date: Sat, 28 Feb 2015 17:11:53 +0000
From: Matthias Huck <mhuck@inf.ed.ac.uk>
Subject: Re: [Moses-support] Documentation describing Moses n-best
list extraction
To: Hieu Hoang <Hieu.Hoang@ed.ac.uk>
Cc: "moses-support@mit.edu" <moses-support@mit.edu>, Philip James
Williams <p.j.williams-2@sms.ed.ac.uk>
Message-ID: <1425143513.1876.3.camel@inf.ed.ac.uk>
Content-Type: text/plain; charset="UTF-8"

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 <dowobeha@gmail.com>
> 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
> Moses-support@mit.edu
> http://mailman.mit.edu/mailman/listinfo/moses-support
>
>
> _______________________________________________
> Moses-support mailing list
> Moses-support@mit.edu
> 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
Moses-support@mit.edu
http://mailman.mit.edu/mailman/listinfo/moses-support


End of Moses-support Digest, Vol 100, Issue 101
***********************************************

Tweet