<?xml version="1.0" standalone="yes"?>
<Paper uid="P98-2190">
  <Title>Conditions on Consistency of Probabilistic Tree Adjoining Grammars*</Title>
  <Section position="7" start_page="1168" end_page="1168" type="concl">
    <SectionTitle>
6 Conclusion
</SectionTitle>
    <Paragraph position="0"> We have shown in this paper the conditions under which a given probabilistic TAG can be shown to be consistent. We gave a simple algorithm for checking consistency and gave the formal justification for its correctness. The result is practically significant for its applications in checking for deficiency in probabilistic TAGs.</Paragraph>
  </Section>
class="xml-element"></Paper>