Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 233

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Ranking algorithms for named-entity extraction: boosting and the voted perceptron

Open access
Collins, Michael·2001·Proceedings of the 40th Annual Meeting on Association for Computational Linguistics - ACL '02

Abstract

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.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.3115/1073083.1073165

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cited by

See all 233

Metadata

Authors
Collins, M.
Venue
Proceedings of the 40th Annual Meeting on Association for Computational Linguistics - ACL '02
Published
2001
Pages
489
OpenAlex
W2144087279
Cited by
233
References
1
FWCI
5.58
Type
conference paper
Language
en
Open access
bronze

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Ranking algorithms for named-entity extraction: boosting and the voted perceptron. https://app.cochat.ai/papers/10.3115/1073083.1073165
The paper
Collins, M. (2001). Ranking algorithms for named-entity extraction: boosting and the voted perceptron. Proceedings of the 40th Annual Meeting on Association for Computational Linguistics - ACL '02. https://doi.org/10.3115/1073083.1073165

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.