<?xml version="1.0" standalone="yes"?>
<Paper uid="C04-1091">
  <Title>An Algorithmic Framework for the Decoding Problem in Statistical Machine Translation</Title>
  <Section position="11" start_page="0" end_page="0" type="concl">
    <SectionTitle>
6 Conclusions
</SectionTitle>
    <Paragraph position="0"> The algorithmic framework developed in this paper is powerful as it yields several decoding algorithms. At one end of the spectrum is a provably linear time algorithm for computing a suboptimal solution and at the other end is an exponential time algorithm for computing  the optimal solution. We have also shown that alternating maximization can be employed to come up with Oparenleftbigm2parenrightbig decoding algorithm. Two questions in this connection are:  1. Is it possible to reduce the complexity of AlternatingSearch to O(m)? 2. Instead of exploring each alignment  separately, is it possible to explore a bunch of alignments in one shot? Answers to these questions will result in faster and more efficient decoding algorithms.</Paragraph>
  </Section>
class="xml-element"></Paper>