MétaCan
Menu
Back to cohort
Record W2044810048 · doi:10.1002/asi.22696

Mining a multilingual association dictionary from<scp>W</scp>ikipedia for cross‐language information retrieval

2012· article· en· W2044810048 on OpenAlexaff
Zheng Ye, Jimmy Xiangji Huang, Ben He, Hongfei Lin

Bibliographic record

VenueJournal of the American Society for Information Science and Technology · 2012
Typearticle
Languageen
FieldComputer Science
TopicNatural Language Processing Techniques
Canadian institutionsYork University
Fundersnot available
KeywordsComputer scienceCross-language information retrievalInformation retrievalVariety (cybernetics)Association (psychology)Natural language processingGraphArtificial intelligenceMachine translationQuality (philosophy)Query expansionMeaning (existential)Filter (signal processing)

Abstract

fetched live from OpenAlex

W ikipedia is characterized by its dense link structure and a large number of articles in different languages, which make it a notable W eb corpus for knowledge extraction and mining, in particular for mining the multilingual associations. In this paper, motivated by a psychological theory of word meaning, we propose a graph‐based approach to constructing a cross‐language association dictionary ( CLAD ) from W ikipedia, which can be used in a variety of cross‐language accessing and processing applications. In order to evaluate the quality of the mined CLAD , and to demonstrate how the mined CLAD can be used in practice, we explore two different applications of the mined CLAD to cross‐language information retrieval ( CLIR ). First, we use the mined CLAD to conduct cross‐language query expansion; and, second, we use it to filter out translation candidates with low translation probabilities. Experimental results on a variety of standard CLIR test collections show that the CLIR retrieval performance can be substantially improved with the above two applications of CLAD , which indicates that the mined CLAD is of sound quality.

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

Direct model labels (unvalidated)

Per-model category and study-design labels from the labeling rounds. They are machine output, unvalidated, and the disagreement between models ships as data. No study design here is MEDLINE-validated yet.

Model armCategoriesStudy designConfidence
gemmano category
Domain: not available · Genre: Empirical
About the Canadian research system: no · About a Canadian topic: no
Bench or experimentalhigh
gptno category
Domain: not available · Genre: Methods
About the Canadian research system: no · About a Canadian topic: no
Other designhigh
models splitAgreement compares identical category sets and study designs across arms.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.002
metaresearch head score (Gemma)0.006
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Other design · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.765
Threshold uncertainty score0.764

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0020.006
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.002
Science and technology studies0.0010.000
Scholarly communication0.0000.010
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

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.009
GPT teacher head0.294
Teacher spread0.286 · 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

Labeled directly by 2 models reading the full record.

The models applied no category: nothing in the taxonomy fit this work.

The models disagree on parts of this classification; every voice is preserved in the section at the end of the page.

Study designBench or experimental · Other design
Domainnot available
GenreEmpirical · Methods

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

Citations12
Published2012
Admission routes1
Has abstractyes

Explore more

Same venueJournal of the American Society for Information Science and TechnologySame topicNatural Language Processing TechniquesFrench-language works237,207