<?xml version="1.0" standalone="yes"?>
<Paper uid="P04-1031">
  <Title>Balancing Clarity and Efficiency in Typed Feature Logic through Delaying</Title>
  <Section position="4" start_page="0" end_page="0" type="concl">
    <SectionTitle>
5 Conclusion
</SectionTitle>
    <Paragraph position="0"> It has been shown that a simple generalization of conventional delay statements to LTFS, combined with a subsumption-based interpretation of implicational constraints and unique feature introduction are sufficient to restore much of the functionality and concomitant benefit that has been routinely sacrificed in HPSG in the name of parsing efficiency.</Paragraph>
    <Paragraph position="1"> While a definitive measurement of the computational cost of this functionality has yet to emerge, there is at least no apparent indication from the experiments that we can conduct that disjunction, complex antecedents and/or a judicious use of recursion pose a significant obstacle to tractable grammar design when the right control strategy (CLP with subsumption testing) is adopted.</Paragraph>
  </Section>
class="xml-element"></Paper>