<?xml version="1.0" standalone="yes"?>
<Paper uid="E85-1007">
  <Title>SAUMER: SENTENCE ANALYSIS USING METARULES</Title>
  <Section position="9" start_page="54" end_page="54" type="concl">
    <SectionTitle>
7. CONCLUSIONS
</SectionTitle>
    <Paragraph position="0"> SSL appears to adequately capture the flavour of GPSG descriptions while allowing more procedural control.</Paragraph>
    <Paragraph position="1"> Investigation into a relationship between SSL and GPSG grammars could result in a method for translating GPSG grammars into SSL for execution by SAUMER. Further research could also provide a relationship between SSL and other grammar formalisms, such as /ex/c~-funct/on,d granmu~$ (Kaplan and Bresnan. 1982). The prolog implementation of SAUMER. allowing left recursion in rules, should facilitate a more detailed study of the specification language, and of some problems associated with metarule specifications. Due to the easy separability of the semantic rules, one could attempt to introduce a more database oriented semantic notation and develop an interface to a real database. One could then examine system behaviour with a larger rule base and more involved transi'ormations in an applications environment like that of the AAA. However. as is apparent from the application presented here and from preliminary experimentation (Popowich. 1984) (Popowich. 1985), further investigation of the efficient operation of this Prolog implementation with large grammars will be required.</Paragraph>
  </Section>
class="xml-element"></Paper>