<?xml version="1.0" standalone="yes"?>
<Paper uid="W91-0110">
  <Title>I \[ A Uniform Architecture for Parsing, Generation and Transfer</Title>
  <Section position="7" start_page="78" end_page="78" type="ackno">
    <SectionTitle>
I
</SectionTitle>
    <Paragraph position="0"> constraint evaluation scheme is directly derived from the semantics of typed feature structures.</Paragraph>
    <Paragraph position="1"> Thus, the TFS i language allows a direct implementation of reyersible unification grammars. Of course, it does not dispense the grammar designer with the proof O f general formal properties that any well-behaved grammar should have, but it does allow the grammar writer to develop grammars without thinking about any notion of control or input/output: distinction.</Paragraph>
  </Section>
class="xml-element"></Paper>