<?xml version="1.0" standalone="yes"?>
<Paper uid="P99-1012">
  <Title>Preserving Semantic Dependencies in Synchronous Tree Adjoining Grammar*</Title>
  <Section position="7" start_page="94" end_page="94" type="concl">
    <SectionTitle>
5 Conclusion
</SectionTitle>
    <Paragraph position="0"> We have presented two algorithms - one for interpreting a derivation forest as a semantic dependency graph, and the other for realizing a semantic dependency graph as a derivation forest - that make use of semantic dependencies as adapted from the notion of predicate-argument attachment in (Joshi and Vijay-Shanker, 1999), and we have described how these algorithms can be run together in a synchronous TAG translation system, in CO(n 7) time, using transfer rules predicated on isomorphic or locally non-isomorphic dependency graphs rather than isomorphic or locally non-isomorphic derivation trees. We have also demonstrated how such a system would be necessary in translating a real-world example that is isomorphic on dependency graphs but globally non-isomorphic on derivation trees. This system is currently being implemented as part of the Xtag project at the University of Pennsylvania, and as natural language interface in the Human Modeling and Simulation project, also at Penn.</Paragraph>
  </Section>
class="xml-element"></Paper>