ARPANI@BIT_DURG: KBP English Slot-filling Task Challenge.
Bibliographic record
Abstract
The present communication laid by the above mentioned TAC-SF Track participants aims to report TAC forum about the system-incorporated towards Slot-Filling task. Given a list of PER / ORG relevant attributes, the task aimed at extracting Noun-phrases that fit as assigned values to these attributes, as narrated either in one or more relevant pools of newswires or described as declarative and / or factual information in supporting knowledge-base. For accomplishing above, care was taken to identify such slot-fill patterns from every instance of relevant context whether in newswire or knowledge-base. Hence, the system relied upon generating exhaustive supporting vocabulary patterns that associate with desired slot-patterns in semantic sense. Three different kinds of sources were used to build entity-relevant vocabulary in the Task Challenge so as to search for the precise information about the entity-attributes (may be single-valued or multiple valued) mentioned in Slot-fill track task definition. The team’s spirits feels elevated at the thought of using the free text from the Wikipedia pages associated with the knowledge base nodes, while building the evaluation model as it adds to the robustness and reliability of the system even at the time of inaccessibility of the Web.
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.005 | 0.011 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.002 |
| Science and technology studies | 0.002 | 0.001 |
| Scholarly communication | 0.003 | 0.005 |
| Open science | 0.002 | 0.003 |
| Research integrity | 0.003 | 0.002 |
| Insufficient payload (model declined to judge) | 0.068 | 0.056 |
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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".