Elamur Research⌕
☰
home / papers / 2003 / Named Entity Recognition through Classifier Combination

Named Entity Recognition through Classifier Combination

Summary

The paper addresses named entity recognition for the CoNLL-2003 shared task in English and German. Its approach is to merge several statistical taggers that differ in how they make decisions. Four classifiers are used: RRM (a regularized winnow method), MaxEnt, fnTBL (transformation-based learning in a boundary-then-classification setup) and an HMM in the style of Bikel et al. The HMM is dropped for German. All of them label words by their position inside an entity and share a rich feature set: word windows, lemmas, POS tags, chunks, affixes and word-shape flags. The authors compare several combination schemes: equal voting, weighted voting, two linear-interpolation models whose parameters are estimated by 5-fold cross-classification, and RRM used as a meta-learner. Using only training-data features, combination lifts English development F from about 89.9 to about 91.6, roughly a 17% error reduction. When gazetteers and outputs of external NE taggers are added, the RRM combiner reaches 93.9 on English development data. German gains less, because its data is sparser. The work shows that diverse learners plus a learned combiner can absorb many information sources.

Key points

  • Individual classifiers on English (dev/test F):
    • HMM: 82.0 / 74.6
    • fnTBL: 88.1 / 81.2
    • MaxEnt: 90.8 / 85.6
    • RRM: 92.1 / 85.5
  • Combination results on English dev without gazetteers (best single classifier at 89.94 F):
    • equal voting: about 91.0, averaged over 30 random tie-breaking trials
    • weighted voting: 91.56
    • Model 1, using P(C|w): 90.9
    • Model 2, using P(C|C_i): 91.64
    • RRM combiner: 91.63
  • Extra resources:
    • English: gazetteers of 50,000 cities, 80,000 proper names and 3,500 organizations, plus two IBM NE taggers trained on 1.7M words with 32 categories.
    • With these, the RRM combiner reaches 93.9 F on English dev (about 21% error reduction), while Model 2 manages only 92.4.
  • Final overall F:
    • English: 93.87 dev, 88.76 test
    • German: 71.51 dev, 72.41 test
    • German recall is weak, with MISC recall around 42%.
  • German specifics:
    • The rate of unknown words is about double that of English.
    • Capitalization is a weak cue, since all German nouns are capitalized.
    • A small gazetteer collected by hand in about two person-hours added roughly 1.5 F on testa and 0.6 F on testb.

Interesting ideas

  • I1. Choose ensemble members for diversity along several axes. The authors pick learners that differ in decision style (few discriminant features vs. all features), in how they handle sparseness, in their search strategy, and in their output type. This is a useful checklist when building any ensemble, because members that disagree in different ways leave more room for gains.
  • I2. Train the combiner on cross-classified outputs. Each base model is trained on four fifths of the training data and tags the remaining fifth, so the combiner learns from realistic, non-overfit predictions. This trick transfers to any stacking setup where training data is limited.
  • I3. Let votes carry partial credit. Instead of a hard vote, each classifier's output is mapped to a distribution over the true class, P(C|C_i). This captures systematic confusions between classes and beat plain voting here.
  • I4. Use a strong learner as the meta-combiner. Feeding base outputs, POS/chunk tags, gazetteers and external taggers into RRM integrated heterogeneous sources far better than linear interpolation. This suggests a learned combiner when many weak signals must be merged.
  • I5. Small hand-built gazetteers can pay off. A list assembled in a couple of hours gave measurable gains for German. Cheap lexical resources of this kind are worth trying for lower-resource languages such as Ukrainian.

Our summary of the paper, in our own words — not its text. The work belongs to its authors; read it at the links above.

Fields: Linguistics & languages

Topics: Named entity recognition · Part-of-speech tagging

Cited by

85 papers of our library cite it (of the 140673 whose bibliographies we read); 4 of them have a page here, 81 not yet.

Cite

The paper itself, not this page. BibTeX from the library's record of the work.

@inproceedings{florian2003named,
  title = {{Named Entity Recognition through Classifier Combination}},
  author = {Florian, Radu and Ittycheriah, Abe and Jing, Hongyan and Zhang, Tong},
  booktitle = {Proceedings of the Seventh Conference on Natural Language Learning at HLT-NAACL 2003},
  year = {2003},
  doi = {10.3115/1119176.1119201},
  url = {https://doi.org/10.3115/1119176.1119201}
}

References

15 references, 2 of them with a card of ours. ↗ leads to the work, «find» searches for one we have no id for yet.

  1. A. Berger, S. Della Pietra, and V. Della Pietra. 1996. A maximum entropy approach to natural language processing. Computational Linguistics, 22(1):39–71. find our card
  2. Daniel M. Bikel, Richard L. Schwartz, and Ralph M. Weischedel. 1999. An algorithm that learns what’s in a name. Machine Learning, 34(1-3):211–231. find
  3. A. Borthwick. 1999. A Maximum Entropy Approach to Named Entity Recognition. Ph.D. thesis, New York University. find
  4. E. Brill. 1995. Transformation-based error-driven learning and natural language processing: A case study in part of speech tagging. Computational Linguistics, 21(4):543–565. find our card
  5. J. N. Darroch and D. Ratcliff. 1972. Generalized iterative scaling for log-linear models. The Annals of Mathematical Statistics, 43(5):1470–1480. find
  6. R. Florian and G. Ngai, 2001. Fast Transformation-Based Learning Toolkit. Johns Hopkins University, http://nlp.cs.jhu.edu/˜rflorian/fntbl/documentation.html. ↗
  7. R. Florian. 2002a. Named entity recognition as a house of cards: Classifier stacking. In Proceedings of CoNLL-2002, pages 175–178. find
  8. R. Florian. 2002b. Transformation Based Learning and Data-Driven Lexical Disambiguation: Syntactic and Semantic Ambiguity Resolution. Ph.D. thesis, Johns Hopkins University. Chapter 5.3, pages 135–142. find
  9. English devel. LOC MISC ORG PER overall Precision 96.59% 90.77% 90.85% 96.08% 94.26% Recall 95.65% 87.42% 89.63% 97.12% 93.47% F β=1 96.12 89.06 90.24 96.60 93.87 English test LOC MISC ORG PER overall Precision 90.59% 83.46% 85.93% 92.49% 88.99% Recall 91.73% 77.64% 83.44% 95.24% 88.54% F β=1 91.15… find
  10. F. Jelinek. 1997. Statistical Methods for Speech Recognition. MIT Press. find
  11. E. F. Tjong Kim Sang, W. Daelemans, H. Dejean, R. Koeling, Y. Krymolowsky, V. Punyakanok, and D. Roth. 2000. Applying system combination to base noun phrase identification. In Proceedings of COLING 2000, pages 857–863. find
  12. H. van Halteren, J. Zavrel, and W. Daelemans. 2001. Improving accuracy in word class tagging through the combination fo machine learning systems. Computational Linguistics, 27(2):199–230. find
  13. A. J. Viterbi. 1967. Error bounds for convolutional codes and an asymptotically optimum decoding algorithm. IEEE Transactions on Information Theory, IT-13:260–267. find
  14. T. Zhang and D. Johnson. 2003. A robust risk minimization based named entity recognition system. In Proceedings of CoNLL-2003. find
  15. T. Zhang, F. Damerau, and D. Johnson. 2002. Text chunking based on a generalization of winnow. Journal of Machine Learning Research, 2:615–637, March. find

↑ back to top

This page in Markdown → https://md.research.elamur.ai/free/en/papers/florian-2003-named-entity-recognition-through-classifier/