<?xml version="1.0" standalone="yes"?>
<Paper uid="C90-1002">
  <Title>Information ,and Computer Science Department King Fahd University of Petroleum and Minerals T Dhahran 31261 Kingdom of Saudi Aa'abia</Title>
  <Section position="4" start_page="0" end_page="0" type="ackno">
    <SectionTitle>
6. Summary
</SectionTitle>
    <Paragraph position="0"> Our hybrid deterministic parser is based on a deterministic grammar modified slightly from that found in traditional systems. Our grammar is derived from one used by Marcus, but with much inspiration from the work of Milne, Berwick, and Chamiak. The rules of the grammar are utilized in training a connectionist component. The result is a hybrid system which exhibits characteristics from several well-known extensions of the basic deterministic parser. In particular, some ungrammatical and lexically ambiguous inputs can be successfully processed although no special provisions are made for them. These extended properties come essentially for free due to the coupling of a symbolic component with connectionism.</Paragraph>
  </Section>
class="xml-element"></Paper>