<?xml version="1.0" standalone="yes"?>
<Paper uid="C94-2145">
  <Title>ON TIIE PORTABILITY OF COMPLEX CONSTRAINT-BASED GRAMMARS</Title>
  <Section position="6" start_page="903" end_page="903" type="concl">
    <SectionTitle>
5 Conclusion
</SectionTitle>
    <Paragraph position="0"> We readily admit that the experiments reported here are still quite unscientific -- or, we would prefer to think, prescientific and we are still feeling our way towards a more rigorous approach to the question of comparability of implemented formalisms, even though the task is noticeably simplified by recent convergence of goals and methods in constraint-ba.sed computational linguistics.</Paragraph>
    <Paragraph position="1"> Nonetheless, our experience already suggests, in keeping with \[Arnold et al., 1993\], that from the point of view of relative expressivity it is possible to move grammars from one formalism to another, and even perhaps to conceive of new grammars which arc designed from the start to be portable across a range of related formalisms.</Paragraph>
    <Paragraph position="2"> As regards the set of issues which we have classed to~ gethcr under the heading of performance, on the other hand, there are still many open questions whicb need to be addressed before porting grammars to serious, extensible and maintainable applications can become a realistic enterprise.</Paragraph>
  </Section>
class="xml-element"></Paper>