MétaCan
Menu
Back to cohort

Data Selection for Bilingual Lexicon Induction from Specialized Comparable Corpora

2020· article· en· W3117059669 on OpenAlexafffund
Martin Laville, Amir Hazem, Emmanuel Morin, Phillippe Langlais

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicNatural Language Processing Techniques
Canadian institutionsUniversité de MontréalComputer Research Institute of Montréal
FundersInstitut de Valorisation des DonnéesAgence Nationale de la Recherche
KeywordsComputer scienceArtificial intelligenceExploitLexiconMargin (machine learning)Selection (genetic algorithm)Natural language processingMachine translationComputationEntropy (arrow of time)Machine learningAlgorithm

Abstract

fetched live from OpenAlex

Narrow specialized comparable corpora are often small in size.This particularity makes it difficult to build efficient models to acquire translation equivalents, especially for less frequent and rare words.One way to overcome this issue is to enrich the specialized corpora with out-ofdomain resources.Although some recent studies have shown improvements using data augmentation, the enrichment method was roughly conducted by adding out-of-domain data with no particular attention given to how to enrich words and how to do it optimally.In this paper, we contrast several data selection techniques to improve bilingual lexicon induction from specialized comparable corpora.We first apply two well-established data selection techniques often used in machine translation that is: Tf-Idf and cross entropy.Then, we propose to exploit BERT for data selection.Overall, all the proposed techniques improve the quality of the extracted bilingual lexicons by a large margin.The best performing model is the cross entropy, obtaining a gain of about 4 points in MAP while decreasing computation time by a factor of 10.

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.003
metaresearch head score (Gemma)0.009
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: Methods · Consensus signal: Methods
Teacher disagreement score0.006
Threshold uncertainty score0.020

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0030.009
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0040.004
Science and technology studies0.0010.001
Scholarly communication0.0010.003
Open science0.0010.003
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0060.005

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.139
GPT teacher head0.342
Teacher spread0.203 · 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
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

Citations2
Published2020
Admission routes2
Has abstractyes

Explore more

Same topicNatural Language Processing TechniquesFrench-language works237,207