<?xml version="1.0" standalone="yes"?>
<Paper uid="W06-1501">
  <Title>References</Title>
  <Section position="8" start_page="5" end_page="5" type="concl">
    <SectionTitle>
7 Conclusion
</SectionTitle>
    <Paragraph position="0"> We have presented a new probabilistic synchronous TAG formalism, synchronous Tree Substitution Grammar with sister adjunction (TSG+SA). We have introduced the concept of a hidden TAG model, analogous to a Hidden Markov Model. It allows us to parse a resource-poor language using a treebank-extracted probabilistic grammar for a resource-rich language, along with a hand-crafted synchronous grammar for the resource-poor language. Thus, our model combines statistical approaches with grammar engineering (speci cally motivated from the linguistic facts). Our approach thus exempli es the speci c strength of a grammar-based approach.</Paragraph>
    <Paragraph position="1"> While we have applied this approach to two closely related languages, it would be interesting to apply this approach to more distantly related languages in the future.</Paragraph>
  </Section>
class="xml-element"></Paper>