In order to obtain a polynomial parsing algorithm , we need to avoid this effect.

The algorithm can be easily converted into a parsing algorithm .

The basic idea is to use a parsing algorithm for TAG, and impose on-the-fly additional restrictions on the underlying derivation trees that are being constructed, in order to fulfill the definition of valid TT-MCTAG derivation.

is crucial for the polynomial parsing algorithm .

For our parsing algorithm , we want to avoid grouping the instances of elementary trees in a derivation tree into tuple instances.

may sometimes appear too computa-tionally expensive for high-end statistical machine translation, there are many alternative parsing algorithms that have seldom been explored in the machine translation literature.

(2005b) present a quadratic-time dependency parsing algorithm that is just 0.7% less accurate than “full-fledged” chart parsing (which, in the case of dependency parsing, runs in time 0(n3) (Eisner, 1996)).

dency structure is built as a byproduct of phrase-based decoding, without reliance on a dynamic-programming or chart parsing algorithm such as CKY or Earley.

model score computed with the dependency parsing algorithm described in Section 2.