<?xml version="1.0" standalone="yes"?>
<Paper uid="W98-1422">
  <Title>Fully Lexicalized Head-Driven Syntactic Generation</Title>
  <Section position="6" start_page="215" end_page="215" type="concl">
    <SectionTitle>
7 Current Work
</SectionTitle>
    <Paragraph position="0"> In general, the task of finding appropriate elementary trees for the chosen words and consequently a consistent phrase structure tree can exhibit constraints between an), two elementary trees in the utterance (as expressed through feature equations). *However, most of these constraints exist between elementary trees that are combined directly with each other (adjoined or substituted). To exploit thiSi we are currently experimenting with various well established binary constraint-solving algorithms to preselect elementary trees that are pairwise consistent w.r.t, feature equations.</Paragraph>
  </Section>
class="xml-element"></Paper>