<?xml version="1.0" standalone="yes"?>
<Paper uid="P89-1002">
  <Title>A Semantic-Head-Driven Generation Algorithm for Unification-Based Formalisms</Title>
  <Section position="10" start_page="15" end_page="15" type="concl">
    <SectionTitle>
7 Further Research
</SectionTitle>
    <Paragraph position="0"> Further enhancements to the algorithm are envisioned. First, any system making use of a tabular link predicate over complex nonterminals (like the chained_nodes predicate used by the generation algorithm and including the link predicate used ill the BUP parser (Matsumoto et al., 1983)) is subject to a problem of spurious redundancy in processing if the elements in the link table are not mutually exclusive. For instance, a single chain rule might be considered to be applicable twice because of the nondeterminism of the call to chained_nodes. This general problem has to date received little attention, and no satisfactory solution is found in the logic grammar literature.</Paragraph>
    <Paragraph position="1"> More generally, the backtracking regimen of our implementation of the algorithm may lead to re-computation of results. Again, this is a general property of backtrack methods and is not particular to our application. The use of dynamic programming techniques, as in chart parsing, would be an appropriate augmentation to the implementation of the algorithm. Happily, such an augmentation would serve to eliminate the redundancy caused by the linking relation as well.</Paragraph>
    <Paragraph position="2"> Finally, in order to incorporate a general facility for auxiliary conditions in rules, some sort of delayed evaluation triggered by appropriate instantiation (e.g., wait declarations (Nalsh, 1986)) would be desirable. None of these changes, however, constitutes restructuring of the algorithm; rather they modify its realization in significant and important ways.</Paragraph>
  </Section>
class="xml-element"></Paper>