MétaCan
Menu
Back to cohort
Record W2407187509

English Slot Filling with the Knowledge Resolver System.

2013· article· en· W2407187509 on OpenAlexvenueno aff
Hans Chalupsky

Bibliographic record

VenueTheory and applications of categories · 2013
Typearticle
Languageen
FieldComputer Science
TopicNatural Language Processing Techniques
Canadian institutionsnot available
Fundersnot available
KeywordsResolverSearch engine indexingInferenceComputer scienceTask (project management)Interpretation (philosophy)Artificial intelligenceSelection (genetic algorithm)Natural language processingInformation retrievalProgramming languageEngineeringTelecommunications
DOInot available

Abstract

fetched live from OpenAlex

This paper describes the Knowledge Resolver system (KRes) and its performance on the TAC-KBP 2013 English Slot Filling task. KRes is a logic-based inference system aimed at improving statistical relation extraction by deduction and abduction inference towards the best document-level interpretation. For the 2013 evaluation we developed an initial KRes system that extracts a subset of seven TACKBP relations using manually constructed dependency patterns in concert with entity type and name-linking rules. For our baseline extraction engine we used the Blender Lab’s KBP-Toolkit 1.5, which was also exploited at the front-end of KRes for its document indexing, selection and name expansion capabilities. Instead of trying to improve upon KBPToolkit results using inference, for this year we simply combined its results with those of KRes for our best system which landed us in the middle of the pack (only addressing 13 out of the 40 KBP slot types). We also report results for KRes relativized to the seven slot types it addressed which shows promise for future evaluations.

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.002
metaresearch head score (Gemma)0.011
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.037
Threshold uncertainty score0.124

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.011
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0030.002
Science and technology studies0.0010.001
Scholarly communication0.0030.006
Open science0.0020.003
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0370.029

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.006
GPT teacher head0.227
Teacher spread0.222 · 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 designBench or experimental
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

Citations0
Published2013
Admission routes1
Has abstractyes

Explore more

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