<?xml version="1.0" standalone="yes"?>
<Paper uid="P98-2154">
  <Title>Translating a Unification Grammar with Disjunctions into Logical Constraints</Title>
  <Section position="7" start_page="936" end_page="937" type="evalu">
    <SectionTitle>
5 Experiment
</SectionTitle>
    <Paragraph position="0"> The advantage of this method compared to the previous methods is that it can translate without expanding disjunctions. To show this, we compared the time taken for two analyses: the first using a grammar translated  into terms after expanding disjunctions 6 and the second using a grammar translated without expanding disjunctions through our method. The computation times were measured using a bottom-up chart parser (Kay, 1980) in Allegro Common Lisp 4.3 running on Digital Unix</Paragraph>
    <Section position="1" start_page="937" end_page="937" type="sub_section">
      <SectionTitle>
3.2 on DEC Alpha station 500/333MHz. It employs
</SectionTitle>
      <Paragraph position="0"> constraint projection (Nakano, 1991) as an efficient constraint transformation method. We measured the time for computing all parses. We used a Japanese grammar based on Japanese Phrase Structure Grammar (JPSG) (Gunji, 1987) that covers fundamental grammatical constructions of Japanese sentences. For all of 21 example sentences (5 to 16 words), the time taken for analysis using the grammar translated without disjunction expansion was shorter (43% to 72%). This demonstrates the advantage of our method.</Paragraph>
    </Section>
  </Section>
class="xml-element"></Paper>