MétaCan
Menu
Back to cohort
Record W4402671797 · doi:10.18653/v1/2024.acl-long.372

Translation-based Lexicalization Generation and Lexical Gap Detection: Application to Kinship Terms

2024· article· en· W4402671797 on OpenAlexafffund
Senyu Li, Bradley Hauer, Ning Shi, Grzegorz Kondrak

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicNatural Language Processing Techniques
Canadian institutionsUniversity of Alberta
FundersNatural Sciences and Engineering Research Council of CanadaAlberta Machine Intelligence Institute
KeywordsLexicalizationKinshipComputer scienceTranslation (biology)Natural language processingArtificial intelligenceMachine translationLinguisticsSociologyPhilosophy

Abstract

fetched live from OpenAlex

Constructing lexicons with explicitly identified lexical gaps is a vital part of building multilingual lexical resources.Prior work has leveraged bilingual dictionaries and linguistic typologies for semi-automatic identification of lexical gaps.Instead, we propose a generallyapplicable algorithmic method to automatically generate concept lexicalizations, which is based on machine translation and hypernymy relations between concepts.The absence of a lexicalization implies a lexical gap.We apply our method to kinship terms, which make a suitable case study because of their explicit definitions and regular structure.Empirical evaluations demonstrate that our approach yields higher accuracy than BabelNet and ChatGPT.Our error analysis indicates that enhancing the quality of translations can further improve the accuracy of our method.

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.001
metaresearch head score (Gemma)0.008
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.005
Threshold uncertainty score0.017

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.008
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.002
Science and technology studies0.0010.001
Scholarly communication0.0010.002
Open science0.0010.003
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0050.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.033
GPT teacher head0.302
Teacher spread0.269 · 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 designNot applicable
Domainnot available
GenreMethods

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
Published2024
Admission routes2
Has abstractyes

Explore more

Same topicNatural Language Processing TechniquesFrench-language works237,207