<?xml version="1.0" standalone="yes"?>
<Paper uid="P99-1079">
  <Title>Analysis of Syntax-Based Pronoun Resolution Methods</Title>
  <Section position="3" start_page="0" end_page="0" type="intro">
    <SectionTitle>
1Henceforth BFP
</SectionTitle>
    <Paragraph position="0"> algorithms by hand is that it is time consuming and difficult to process corpora that are large enough to provide reliable, broadly based statistics. By creating a system that can run algorithms, one can easily and quickly analyze large amounts of data and generate more reliable results. In this project, the new algorithm is tested against three leading syntax-based pronoun resolution methods: Hobbs' naive algorithm (1977), S-list (Strube 1998), and BFP.</Paragraph>
    <Paragraph position="1"> Section 2 presents the motivation and algorithm for Left-Right Centering. In Section 3, the results of the algorithms are presented and then discussed in Section 4.</Paragraph>
  </Section>
class="xml-element"></Paper>