



\section{
\label{releases.tex}
Releases}







\subsection{
Release 4.0 (5th Oct, 2017)}


This is the current stable release.






\begin{compactitem}
\item Get the code on {\bf github}\footnote{\sf https://github.com/moses-smt/mosesdecoder/tree/RELEASE-4.0}

\item Download {\bf Binaries}\footnote{\sf http://www.statmt.org/moses-release/RELEASE-4.0/binaries/}

\item Pre-made {\bf models}\footnote{\sf http://www.statmt.org/moses-release/RELEASE-4.0/models/}

\item Virtual Machines {\bf files}\footnote{\sf http://www.statmt.org/moses-release/RELEASE-4.0/vm/}

\item Release {\bf notes}\footnote{\sf http://www.statmt.org/moses/RELEASE-4.0/Moses-v4.0-release-notes.pdf}

\end{compactitem}

\subsection{
Release 3.0 (3rd Feb, 2015)}

\begin{compactitem}
\item Get the code on {\bf github}\footnote{\sf https://github.com/moses-smt/mosesdecoder/tree/RELEASE-3.0}

\item Download {\bf Binaries}\footnote{\sf http://www.statmt.org/moses-release/RELEASE-3.0/binaries/}

\item Pre-made {\bf models}\footnote{\sf http://www.statmt.org/moses-release/RELEASE-3.0/models/}

\item Virtual Machines {\bf files}\footnote{\sf http://www.statmt.org/moses-release/RELEASE-3.0/vm/}

\item Release {\bf notes}\footnote{\sf http://www.statmt.org/mosescore/uploads/Internal/D1.4\_Moses\_v3\_Release\_Notes.pdf}

\end{compactitem}

\subsection{
Release 2.1.1 (3rd March, 2014)}


This is a minor patch for a bug that prevent Moses from linking with tcmalloc when it is available on the compilation machine. Using tcmalloc can substantially speed up decoding, at the cost of more memory usage.

\begin{compactitem}
\item Get the code on {\bf github}\footnote{\sf https://github.com/moses-smt/mosesdecoder/tree/RELEASE-2.1}

\end{compactitem}

\subsection{
Release 2.1 (21th Jan, 2014)}

\begin{compactitem}
\item Get the code on {\bf github}\footnote{\sf https://github.com/moses-smt/mosesdecoder/tree/RELEASE-2.1}

\item Download {\bf Binaries}\footnote{\sf http://www.statmt.org/moses/RELEASE-2.1/binaries/}

\end{compactitem}

\subsubsection*{
Overview}


The broad aim of this release is to tackle more complicated issues to enable better expandability and reliability.



Specifically, the decoder has been refactored to create a more modular framework to enable easier incorporation of new feature functions into Moses. This has necessitate major changes in many other parts of the toolkit, including training and tuning.



As well as the refactored code, this release also incorporate a host of new features donated by other developers. Transliteration modules, better error handling, small and fast language models, and placeholders are just some of the new features that spring to mind.



We have also continue to expand the testing regime to maintain the reliability of the toolkit, while enable more developers to contribute to the project. 



We distribute Moses as:
1. source code, 
2. binaries for Windows (32 and 64 bit), Mac OSX (Mavericks), and various flavours of Linux (32 and 64 bit).
3. pre-installed in a Linux virtual machine, using the open source VirtualBox application.
4. Amazon cloud server image.



\subsection{
Release 1.0 (28th Jan, 2013)}

\begin{compactitem}
\item Get the code on {\bf github}\footnote{\sf https://github.com/moses-smt/mosesdecoder/tree/RELEASE-1.0}

\end{compactitem}

\subsubsection*{
Overview}


The Moses community has grown tremendously over the last few years. From the beginning as
a purely research-driven project, we are now a diverse community of academic and business
users, ranging in experience from hardened developers to new users.



Therefore, the first priority of this release has been to concentrate on resolving long-standing,
but straightforward, issues to make the toolkit easier to use and more efficient. The provision of
full-time development team devoted to the maintenance and enhancement of the Moses toolkit
has allowed has to tackle many useful engineering problems.



A second priority was to put in place a multi-tiered testing regime to enable more developers to
contribute to the project, more quickly, while ensuring the reliability of the toolkit.
However, we have not stopped adding new features to the toolkit; the next section lists a number
of major features added in the last 9 months.



\subsubsection*{
New Features}


The following is a list of the major new features in the Moses toolkit since May 2012, in roughly
chronological order.



\paragraph*{
Parallel Training by Hieu Hoang and Rohit Gupta. }


The training process has been
improved and can take advantage of multi-core machines. Parallelization was achieved
by partitioning the input data, then running the translation rule extraction processes in
parallel before merging the data. The following is the timing for the extract process on
different number of cores:







\begin{center}\begin{tabular}{llllllllll} Cores & One & Two & Three & Four & \\ 
Time taken (mins) & 48:55 & 33:13 & 27:52 & 25:35 & \\ 
\end{tabular}\end{center}

The training processes have also been redesigned to decrease disk access, and to use
less disk space. This is important for parallel processing as disk IO often becomes the
limiting factor with a large number of simultaneous disk access. It is also important when
training syntactically inspired models or using large amounts of training data, which can
result in very large translation models.



\paragraph*{
IRST LM training integration by Hieu Hoang and Philipp Koehn}


The IRST toolkit
for training language models have been integrated into the Experiment Management
System. The SRILM software previously carried out this functionality. Substituting IRST
for SRI means that the entire training pipeline can be run using only free, open-source
software. Not only is the IRST toolkit unencumbered by a proprietary license, it is also
parallelizable and capable of training with a larger amount of data than was otherwise
possible with SRI.



\paragraph*{
Distributed Language Model by Oliver Wilson.}


Language models can be
distributed across many machines, allowing more data to be used at the cost of a
performance overhead. This is still experimental code.



\paragraph*{
Incremental Search Algorithm by Kenneth Heafield.}


A replacement for the cube
pruning algorithm in CKY++ decoding, used in hierarchical and syntax models. It offers
better tradeoff between decoding speed and translation quality.



\paragraph*{
Compressed Phrase-Table and Reordering-Tables by Marcin Junczys-Dowmunt.}


A phrase-table and lexicalized reordering-table implementation which is both small and
fast. More details\footnote{\sf http://www.staff.amu.edu.pl/\textasciitilde{}junczys/images/7/7b/Mjd2012tsd1.pdf}.



\paragraph*{
Sparse features by Eva Hasler, Barry Haddow, Philipp Koehn}


A framework to allow a large
number of sparse features in the decoder. A number of sparse feature functions
described in the literature have been reproduced in Moses. Currently, the available
sparse feature functions are:

\begin{compactenum}\item TargetBigramFeature

\item TargetNgramFeature

\item SourceWordDeletionFeature

\item SparsePhraseDictionaryFeature

\item GlobalLexicalModelUnlimited

\item PhraseBoundaryState

\item PhraseLengthFeature

\item PhrasePairFeature

\item TargetWordInsertionFeature

\end{compactenum}
\paragraph*{
Suffix array for hierarchical models by Hieu Hoang}


The training of syntactically-inspired
hierarchical models requires a large amount of time and resource. An alternative to
training a translation is to only extract the required translation rules for each input
sentence.



We have integrated Adam Lopez's suffix array implementation into Moses. This is a
well-known and mature implementation, which is hosted and maintained by the cdec
community.



\paragraph*{
Multi-threaded tokenizer by Pidong Wang}


\paragraph*{
Batched MIRA by Colin Cherry.}


A replacement for MERT, especially suited for tuning a large number of sparse features.
(Cherry and Foster, NAACL 2012\footnote{\sf https://sites.google.com/site/colinacherry/Cherry\_Foster\_NAACL\_2012.pdf}).



\paragraph*{
LR score by Lexi Birch and others.}


The BLEU score commonly used in MT is
insensitive to reordering errors. We have integrated another metric , LR score, described
in (Birch and Osborne, 2011\footnote{\sf http://aclweb.org/anthology/P/P11/P11-1103.pdf}) which better accounts for reordering, in the Moses toolkit.



\paragraph*{
Convergence of Translation Memory and Statistical Machine Translation by Philipp Koehn and Hieu Hoang}


An alternative extract algorithm, (Koehn, Senellart, 2010 AMTA\footnote{\sf http://www.mt-archive.info/AMTA-2010-Koehn.pdf}), which is inspired by the use of translation memories has been integrated into the
Moses toolkit.



\paragraph*{
Word Alignment Information is turned on by default by Hieu Hoang and Barry Haddow}


The
word alignment produced by GIZA++/mgiza is carried by the phrase-table and made
available to the decoder. This information is required by some feature functions. The
use of these word alignment is now optimized for memory and speed, and enabled by
default.



\paragraph*{
Modified Moore-Lewis filtering by Barry Haddow and Philipp Koehn}


Reimplementation of domain adaptation of parallel corpus described by 
Axelrod et al. (EMNLP 2011)\footnote{\sf http://aclweb.org/anthology/D/D11/D11-1033.pdf}.



\paragraph*{
Lots and lots of cleanups and bug fixes}


By Ales Tamchyna, Wilker Aziz,
Mark Fishel, Tetsuo Kiso, Rico Sennrich, Lane Schwartz, Hiroshi Umemoto,
Phil Williams, Tom Hoar, Arianna Bisazza, Jacob Dlougach, Jonathon Clark,
Nadi Tomeh, Karel Bilek, Christian Buck, Oliver Wilson, Alex Fraser, Christophe
Servan, Matous Machecek, Christian Federmann, Graham Neubig.



\subsubsection*{
Building and Installing}


The structure and installation of the Moses toolkit has been simplified to make compilation and
installation easier. The training and decoding process can be run from the directory in which the
toolkit was downloaded, without the need for separate installation step.



This allows binary, ready-to-run versions of Moses to distributed which can be downloaded and
executed immediately. Previously, the installation needed to be configured specifically for the
user's machine.



A new build system has been implemented to build the Moses toolkit. This uses the boost
library's build framework. The new system offers several advantages over the previous build
system.



Firstly, the source code for the new build system is included in the Moses repository which
is then bootstrapped the first time Moses is compiled. It does not rely on the the cmake,
automake, make, and libtool applications. These have issues with cross-platform compatibility
and running on older operating systems.



Secondly, the new build system integrates the running of the unit tests and regression tests with
compilation.



Thirdly, the new system is significantly more powerful, allowing us to support a number of new
build features such as static and debug compilation, linking to external libraries such as mpi and
tmalloc, and other non-standard builds.



\subsubsection*{
Testing}


The MosesCore team has implemented several layers of testing to ensure the reliability of the
toolkit. We describe each below.



\paragraph*{
Unit Testing}


Unit testing tests each function or class method in isolation. Moses uses the unit testing
framework available from the Boost library to implement unit testing.



The source code for the unit tests are integrated into the Moses source. The tests are executed
every time the Moses source is compiled.



The unit testing framework has recently been implemented. There are currently 20 unit tests for
various features in mert, mira, phrase extraction, and decoding.



\paragraph*{
Regression Testing}


The regression tests ensure that changes to source code do not have unknown consequences
to existing functionality. The regression tests are typically applied to a larger body of work
than unit tests. They are designed to test specific functionality rather than a specific function.
Therefore, regression tests are applied to the actual Moses programs, rather than tested in
isolation.



The regression test framework forms the core of testing within the Moses toolkit. However, it
was created many years ago at the beginning of the Moses project and was only designed to
test the decoder. During the past 6 months, the scope of the regression test framework has
been expanded to test any part of the Moses toolkit, in addition to testing the decoder. The test
are grouped into the following types:

\begin{compactenum}\item Phrase-based decoder

\item Hierarchical/Syntax decoder

\item Mert

\item Rule Extract

\item Phrase-table scoring

\item Miscellaneous, including domain adaptation features, binarizing phrase tables, parallel rule extract, and so forth.

\end{compactenum}
The number of tests has increased from 46 in May 2012 to 73 currently.



We have also overhauled the regression test to make it easier to add new tests. Previously, the
data for the regression tests could only be updated by developers who had access to the web
server at Edinburgh University. This has now been changed so that the data now resides in a
versioned repository on github.com\footnote{\sf https://github.com/moses-smt/moses-regression-tests}.



This can be accessed and changed by any Moses developer, and is subject to the same checks
and controls as the rest of the Moses source code.



Every Moses developer is obliged to ensure the regression test are successfully executed
before they commit their changes to the master repository.



\paragraph*{
Cruise Control}


This is a daily task run on a server at the University of Edinburgh which compiles the Moses source
code and executes the unit tests and regressions tests. Additionally, it also runs a small training
pipeline to completion. The results of this testing is publicly available online\footnote{\sf http://www.statmt.org/moses/cruise/}.



This provides an independent check that all unit tests and regression tests passed, and that the
entirety of the SMT pipeline is working. Therefore, it tests not only the Moses toolkit, but also
external tools such as GIZA++ that are essential to Moses and the wider SMT community.



All failures are investigated by the MosesCore team and any remedial action is taken. This is
done to enforce the testing regime and maintain reliability.



The cruise control is a subproject of Moses initiated by Ales Tamchyna with contribution by
Barry Haddow.



\subsubsection*{
Operating-System Compatibility}


The Moses toolkit has always strived to be compatible on multiple platforms, particularly on the
most popular operating systems used by researchers and commercial users.



Before each release, we make sure that Moses compiles and the unit tests and regression test
successfully runs on various operating systems.



Moses, GIZA++ mgiza, and IRSTLM was compiled for

\begin{compactenum}\item Linux 32-bit

\item Linux 64-bit

\item Cygwin

\item Mac OSX 10.7 64-bit

\end{compactenum}
Effort was made to make the executables runnable on as many platforms as possible.
Therefore, they were statically linked when possible.
Moses was then tested on the following platforms:

\begin{compactenum}\item Windows 7 (32-bit) with Cygwin 6.1

\item Mac OSX 10.7 with MacPorts

\item Ubuntu 12.10, 32 and 64-bit

\item Debian 6.0, 32 and 64-bit

\item Fedora 17, 32 and 64-bit

\item openSUSE 12.2, 32 and 64-bit

\end{compactenum}
All the binary executables are made available for download\footnote{\sf http://www.statmt.org/moses/RELEASE-1.0/binaries/} for users who do not wish to
compile their own version. 



GIZA++, mgiza, and IRSTLM are also available for download as binaries to enable users to run
the entire SMT pipeline without having to download and compile their own software.



Issues:

\begin{compactenum}\item IRSTLM was not linked statically. The 64-bit version fails to execute on Debian 6.0. All other platforms can run the downloaded executables without problem.

\item Mac OSX does not support static linking. Therefore, it is not known if the executables would work on any other platforms, other than the one on which it was tested.

\item mgiza compilation failed on Mac OSX with gcc v4.2. It could only be successfully compilednwith gcc v4.5, available via MacPorts.

\end{compactenum}
\paragraph*{
End-to-End Testing}


Before each Moses release, a number of full scale experiments are run. This is the final test to
ensure that the Moses pipeline can run from beginning to end, uninterrupted, with "real-world"
datasets. The translation quality, as measured by BLEU, is also noted, to ensure that there is no
decrease in performance due to any interaction between components in the pipeline.



This testing takes approximately 2 weeks to run. The following datasets and experiments are
currently used for end-to-end testing:






\begin{compactitem}
\item Europarl en-es: phrase-based, hierarchical

\item Europarl en-es: phrase-based, hierarchical

\item Europarl cs-en: phrase-based, hierarchical

\item Europarl en-cs: phrase-based, hierarchical

\item Europarl de-en: phrase-based, hierarchical, factored German POS, factored German+English POS

\item Europarl en-de: phrase-based, hierarchical, factored German POS, factored German+English POS

\item Europarl fr-en: phrase-based, hierarchical, recased (as opposed to truecased), factored English POS

\item Europarl en-fr: phrase-based, hierarchical, recased (as opposed to truecased), factored English POS

\end{compactitem}

\paragraph*{
Pre-Made Models}


The end-to-end tests produces a large number of tuned models. The models, as well as all
configuration and data files, are made available for download\footnote{\sf http://www.statmt.org/moses/RELEASE-1.0/models/}. This is useful as a template for
users setting up their own experimental environment, or for those who just want the models
without running the experiments.



\subsection{
Release 0.91 (12th October, 2012)}


The code is available in a branch on {\bf github}\footnote{\sf https://github.com/moses-smt/mosesdecoder/tree/RELEASE-0.91}.



This version was tested on 8 Europarl language pairs, phrase-based, hierarchical, and phrase-base factored models. All runs through without major intervention.
Known  issues:

\begin{compactenum}\item Hierarchical models crashes on evaluation when threaded. Strangely, run OK during tuning

\item EMS bugs when specifying multiple language models

\item Complex factored models not tested

\item Hierarchical models with factors does not work

\end{compactenum}
\subsection{
Status 11th July, 2012}


A roundup of the new features that have been implemented in the past year:

\begin{compactenum}\item Lexi Birch's LR score integrated into tuning. Finished coding: YES. Tested: NO. Documented: NO. Developer: Hieu, Lexi. First/Main user: Yvette Graham.

\item Asynchronous, batched LM requests for phrase-based models. Finished coding: YES. Tested: UNKNOWN. Documented: YES. Developer: Oliver Wilson, Miles Osborne. First/Main user: Miles Osborne.

\item Multithreaded tokenizer. Finished coding: YES. Tested: YES. Documented: NO. Developer: Pidong Wang.

\item KB Mira. Finished coding: YES. Tested: YES. Documented: YES. Developer: Colin Cherry.

\item Training \& decoding more resilient to non-printing characters and Moses' reserved characters. Escaping the reserved characters and throwing away lines with non-printing chars. Finished coding: YES. Tested: YES. Documented: NO. Developer: Philipp Koehn and Tom Hoar.

\item Simpler installation. Finished coding: YES. Tested: YES. Documented: YES. Developer: Hieu Hoang. First/Main user: Hieu Hoang.

\item Factors work with chart decoding. Finished coding: YES. Tested: NO. Documented: NO. Developer: Hieu Hoang. First/Main user: Fabienne Braune.

\item Less IO and disk space needed during training. Everything written directly to gz files. Finished coding: YES. Tested: YES. Documented: NO. Developer: Hieu. First/Main user: Hieu.

\item Parallel training. Finished coding: YES. Tested: YES. Documented: YES. Developer: Hieu. First/Main user: Hieu

\item Adam Lopez's suffix array integrated into Moses's training \& decoding. Finished coding: YES. Tested: NO. Documented: YES. Developer: Hieu.

\item Major MERT code cleanup. Finished coding: YES. Tested: NO. Documented: NO. Developer: Tetsuo Kiso.

\item Wrapper for Berkeley parser (german). Finished coding: YES. Tested: UNKNOWN. Documented: UNKNOWN. Developer: Philipp Koehn.

\item Option to use p(RHS\_t$|$RHS\_s,LHS) or p(LHS,RHS\_t$|$RHS\_s), as a grammar rule's direct translation score. Finished coding: YES. Tested: UNKNOWN. Documented: UNKNOWN. Developer: Philip Williams. First/Main user: Philip Williams.

\item Optional PCFG scoring feature for target syntax models. Finished coding: YES. Tested: UNKNOWN. Documented: UNKNOWN. Developer: Philip Williams. First/Main user: Philip Williams.

\item Add {\tt -snt2cooc} option to use mgiza's reduced memory snt2cooc program. Finished coding: YES. Tested: YES. Documented: YES. Developer: Hieu Hoang.

\item {\tt queryOnDiskPt} program. Finished coding: YES. Tested: YES. Documented: NO. Developer: Hieu Hoang. First/Main user: Daniel Schaut.

\item Output phrase segmentation to n-best when {\tt -report-segmentation} is used. Finished coding: YES. Tested: UNKNOWN. Developer: UNKNOWN. First/Main user: Jonathon Clark.

\item CDER and WER metric in tuning. Finished coding: UNKNOWN. Tested: UNKNOWN. Documented: UNKNOWN. Developer: Matous Machacek.

\item Lossy Distributed Hash Table Language Model. Finished coding: UNKNOWN. Tested: UNKNOWN. Documented: UNKNOWN. Developer: Oliver Wilson.

\item Interpolated scorer for MERT. Finished coding: YES. Tested: UNKNOWN. Documented: UNKNOWN. Developer: Matous Machacek.

\item IRST LM training integrated into Moses. Finished coding: YES. Tested: YES. Documented: YES. Developer: Hieu Hoang.

\item GlobalLexiconModel. Finished coding: UNKNOWN. Tested: UNKNOWN. Documented: UNKNOWN. Developer: Jiri Marsik, Christian Buck and Philipp Koehn.

\item TM Combine (translation model combination). Finished coding: YES. Tested: YES. Documented: YES. Developer: Rico Sennrich.

\item Alternative to CKY+ for scope-3 grammar. Reimplementation of Hopkins and Langmead (2010). Finished coding: YES. Tested: UNKNOWN. Documented: UNKNOWN. Developer: Philip Williams.

\item Sample Java client for Moses server. Finished coding: YES. Tested: NO. Documented: NO. Developer: Marwen Azouzi. First/Main user: Mailing list users.

\item Support for mgiza, without having to install GIZA++ as well. Finished coding: YES. Tested: YES. Documented: NO. Developer: Marwen Azouzi.

\item Interpolated language models. Finished coding: YES. Tested: YES. Documented: YES. Developer: Philipp Koehn.

\item Duplicate removal in MERT. Finished coding: YES. Tested: YES. Documented: NO. Developer: Thomas Schoenemann.

\item Use bjam instead of automake to compile. Finished coding: YES. Tested: YES. Documented: YES. Developer: Ken Heafield.

\item Recaser train script updated to support IRSTLM as well. Finished coding: YES. Tested: YES. Documented: YES. Developer: Jehan.

\item {\tt extract-ghkm}. Finished coding: UNKNOWN. Tested: UNKNOWN. Documented: UNKNOWN. Developer: Philip Williams.

\item PRO tuning algorithm. Finished coding: YES. Tested: YES. Documented: YES. Developer: Philipp Koehn and Barry Haddow.

\item Cruise control. Finished coding: YES. Tested: YES. Documented: YES. Developer: Ales Tamchyna.

\item Faster SCFG rule table format. Finished coding: YES. Tested: UNKNOWN. Documented: NO. Developer: Philip Williams.

\item LM OOV feature. Finished coding: YES. Tested: UNKNOWN. Documented: NO. Developer: Barry Haddow and Ken Heafield.

\item TER Scorer in MERT. Finished coding: UNKNOWN. Tested: UNKNOWN. Documented: NO. Developer: Matous Machacek \& Christophe Servan.

\item Multi-threading for decoder \& MERT. Finished coding: YES. Tested: YES. Documented: YES. Developer: Barry Haddow et al.

\item Expose n-gram length as part of LM state calculation.Finished coding: YES. Tested: UNKNOWN. Documented: NO. Developer: Ken Heafield and Marc Legendre.

\item Changes to chart decoder cube pruning: create one cube per dotted rule instead of one per translation. Finished coding: YES. Tested: YES. Documented: NO. Developer: Philip Williams.

\item Syntactic LM. Finished coding: YES. Tested: YES. Documented: YES. Developer: Lane Schwartz.

\item Czech detokenization. Finished coding: YES. Tested: UNKNOWN. Documented: UNKNOWN. Developer: Ondrej Bojar.

\end{compactenum}
\subsection{
Status 13th August, 2010}


Changes since the last status report:

\begin{compactenum}\item change or delete character Ø to 0 in extract-rules.cpp (Raphael and Hieu Hoang)

\end{compactenum}
\subsection{
Status 9th August, 2010}


Changes since the last status report:

\begin{compactenum}\item Add option of retaining alignment information in the phrase-based phrase table. Decoder loads this information if present. (Hieu Hoang \& Raphael Payen)

\item When extracting rules, if the source or target syntax contains an unsupported escape sequence (anything other than "$<$", "$>$", "\&", "\&apos", and "\&quot") then write a warning message and skip the sentence pair (instead of asserting).

\item In bootstrap-hypothesis-difference-significance.pl, calculates the p-value and confidence intervals not only using BLEU, but also the NIST score. (Mark Fishel)

\item Dynamic Suffix Arrays (Abby Levenberg)

\item Merge multi-threaded Moses into Moses (Barry Haddow)

\item Continue partial translation (Ondrej Bojar and Ondrej Odchazel)

\item Bug fixes, minor bits \& bobs. (Philipp Koehn, Christian Hardmeier, Hieu Hoang, Barry Haddow, Philip Williams, Ondrej Bojar, Abbey, Mark Mishel, Lane Schwartz, Nicola  Bertoldi, Raphael, ...) 

\end{compactenum}
\subsection{
Status 26th April, 2010}


Changes since the last status report:

\begin{compactenum}\item Synchronous CFG based decoding, a la Hiero (Chiang 2005), plus with syntax. And all the scripts to go with it. (Thanks to Philip Williams and Hieu Hoang)

\item caching clearing in IRST LM (Nicola Bertoldi)

\item Factored Language Model. (Ondrej Bojar)

\item Fixes to lattice (Christian Hardmeier, Arianna Bisazza, Suzy Howlett)

\item zmert (Ondrej Bojar)

\item Suffix arrays (Abby Levenberg)

\item Lattice MBR and consensus decoding (Barry Haddow and Abhishek Arun)

\item Simple program that illustrates how to access a phrase table on disk from an external program (Felipe Sánchez-Martínez)

\item Odds and sods by Raphael Payen and Sara Stymne.

\end{compactenum}
\subsection{
Status 1st April, 2010}


Changes since the last status report:

\begin{compactenum}\item Fix for Visual Studio, and potentially other compilers (thanks to Barry, Christian, Hieu)

\item Memory leak in unique n-best fixed (thanks to Barry)

\item Makefile fix for Moses server (thanks to Barry)

\end{compactenum}
\subsection{
Status 26th March, 2010}


Changes since the last status report:

\begin{compactenum}\item Minor bug fixes \& tweaks, especially to the decoder, MERT scripts  (thanks to too many people to mention)

\item Fixes to make decoder compile with most versions of gcc, Visual studio and other compilers (thanks to Tom Hoar, Jean-Bapist Fouet).

\item Multi-threaded decoder (thanks to Barry Haddow)

\item Update for IRSTLM (thanks to Nicola Bertoldi and Marcello Federico)

\item Run mert on a subset of features (thanks to Nicola Bertoldi)

\item Training using different alignment models (thanks to Mark Fishel)

\item "A handy script to get many translations from Google" (thanks to  Ondrej Bojar)

\item Lattice MBR (thanks to Abhishek Arun and Barry Haddow)

\item Option to compile Moses as a dynamic library (thanks to Jean-Bapist Fouet).

\item Hierarchical re-ordering model (thanks to Christian Harmeier,  Sara Styme, Nadi, Marcello, Ankit Srivastava, Gabriele Antonio Musillo, Philip Williams, Barry Haddow).

\item Global Lexical re-ordering model (thanks to Philipp Koehn)

\item Experiment.perl scripts for automating the whole MT pipeline (thanks to Philipp Koehn) 

\end{compactenum}
\section{
Work in Progress}

Refer to the website ({\sf http://www2.statmt.org/moses/?n=Moses.Releases})