<?xml version="1.0" standalone="yes"?>
<Paper uid="P98-2154">
  <Title>Translating a Unification Grammar with Disjunctions into Logical Constraints</Title>
  <Section position="1" start_page="0" end_page="0" type="abstr">
    <SectionTitle>
Abstract
</SectionTitle>
    <Paragraph position="0"> This paper proposes a method for generating a logical-constraint-based internal representation from a unification grammar formalism with disjunctive information.</Paragraph>
    <Paragraph position="1"> Unification grammar formalisms based on path equations and lists of pairs of labels and values are better than those based on first-order terms in that the former is easier to describe and to understand. Parsing with term-based internal representations is more efficient than parsing with graph-based representations. Therefore, it is effective to translate unification grammar formalism based on path equations and lists of pairs of labels and values into a term-based internal representation. Previous translation methods cannot deal with disjunctive feature descriptions, which reduce redundancies in the grammar and make parsing efficient. Since the proposed method translates a formalism without expanding disjunctions, parsing with the resulting representation is efficient.</Paragraph>
  </Section>
class="xml-element"></Paper>