<?xml version="1.0" standalone="yes"?>
<Paper uid="P88-1013">
  <Title>PROJECT APRIL -- A PROGRESS REPORT</Title>
  <Section position="1" start_page="0" end_page="0" type="abstr">
    <SectionTitle>
ABSTRACT
</SectionTitle>
    <Paragraph position="0"> Parsing techniques based on rules defining grammaticality are difficult to use with authentic inputs, which are often grammatically messy.</Paragraph>
    <Paragraph position="1"> Instead, the APRIL system seeks a labelled tree su~cture which maximizes a numerical measure of conformity to statistical norms derived flom a sample of parsed text. No distinction between legal and illegal trees arises: any labelled tree has a value. Because the search space is large and has an irregular geometry, APRIL seeks the best tree using simulated annealing, a stochastic optimization technique. Beginning with an arbi-Irary tree, many randomly-generated local modifications are considered and adopted or rejected according to their effect on tree-value: acceptance decisions are made probabilistically, subject to a bias against advexse moves which is very weak at the outset but is made to increase as the random walk through the search space continues. This enables the system to converge on the global optimum without getting trapped in local optima. Performance of an early version of the APRIL system on authentic inputs is yielding analyses with a mean accuracy of 75.3% using a schedule which increases processing linearly with sentence-length; modifications currently being implemented should eliminate a high proportion of the remaining errors.</Paragraph>
  </Section>
class="xml-element"></Paper>