MétaCan
Menu
Back to cohort

WiC = TSV = WSD: On the Equivalence of Three Semantic Tasks

2022· article· en· W3189820663 on OpenAlexafffund
Bradley Hauer, Grzegorz Kondrak

Bibliographic record

VenueProceedings of the 2022 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies · 2022
Typearticle
Languageen
FieldComputer Science
TopicNatural Language Processing Techniques
Canadian institutionsUniversity of Alberta
FundersNatural Sciences and Engineering Research Council of CanadaAlberta Machine Intelligence Institute
KeywordsComputer scienceSemEvalEquivalence (formal languages)Natural language processingPairwise comparisonTask (project management)Semantic equivalenceArtificial intelligenceWord (group theory)Context (archaeology)PopularitySemantic similarityWord-sense disambiguationWordNetLinguisticsSemantic WebSemantic computingPsychology

Abstract

fetched live from OpenAlex

The Word-in-Context (WiC) task has attracted considerable attention in the NLP community, as demonstrated by the popularity of the recent MCL-WiC SemEval shared task.Systems and lexical resources from word sense disambiguation (WSD) are often used for the WiC task and WiC dataset construction.In this paper, we establish the exact relationship between WiC and WSD, as well as the related task of target sense verification (TSV).Building upon a novel hypothesis on the equivalence of sense and meaning distinctions, we demonstrate through the application of tools from theoretical computer science that these three semantic classification problems can be pairwise reduced to each other, and therefore are equivalent.The results of experiments that involve systems and datasets for both WiC and WSD provide strong empirical evidence that our problem reductions work in practice.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.016
metaresearch head score (Gemma)0.068
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.016
Threshold uncertainty score0.085

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0160.068
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0020.003
Bibliometrics0.0030.003
Science and technology studies0.0030.006
Scholarly communication0.0080.021
Open science0.0030.013
Research integrity0.0040.007
Insufficient payload (model declined to judge)0.0070.002

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.022
GPT teacher head0.260
Teacher spread0.238 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations1
Published2022
Admission routes2
Has abstractyes

Explore more

Same venueProceedings of the 2022 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language TechnologiesSame topicNatural Language Processing TechniquesFrench-language works237,207