Moses-support Digest, Vol 124, Issue 30

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: SMT decoding complexity (amir haghighi)
2. Re: Error Installing Moses (Hieu Hoang)
3. New compile problems on RHEL 7 (Mike Ladwig)


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

Message: 1
Date: Mon, 27 Feb 2017 21:07:49 +0330
From: amir haghighi <amir.haghighi.tehrani@gmail.com>
Subject: Re: [Moses-support] SMT decoding complexity
To: Philipp Koehn <phi@jhu.edu>
Cc: Moses-support <moses-support@mit.edu>
Message-ID:
<CAPTzi0eU8G0bFHMZAfCLYBmPjrXPS4N+Kz+WrRC2bLx53qsxkA@mail.gmail.com>
Content-Type: text/plain; charset="utf-8"

Thanks Philipp,

Yes, my formula has exponential terma but as the growth of factorial is
greater than the growth of exponential, the complexity of the decoding
algorithm(without any constraint on reordering or pruning the search space)
is of O(n!), right?

Thanks Barry, I'll read the paper.

On Mon, Feb 27, 2017 at 7:24 PM, Philipp Koehn <phi@jhu.edu> wrote:

> Hi,
>
> I am not sure if you follow your question - in the formula you cite,
> there are exponential terms: 2^n and T^n.
>
> The Knight paper is worth trying to understand (it's on IBM Models,
> but applies similarly to phrase-based models).
>
> Also keep in mind that limited reordering windows and beam search
> makes actual decoding algorithm implementations linear.
>
> -phi
>
> On Sun, Feb 26, 2017 at 1:16 PM, amir haghighi
> <amir.haghighi.tehrani@gmail.com> wrote:
> > Hi all,
> >
> > In the Moses manual and also in SMT textbooks it is mentioned that the
> > decoding complexity for PB-SMT is exponential in the source sentence
> length.
> > If we have a source sentence with length n, in decoding by hypothesis
> > expansion, we have power(2,n) state, each of them can be reordered in n!
> > orders, and each state can be translated in power(T,n), where T is the
> > number of translation options, right?
> > so the decoder complexity is power(2,n)*n!*power(T,n), so why its
> mentioned
> > that the complexity is exponential?
> >
> > Could someone please explain for me how the decoder complexity is
> > calculated?
> > I've read the Knight(1999) paper, but I couldn't understand it. Could you
> > please introduce another reference?
> >
> > Thanks
> >
> >
> > _______________________________________________
> > Moses-support mailing list
> > Moses-support@mit.edu
> > http://mailman.mit.edu/mailman/listinfo/moses-support
> >
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://mailman.mit.edu/mailman/private/moses-support/attachments/20170227/bc55f0e3/attachment-0001.html

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

Message: 2
Date: Mon, 27 Feb 2017 23:59:34 +0000
From: Hieu Hoang <hieuhoang@gmail.com>
Subject: Re: [Moses-support] Error Installing Moses
To: Sriharini Pingali <spingali@andrew.cmu.edu>, moses-support@mit.edu
Message-ID: <e04ec953-ced3-e320-090e-3da953b33b55@gmail.com>
Content-Type: text/plain; charset=utf-8; format=flowed

You don't need to compile moses if all you want is to use the tokenizer
- it's just a perl script.

ps. please subscribe to the Moses mailing list before posting to it. You
can subscribe here:

http://mailman.mit.edu/mailman/listinfo/moses-support


On 27/02/2017 21:12, Sriharini Pingali wrote:
> I've attached the build log to this email. I currently have OS
> X 10.11.6 and had a couple failed targets when installing Boost on my
> computer.
>
> I just want to be able to use the Moses tokenizer in my Python code. I
> already have NLTK. Please let me know if there is some easy way to set
> this up.

--
Hieu Hoang
http://moses-smt.org/



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

Message: 3
Date: Tue, 28 Feb 2017 10:33:30 -0500
From: Mike Ladwig <mdladwig@gmail.com>
Subject: [Moses-support] New compile problems on RHEL 7
To: Moses Support <moses-support@mit.edu>
Message-ID:
<CAB3VaD0VTmkdi_x+pSc5qLLVLYy=KFAcpOP=8d7F51tbRmGbng@mail.gmail.com>
Content-Type: text/plain; charset="utf-8"

I've build moses 3.x previously without issue, but something has changed in
the last few months (fresh checkout this morning) and the build is now
failing on RHEL 7.x. I setup LIBRARY_PATH and CPATH to link with a locally
compiled zlib (the RHEL zlib is broken).

I use the following commands:
export LIBRARY_PATH=/usr/local/lib64
export CPATH=/usr/local/include
./bjam --with-cmph=/usr/local

It looks like it is generally failing in link steps trying to link x86
instead of x86_64 libraries (/usr/lib instead of /usr/lib64):

[mike@c7test mosesdecoder]$ file /usr/lib64/librt-2.17.so
/usr/lib64/librt-2.17.so: ELF 64-bit LSB shared object, x86-64, version 1
(GNU/Linux), dynamically linked,
BuildID[sha1]=82e77ade22bc9fff8d3458bd37331e7edf174c28, for GNU/Linux
2.6.32, not stripped
[mike@c7test mosesdecoder]$ file /usr/lib64/libSegFault.so
/usr/lib64/libSegFault.so: ELF 64-bit LSB shared object, x86-64, version 1
(SYSV), dynamically linked,
BuildID[sha1]=2fdc95c4323c554e206e16fb01571970c9c0afd5, for GNU/Linux
2.6.32, not stripped
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://mailman.mit.edu/mailman/private/moses-support/attachments/20170228/6186022c/attachment-0001.html
-------------- next part --------------
A non-text attachment was scrubbed...
Name: build.log.gz
Type: application/x-gzip
Size: 1716 bytes
Desc: not available
Url : http://mailman.mit.edu/mailman/private/moses-support/attachments/20170228/6186022c/attachment-0001.gz

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

_______________________________________________
Moses-support mailing list
Moses-support@mit.edu
http://mailman.mit.edu/mailman/listinfo/moses-support


End of Moses-support Digest, Vol 124, Issue 30
**********************************************

Tweet