An annotation scheme for Rhetorical Figures
Bibliographic record
Abstract
There is a driving need computationally to interrogate large bodies of text for a range of non-denotative meaning (e.g., to plot chains of reasoning, detect sentiment, diagnose genre, and so forth). But such meaning has always proven computationally allusive. It is often implicit, ‘hidden’ meaning, evoked by linguistic cues, stylistic arrangement, or conceptual structure – features that have hitherto been difficult for Natural Language Processing systems to recognize and use. Non-denotative textual effects are the historical concern of rhetorical studies, and we have turned to rhetoric in order to find new ways to advance NLP, especially for sophisticated tasks like Argument Mining. This paper highlights certain rhetorical devices that encode levels of meaning that have been overlooked in Computational Linguistics generally and Argument Mining particularly, and yet lend themselves to automated detection. These devices are the linguistic configurations known as Rhetorical Figures. We argue for the importance of these devices for Argument Mining, especially in collocations, and we present an XML annotation scheme for Rhetorical Figures to make figuration more tractable for computational approaches, particularly with an eye on the improvements they offer Argument Mining. We also discuss the intellectual and technical challenges involved in figure annotation and the implications for Machine Learning.
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.008 | 0.028 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.007 | 0.005 |
| Science and technology studies | 0.004 | 0.004 |
| Scholarly communication | 0.006 | 0.013 |
| Open science | 0.002 | 0.005 |
| Research integrity | 0.003 | 0.004 |
| Insufficient payload (model declined to judge) | 0.020 | 0.010 |
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".