Pith. sign in

REVIEW 1 cited by

BERT-based Acronym Disambiguation with Multiple Training Strategies

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 2103.00488 v2 pith:TLM4K2J3 submitted 2021-02-25 cs.CL

classification cs.CL
keywords acronymtaskdisambiguationtrainingexpansionsmodelstrategiesaaai-21
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Acronym disambiguation (AD) task aims to find the correct expansions of an ambiguous ancronym in a given sentence. Although it is convenient to use acronyms, sometimes they could be difficult to understand. Identifying the appropriate expansions of an acronym is a practical task in natural language processing. Since few works have been done for AD in scientific field, we propose a binary classification model incorporating BERT and several training strategies including dynamic negative sample selection, task adaptive pretraining, adversarial training and pseudo labeling in this paper. Experiments on SciAD show the effectiveness of our proposed model and our score ranks 1st in SDU@AAAI-21 shared task 2: Acronym Disambiguation.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Automated Extraction of Acronym-Expansion Pairs from Scientific Papers

    cs.CL 2024-12 conditional novelty 5.0 of 10

    A regex-plus-GPT-4 pipeline extracts acronym-expansion pairs from scientific papers more fully than either component alone, though precision is not measured.

Pith tools