FLORS: Fast and Simple Domain Adaptation for Part-of-Speech Tagging
We present FLORS, a new part-of-speech tagger for domain adaptation. FLORS uses robust representations that work especially well for unknown words and for known words with unseen tags. FLORS is simpler and faster than previous domain adaptation methods, yet it has significantly better accuracy than several baselines.
Code (0)
등록된 구현이 없습니다.
Tasks
Domain AdaptationPart-Of-Speech TaggingUnsupervised Domain AdaptationSimilar Papers 제목 키워드 기반
Scatter Component Analysis: A Unified Framework for Domain Adaptation and Domain Generalization
This paper addresses classification tasks on a particular target domain in which labeled training data are only available from source domains different from (but related to) the target. Two closely related frameworks, do…
Domain AdaptationDomain GeneralizationGeneral ClassificationObject Recognition+1Pick up the PACE: Fast and Simple Domain Adaptation via Ensemble Pseudo-Labeling
Domain Adaptation (DA) has received widespread attention from deep learning researchers in recent years because of its potential to improve test accuracy with out-of-distribution labeled data. Most state-of-the-art DA al…
Domain AdaptationSubspace Alignment For Domain Adaptation
In this paper, we introduce a new domain adaptation (DA) algorithm where the source and target domains are represented by subspaces spanned by eigenvectors. Our method seeks a domain invariant feature space by learning a…
Domain AdaptationA simple baseline for domain adaptation using rotation prediction
Recently, domain adaptation has become a hot research area with lots of applications. The goal is to adapt a model trained in one domain to another domain with scarce annotated data. We propose a simple yet effective met…
Domain AdaptationSelf-Supervised LearningSemi-supervised Domain AdaptationFast Game Content Adaptation Through Bayesian-based Player Modelling
In games, as well as many user-facing systems, adapting content to users' preferences and experience is an important challenge. This paper explores a novel method to realize this goal in the context of dynamic difficulty…