<?xml version="1.0" standalone="yes"?>
<Paper uid="P02-1062">
  <Title>Ranking Algorithms for Named-Entity Extraction: Boosting and the Voted Perceptron</Title>
  <Section position="1" start_page="0" end_page="0" type="abstr">
    <SectionTitle>
Abstract
</SectionTitle>
    <Paragraph position="0"> This paper describes algorithms which rerank the top N hypotheses from a maximum-entropy tagger, the application being the recovery of named-entity boundaries in a corpus of web data. The first approach uses a boosting algorithm for ranking problems. The second approach uses the voted perceptron algorithm. Both algorithms give comparable, significant improvements over the maximum-entropy baseline. The voted perceptron algorithm can be considerably more efficient to train, at some cost in computation on test examples.</Paragraph>
  </Section>
class="xml-element"></Paper>