1999 NamedEntRecogWithoutGazetteers
- (Mikheev et al., 1999) ⇒ Andrei Mikheev, Marc Moens, Claire Grover. (1999). “Named Entity Recognition Without Gazetteers.” In: Proceedings of the ninth conference on European chapter of the Association for Computational Linguistics. doi:10.3115/977035.977037
Subject Headings: Protein NER, Named Entity Recognition Task.
Notes
- It propose a five-step "Sequence Strategy
- Sure-fire rules: e.g. Only if a word or string of words occurs in an unambiguous context
- First partial matching
- Rule relaxation
- Second partial matching
- Title assignment
Cited By
2004
- Toine Bogers. (2004). “Dutch Named Entity Recognition: Optimizing Features, Algorithms, and Output." Master's thesis, Tilburg University
Quotes
Abstract
It is often claimed that Named Entity recognition systems need extensive gazetteers --- lists of names of people, organisations, locations, and other named entities. Indeed, the compilation of such gazetteers is sometimes mentioned as a bottleneck in the design of Named Entity recognition systems. We report on a Named Entity recognition system which combines rule-based grammars with statistical (maximum entropy) models. We report on the system's performance with gazetteers of different types and different sizes, using test material from the MUC-7 competition. We show that, for the text type and task of this competition, it is sufficient to use relatively small gazetteers of well-known names, rather than large gazetteers of low-frequency names. We conclude with observations about the domain independence of the competition and of our experiments.
References
,
| Author | volume | Date Value | title | type | journal | titleUrl | doi | note | year | |
|---|---|---|---|---|---|---|---|---|---|---|
| 1999 NamedEntRecogWithoutGazetteers | Andrei Mikheev Marc Moens Claire Grover | Named Entity Recognition Without Gazetteers | http://aclweb.org/anthology/E/E99/E99-1001.pdf | 10.3115/977035.977037 |