phil williams was implementing a faster (& prob smaller) phrase table
for the syntax/hierarchical model at the mt marathon
http://statmt.org/mtm6/?n=Main.EfficientDecodingWithLabelledGrammarsInMoses
if you want to use less memory, your best bet is to use the binary
phrase-table. If it's too slow, 'encourage' the files into the OS cache with
cat *.binphr.* > /dev/null
another way is to filter the phrase-table with the program in
/sigtest-filter/
On 16/09/2011 20:24, Marcin Junczys-Dowmunt wrote:
> Hi,
> I am thinking about writing a phrase-table implementation that can be
> fully kept in memory without using up hundreds of gigabytes like it is
> the case for PhraseDictionaryMemory. Has something like that been done
> earlier? In that case I would not duplicate the work :)
>
> I tried to browse through the branches, but could not find anything.
> This brings me to my second question. Is there any place where I can
> check what is done in the branches other than the commit messages in the
> repository? It is not particularly easy to get a picture from those.
>
> Regards,
> Marcin
> _______________________________________________
> 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
