<?xml version="1.0" standalone="yes"?>
<Paper uid="J80-1003">
  <Title>Slot Grammars</Title>
  <Section position="12" start_page="0" end_page="0" type="concl">
    <SectionTitle>
9. Summary
</SectionTitle>
    <Paragraph position="0"> We have offered a grammatical system and parser organized around slots and slot-filling, with a constrained use of states. The parser is driven by the maintenance of the available slots list, ASLOTS, consisting of those slots that may yet be filled. Two advantages of this were emphasized. One is that ASLOTS permits the expression of dependency relations in a natural and direct way. The other is that ASLOTS serves as the vehicle for the raising operation, which appears to be applicable to several grammatical constructions, such as WH-movement.</Paragraph>
    <Paragraph position="1"> The parser is bottom-up and phrases are constructed middle-out from their head words. This scheme is instrumental for both of the above advantages of ASLOTS. First, the dependency information associated with head words in the lexicon helps initialize ASLOTS appropriately. Second, middle-out construction is appropriate because raised slots might be filled on the left or the right.</Paragraph>
    <Paragraph position="2"> The system seems to represent a good combination of data-directed and goal-directed processing. The actual lexical data in the sentence not only influence the initialization of ASLOTS lists, but also control whatever agreement checks may be necessary (such as subject-verb agreement and morphological requirements of auxiliaries). Once the ASLOTS list of a phrase frame is determined, it forms a direct and central expression of goals for filling out the frame.</Paragraph>
  </Section>
class="xml-element"></Paper>