<?xml version="1.0" standalone="yes"?>
<Paper uid="W06-1627">
  <Title>Efficient Search for Inversion Transduction Grammar</Title>
  <Section position="2" start_page="0" end_page="0" type="abstr">
    <SectionTitle>
Abstract
</SectionTitle>
    <Paragraph position="0"> We develop admissible A* search heuristics for synchronous parsing with Inversion Transduction Grammar, and present results both for bitext alignment and for machine translation decoding. We also combine the dynamic programming hook trick with A* search for decoding. These techniques make it possible to nd optimal alignments much more quickly, and make it possible to nd optimal translations for the rst time. Even in the presence of pruning, we are able to achieve higher BLEU scores with the same amount of computation.</Paragraph>
  </Section>
class="xml-element"></Paper>