Training a Named Entity Recognition (NER) model often involves fixing a taxonomy of entity types. However, requirements evolve and we might need the NER model to recognize additional entity types. A simple approach is to re-annotate entire dataset with both existing and additional entity types and then train the model on the re-annotated dataset. However, this is an extremely laborious task. To remedy this, we propose a novel approach called Partial Label Model (PLM) that uses only partially annotated datasets. We experiment with 6 diverse datasets and show that PLM consistently performs better than most other approaches (0.5 - 2.5 F1), including in novel settings for taxonomy expansion not considered in prior work. The gap between PLM and all other approaches is especially large in settings where there is limited data available for the additional entity types (as much as 11 F1), thus suggesting a more cost effective approaches to taxonomy expansion.

Taxonomy Expansion for Named Entity Recognition / K, Karthikeyan; Vyas, Yogarshi; Ma, Jie; Paolini, Giovanni; John, Neha; Wang, Shuai; Benajiba, Yassine; Castelli, Vittorio; Roth, Dan; Ballesteros, Miguel. - ELETTRONICO. - (2023), pp. 6895-6906. (Intervento presentato al convegno Conference on Empirical Methods in Natural Language Processing tenutosi a Singapore nel 6-10 dicembre 2023) [10.18653/v1/2023.emnlp-main.426].

Taxonomy Expansion for Named Entity Recognition

Paolini, Giovanni;
2023

Abstract

Training a Named Entity Recognition (NER) model often involves fixing a taxonomy of entity types. However, requirements evolve and we might need the NER model to recognize additional entity types. A simple approach is to re-annotate entire dataset with both existing and additional entity types and then train the model on the re-annotated dataset. However, this is an extremely laborious task. To remedy this, we propose a novel approach called Partial Label Model (PLM) that uses only partially annotated datasets. We experiment with 6 diverse datasets and show that PLM consistently performs better than most other approaches (0.5 - 2.5 F1), including in novel settings for taxonomy expansion not considered in prior work. The gap between PLM and all other approaches is especially large in settings where there is limited data available for the additional entity types (as much as 11 F1), thus suggesting a more cost effective approaches to taxonomy expansion.
2023
Proceedings of the 2023 Conference on Empirical Methods in Natural Language Processing
6895
6906
Taxonomy Expansion for Named Entity Recognition / K, Karthikeyan; Vyas, Yogarshi; Ma, Jie; Paolini, Giovanni; John, Neha; Wang, Shuai; Benajiba, Yassine; Castelli, Vittorio; Roth, Dan; Ballesteros, Miguel. - ELETTRONICO. - (2023), pp. 6895-6906. (Intervento presentato al convegno Conference on Empirical Methods in Natural Language Processing tenutosi a Singapore nel 6-10 dicembre 2023) [10.18653/v1/2023.emnlp-main.426].
K, Karthikeyan; Vyas, Yogarshi; Ma, Jie; Paolini, Giovanni; John, Neha; Wang, Shuai; Benajiba, Yassine; Castelli, Vittorio; Roth, Dan; Ballesteros, Miguel
File in questo prodotto:
Eventuali allegati, non sono esposti

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11585/955645
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? ND
social impact