Hi, the only other in-memory implementation is the dynamic suffix array phrase table, which stores the parallel corpus in memory, which is typically much smaller.
-phi On Fri, Sep 16, 2011 at 7:24 PM, Marcin Junczys-Dowmunt <[email protected]> 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
