<?xml version="1.0" standalone="yes"?>
<Paper uid="C96-1019">
  <Title>Connectivity in Bag Generation</Title>
  <Section position="7" start_page="103" end_page="103" type="evalu">
    <SectionTitle>
5 Results
</SectionTitle>
    <Paragraph position="0"> The abow~' pruning tcchnique has been tested on bags of different sizes including different combinatkms of modifiers. Sentences were generated using two versions of a modified chart parser. In one, ew'.ry inactive edge constructed was added to the chart. In the. other, every inactive edge was tested to see if it led to a disconnected graph; if it did, then the edge was discarded. The results of the experiment are shown in Table 1. The implementation was in Prolog on a Sun SpareS|at|on 10; the generation timings do not include garbage collection time. The grammar used for the experiment consisted of simplified, feature-based versions of the 11) rules in GPSG; there were 18 rules and 50 lexical entries. Compilation of the outer domains for these rules took apt)roximately 37 minutes, and the resulting set occupies 40K of men&gt; ory. In the general case, however, tile size of the outer domains is O(n2), where n is the number of distinct signs; this number can be controlled by employing equivalence classes of different levels of specificity for pre-terminal and non-terminal signs.</Paragraph>
    <Paragraph position="1">  Only one reading was generated for each bag, corresponding to one attachment site for PPs.</Paragraph>
    <Paragraph position="2"> 'l'he tMJe shows that the technique ctm yieht reductions in the number of edges (both active aud inactive) and time taken, especially for longer sentences, while retaining the overheads at an acceptable level.</Paragraph>
  </Section>
class="xml-element"></Paper>