<?xml version="1.0" standalone="yes"?>
<Paper uid="C00-2149">
  <Title>Context-Free Grammar Rewriting and the Transfer of Packed Linguistic Representations</Title>
  <Section position="6" start_page="1019" end_page="1019" type="concl">
    <SectionTitle>
7 Conclusion
</SectionTitle>
    <Paragraph position="0"> We have presented a model and an algorithm for the transfer of packed linguistic representations based on the view that: (1) packed representations are best seen as context-free grammars over graph description elements, an approach which permits factorization of common parts while maintaining a transparent, easily computable, relationship to the set of structures represented (interaction-freeness, countability) 4, and (2) transfer is a rewriting process that takes as input such a context-free representation and that outputs a target context-free 4properties that we believe are essential to all such representations, whether they are made explicit or not.</Paragraph>
    <Paragraph position="1"> representation which maintains these beneficial propertics. Although proofs have not been provided here, the algorithm can be shown to satisfy our initial formal definition of transfer as nondcterministic, exhaustive, non-overlapping replacement of description elements in the source structure by their counterparts as specilied in the rewriting rules. Tim method described in this paper bears some obvious analogy to the classical problem of mapping a context-free language into another context-fi'ee language by way of a finite-state transducer (Harrison, 1978). It would be an interesting research question to make this analogy formal, the main difference here being the need to work with a commutative concatenation, as opposed to the standard non-commutative concatenation which is more directly connected with the automaton view of transductions.</Paragraph>
  </Section>
class="xml-element"></Paper>