<?xml version="1.0" standalone="yes"?>
<Paper uid="E87-1036">
  <Title>Buitding Expert Systems. Addison-Wesley Publishing</Title>
  <Section position="9" start_page="224" end_page="224" type="concl">
    <SectionTitle>
5 CONCLUSION
</SectionTitle>
    <Paragraph position="0"> In our system linguistic knowledge and processing mechanisms are separated. Structural information of the functional schemata is interpreted by the blackboard scheduler as control knowledge, according to which dependencies are searched. The difference between local and global decisions is clearly separated. Locat decisions controlled by global knowledge of the input sentence has made it possible to find solutions for problems that are difficult to solve in traditional parsing systems. ADP finds all solutions for an ambiguous sentence. Augmented search process covers tong-distance dependencies as well.</Paragraph>
    <Paragraph position="1"> Different criteria have been expressed for grammar formalisms (Winogrsd 1983, Karttunen 1986a): perspicuity, nondirectionstity, correspondence with meanings, multiple dimensions of patterning, order-independency, declarativeness and monotontc~ty.</Paragraph>
    <Paragraph position="2"> Our model rates welt in most of these criteria.</Paragraph>
    <Paragraph position="3"> Perspicuity, correspondence with meanings and dectarsttveness are satisfied in the way the functional schemata describe local environments for regents. The functional description is monotonic and allows multiple dimensions of patterning.</Paragraph>
    <Paragraph position="4"> There is s process of parsing as s starting point in the grammar specification, so it lacks nondirectionatity. The weakest point is the order-dependent control mechanism, albeit the grammar description is order-lndependent. Plans for the general, order-independent control strategy have been done.</Paragraph>
    <Paragraph position="5"> ADP has been implemented in FranzLisp. Experiments w~tn a non-trivial set of Finnish sentence structures has been performed on VAX 11/751 system. An average time for parsing a six word sentence is between 0.5 and 2.0 seconds for the first parse. At the moment the grammar description contains common sentence structures quite well. There are 66 binary relations, 188 functional schemata and 1800 lexicon entries. The lexicon of the morphological analyzer contains 35 000 words.</Paragraph>
    <Paragraph position="6"> ACKNOWLEDGENENT$ This research has been supported by SlTRA Foundation.</Paragraph>
  </Section>
class="xml-element"></Paper>