Bibliographic record
Abstract
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.
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.027 | 0.089 |
| Meta-epidemiology (narrow) | 0.002 | 0.002 |
| Meta-epidemiology (broad) | 0.002 | 0.004 |
| Bibliometrics | 0.013 | 0.007 |
| Science and technology studies | 0.004 | 0.006 |
| Scholarly communication | 0.011 | 0.029 |
| Open science | 0.004 | 0.008 |
| Research integrity | 0.004 | 0.005 |
| Insufficient payload (model declined to judge) | 0.011 | 0.004 |
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".