Pith. sign in

REVIEW 5 cited by

Searching for Optimal Subword Tokenization in Cross-domain NER

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2206.03352 v1 pith:UA3TEVQK submitted 2022-06-07 cs.CL cs.AI

classification cs.CLcs.AI
keywords inputcross-domaindistributionapproachapproachesdirldistributionsdomain
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Input distribution shift is one of the vital problems in unsupervised domain adaptation (UDA). The most popular UDA approaches focus on domain-invariant representation learning, trying to align the features from different domains into similar feature distributions. However, these approaches ignore the direct alignment of input word distributions between domains, which is a vital factor in word-level classification tasks such as cross-domain NER. In this work, we shed new light on cross-domain NER by introducing a subword-level solution, X-Piece, for input word-level distribution shift in NER. Specifically, we re-tokenize the input words of the source domain to approach the target subword distribution, which is formulated and solved as an optimal transport problem. As this approach focuses on the input level, it can also be combined with previous DIRL methods for further improvement. Experimental results show the effectiveness of the proposed method based on BERT-tagger on four benchmark NER datasets. Also, the proposed method is proved to benefit DIRL methods such as DANN.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 5 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. StructCoh: Structured Contrastive Learning for Context-Aware Text Semantic Matching

    cs.CL 2025-09 reject novelty 5.0 of 10

    StructCoh, a graph-enhanced contrastive learning framework for text semantic matching, reportedly outperforms prior methods on legal and plagiarism benchmarks, but the reported results are not reproducible from the pa...

  2. Using External knowledge to Enhanced PLM for Semantic Matching

    cs.CL 2025-05 reject novelty 4.0 of 10

    A BERT-based model that injects WordNet lexical-relation signals into attention and adaptively fuses them claims consistent accuracy improvements on 10 semantic matching datasets.

  3. Comateformer: Combined Attention Transformer for Semantic Sentence Matching

    cs.CL 2024-12 conditional novelty 4.0 of 10

    Comateformer replaces softmax attention with a product of tanh similarity and sigmoid dissimilarity scores, and reports consistent gains on ten semantic matching datasets.

  4. Multi-Granularity Reasoning for Natural Language Inference

    cs.CL 2026-04 conditional novelty 3.5 of 10

    Stacking element-wise multi-layer BERT interactions and DenseNet yields modest NLI gains over BERT/RoBERTa baselines on standard benchmarks.

  5. Boosting Neural Language Inference via Cascaded Interactive Reasoning

    cs.CL 2025-05 reject novelty 3.0 of 10

    A new feature-extraction module for NLI combines all BERT layers with element-wise sentence-pair interactions and a DenseNet, reporting average gains of roughly one point on ten benchmarks, though evaluation inconsist...

Pith tools