<?xml version="1.0" standalone="yes"?>
<Paper uid="P89-1027">
  <Title>TREATMENT OF LONG DISTANCE DEPENDENCIES IN LFG AND TAG: FUNCTIONAL UNCERTAINTY IN LFG IS A COROLLARY IN TAG&amp;quot;</Title>
  <Section position="15" start_page="225" end_page="226" type="concl">
    <SectionTitle>
5 CONCLUSION
</SectionTitle>
    <Paragraph position="0"> We have shown that for the treatment of long distance dependencies in TAG, the functional un- null certainty machinery in LFG is redundant. We have also shown that the analyses provided by the functional uncertainty machinery can be obtained without going beyond the power of mildly context-sensitive grammars. We have briefly discussed some linguistic and computational aspects of these results.</Paragraph>
    <Paragraph position="1"> We believe that our results described in this paper can be extended to other formalisms, such as Combinatory Categorial Grammars (CCG), which also provide an e~ended domain of locality. It is of particular interest to carry out this investigation in the context of CCG because of their weak equivalence to TAG (Weir and Joshi \[12\]). This exploration will help us view this equivalence from the structural point of view.</Paragraph>
  </Section>
class="xml-element"></Paper>