MétaCan
Menu
Back to cohort
Record W2398409858

Wikipedia Search as Effective Entity Linking Algorithm.

2013· article· en· W2398409858 on OpenAlexvenueno aff
Milan Dojchinovski, Ivo Lašek, Tomáš Kliegr, Ondřej Zamazal

Bibliographic record

VenueTheory and applications of categories · 2013
Typearticle
Languageen
FieldComputer Science
TopicNatural Language Processing Techniques
Canadian institutionsnot available
Fundersnot available
KeywordsComputer scienceTask (project management)Entity linkingF1 scoreContext (archaeology)Information retrievalNatural language processingArtificial intelligenceKnowledge baseEngineering
DOInot available

Abstract

fetched live from OpenAlex

This paper reports on the participation of the LKD team in the English entity linking task at the TAC KBP 2013. We evaluated various modifications and combinations of the MostFrequent-Sense (MFS) based linking, the Entity Co-occurrence based linking (ECC), and the Explicit Semantic Analysis (ESA) based linking. We employed two our Wikipediabased NER systems, the Entityclassifier.eu and the SemiTags. Additionally, two Lucenebased entity linking systems were developed. For the competition we submitted 9 submissions in total, from which 5 used the textual context of the entities, and 4 submissions did not. Surprisingly, the MFS method based on the Wikipedia Search has proved to be the most effective approach – it achieved the best 0.555 B3+ F1 score from all our submissions and it achieved high 0.677 B3+ F1 score for Geo-Political (GPE) entities. In addition, the ESA based method achieved best 0.483 B3+ F1 for Organization (ORG) entities.

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.008
Threshold uncertainty score0.021

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0030.009
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0080.005
Science and technology studies0.0010.000
Scholarly communication0.0020.003
Open science0.0010.001
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.005
GPT teacher head0.263
Teacher spread0.259 · 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
Published2013
Admission routes1
Has abstractyes

Explore more

Same venueTheory and applications of categoriesSame topicNatural Language Processing TechniquesFrench-language works237,207