Re: [Moses-support] Error Installing Moses
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/ ___ Moses-support mailing list Moses-support@mit.edu http://mailman.mit.edu/mailman/listinfo/moses-support
Re: [Moses-support] SMT decoding complexity
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 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 > 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 > > > ___ Moses-support mailing list Moses-support@mit.edu http://mailman.mit.edu/mailman/listinfo/moses-support
Re: [Moses-support] SMT decoding complexity
Hi Amir You could also try this paper for a derivation of the complexity of PBMT decoding https://www.aclweb.org/anthology/E/E09/E09-1061v2.pdf cheers - Barry On 27/02/17 15:54, Philipp Koehn 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 > 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 >> > ___ > 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. ___ Moses-support mailing list Moses-support@mit.edu http://mailman.mit.edu/mailman/listinfo/moses-support
Re: [Moses-support] SMT decoding complexity
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 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 > ___ Moses-support mailing list Moses-support@mit.edu http://mailman.mit.edu/mailman/listinfo/moses-support
Re: [Moses-support] ReportingOptions and mosesserver XML
If I understand you correctly you are worrying about changing global
options with XML translation requests sent to the server. This is not the
case. Each request gets its own local copy of parameters at line
https://github.com/moses-smt/mosesdecoder/blob/master/moses/server/TranslationRequest.cpp:276,
so all parameter changes are local to the XML request being processed.
- Uli
On Mon, Feb 20, 2017 at 6:39 PM, Lane Schwartz wrote:
> Hi,
>
> In moses/parameters/ReportingOptions.cpp, the following code was added by
> Uli in commit 69e5a1cc152de40 about a year ago:
>
>
> m = param.find("align");
> if (m != param.end() && Scan(xmlrpc_c::value_string(m->second)))
> ReportSegmentation = 1;
>
>
> This is relevant when using XML-RPC requests via mosesserver, and it turns
> on ReportSegmentation if the XML response includes segmentation. Most of
> the time this would be superfluous, since the reason that the XML response
> contains segmentation is typically because ReportSegmentation was already
> set to 1 in the moses server config file.
>
> I'm interested in re-enabling the moses server code that allows this to
> alternatively be set via XML-RPC request, but I don't want
> ReportSegmentation turned on in this case. The reason is that I want the
> segmentation information, but I don't want the returned hypothesis to
> include the segmentation in the reported hypothesis string. If
> ReportSegmentation is set to 1, then that will happen.
>
> My question is, is it OK to delete or comment out this block of code?
>
> If someone has a good reason why it's there, that's fine. But I can't seem
> to find one.
>
> Thanks,
> Lane
>
--
Ulrich Germann
Senior Researcher
School of Informatics
University of Edinburgh
___
Moses-support mailing list
Moses-support@mit.edu
http://mailman.mit.edu/mailman/listinfo/moses-support
