MétaCan
Menu
Back to cohort
Record W2005765227 · doi:10.4018/jcini.2012070103

Using Argumentation Schemes for Argument Extraction

2012· article· en· W2005765227 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueInternational Journal of Cognitive Informatics and Natural Intelligence · 2012
Typearticle
Languageen
FieldComputer Science
TopicMulti-Agent Systems and Negotiation
Canadian institutionsUniversity of Windsor
Fundersnot available
KeywordsArgument (complex analysis)Argumentation theoryComputer scienceArgument mapAppealIdentification (biology)Data scienceEpistemologyLawPhilosophyPolitical science

Abstract

fetched live from OpenAlex

This paper surveys the state-of-the-art of argumentation schemes used as argument extraction techniques in cognitive informatics and uses examples to show how a series of connected problems needs to be solved to move these techniques forward to computational implementation. Some of the schemes considered are argument from expert opinion, practical reasoning, argument from negative consequences, fear appeal arguments, argument from commitment, argument from inconsistent commitments, and the circumstantial ad hominem argument. The paper shows how schemes need to be formed into clusters of sub-schemes work toward a classification system of schemes from the bottom up, and how identification conditions for each scheme can be helpful for argument extraction.

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.

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.001
metaresearch head score (Gemma)0.000
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: none
Teacher disagreement score0.909
Threshold uncertainty score0.304

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.003
Open science0.0000.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.063
GPT teacher head0.384
Teacher spread0.321 · 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