Transformer-Based Named Entity Recognition for French Using Adversarial Adaptation to Similar Domain Corpora

• URL: http://arxiv.org/abs/2212.03692v1
• Date: Mon, 5 Dec 2022 23:33:36 GMT
• Title: Transformer-Based Named Entity Recognition for French Using Adversarial Adaptation to Similar Domain Corpora
• Authors: Arjun Choudhry, Pankaj Gupta, Inder Khatri, Aaryan Gupta, Maxime Nicol, Marie-Jean Meurs, Dinesh Kumar Vishwakarma
• Abstract summary: We propose a transformer-based NER approach for French using adversarial adaptation to similar domain or general corpora. We evaluate our approach on three labelled datasets and show that our adaptation framework outperforms the corresponding non-adaptive models.
• Score: 21.036698406367115
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Named Entity Recognition (NER) involves the identification and classification of named entities in unstructured text into predefined classes. NER in languages with limited resources, like French, is still an open problem due to the lack of large, robust, labelled datasets. In this paper, we propose a transformer-based NER approach for French using adversarial adaptation to similar domain or general corpora for improved feature extraction and better generalization. We evaluate our approach on three labelled datasets and show that our adaptation framework outperforms the corresponding non-adaptive models for various combinations of transformer models, source datasets and target corpora.

Related papers

• Adversarial Adaptation for French Named Entity Recognition [21.036698406367115]
  We propose a Transformer-based NER approach for French, using adversarial adaptation to similar domain or general corpora. Our approach allows learning better features using large-scale unlabeled corpora from the same domain or mixed domains. We also show that adversarial adaptation to large-scale unlabeled corpora can help mitigate the performance dip incurred on using Transformer models pre-trained on smaller corpora.
  arXiv  Detail & Related papers  (2023-01-12T18:58:36Z)
• Polycentric Clustering and Structural Regularization for Source-free Unsupervised Domain Adaptation [20.952542421577487]
  Source-Free Domain Adaptation (SFDA) aims to solve the domain adaptation problem by transferring the knowledge learned from a pre-trained source model to an unseen target domain. Most existing methods assign pseudo-labels to the target data by generating feature prototypes. In this paper, a novel framework named PCSR is proposed to tackle SFDA via a novel intra-class Polycentric Clustering and Structural Regularization strategy.
  arXiv  Detail & Related papers  (2022-10-14T02:20:48Z)
• T-NER: An All-Round Python Library for Transformer-based Named Entity Recognition [9.928025283928282]
  T-NER is a Python library for NER LM finetuning. We show the potential of the library by compiling nine public NER datasets into a unified format. To facilitate future research, we also release all our LM checkpoints via the Hugging Face model hub.
  arXiv  Detail & Related papers  (2022-09-09T15:00:38Z)
• Exploiting Local and Global Features in Transformer-based Extreme Multi-label Text Classification [28.28186933768281]
  We propose an approach that combines both the local and global features produced by Transformer models to improve the prediction power of the classifier. Our experiments show that the proposed model either outperforms or is comparable to the state-of-the-art methods on benchmark datasets.
  arXiv  Detail & Related papers  (2022-04-02T19:55:23Z)
• Hierarchical Transformer Model for Scientific Named Entity Recognition [0.20646127669654832]
  We present a simple and effective approach for Named Entity Recognition. The main idea of our approach is to encode the input subword sequence with a pre-trained transformer such as BERT. We evaluate our approach on three benchmark datasets for scientific NER.
  arXiv  Detail & Related papers  (2022-03-28T12:59:06Z)
• Transformer-Based Source-Free Domain Adaptation [134.67078085569017]
  We study the task of source-free domain adaptation (SFDA), where the source data are not available during target adaptation. We propose a generic and effective framework based on Transformer, named TransDA, for learning a generalized model for SFDA.
  arXiv  Detail & Related papers  (2021-05-28T23:06:26Z)
• Instance Level Affinity-Based Transfer for Unsupervised Domain Adaptation [74.71931918541748]
  We propose an instance affinity based criterion for source to target transfer during adaptation, called ILA-DA. We first propose a reliable and efficient method to extract similar and dissimilar samples across source and target, and utilize a multi-sample contrastive loss to drive the domain alignment process. We verify the effectiveness of ILA-DA by observing consistent improvements in accuracy over popular domain adaptation approaches on a variety of benchmark datasets.
  arXiv  Detail & Related papers  (2021-04-03T01:33:14Z)
• GRIT: Generative Role-filler Transformers for Document-level Event Entity Extraction [134.5580003327839]
  We introduce a generative transformer-based encoder-decoder framework (GRIT) to model context at the document level. We evaluate our approach on the MUC-4 dataset, and show that our model performs substantially better than prior work.
  arXiv  Detail & Related papers  (2020-08-21T01:07:36Z)
• Structured Domain Adaptation with Online Relation Regularization for Unsupervised Person Re-ID [62.90727103061876]
  Unsupervised domain adaptation (UDA) aims at adapting the model trained on a labeled source-domain dataset to an unlabeled target-domain dataset. We propose an end-to-end structured domain adaptation framework with an online relation-consistency regularization term. Our proposed framework is shown to achieve state-of-the-art performance on multiple UDA tasks of person re-ID.
  arXiv  Detail & Related papers  (2020-03-14T14:45:18Z)
• Supervised Domain Adaptation using Graph Embedding [86.3361797111839]
  Domain adaptation methods assume that distributions between the two domains are shifted and attempt to realign them. We propose a generic framework based on graph embedding. We show that the proposed approach leads to a powerful Domain Adaptation framework.
  arXiv  Detail & Related papers  (2020-03-09T12:25:13Z)
• A Simple Baseline to Semi-Supervised Domain Adaptation for Machine Translation [73.3550140511458]
  State-of-the-art neural machine translation (NMT) systems are data-hungry and perform poorly on new domains with no supervised data. We propose a simple but effect approach to the semi-supervised domain adaptation scenario of NMT. This approach iteratively trains a Transformer-based NMT model via three training objectives: language modeling, back-translation, and supervised translation.
  arXiv  Detail & Related papers  (2020-01-22T16:42:06Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.