MétaCan
Menu
← Back to cohort
Record W1875686838 · doi:10.16995/dscn.139

Linking Fancy unto Fancy: Towards a Semantic Codex

2009· article· fr· W1875686838 on OpenAlexaffvenue
William Winder

Bibliographic record

VenueDigital Studies / Le champ numérique · 2009
Typearticle
Languagefr
FieldComputer Science
TopicNatural Language Processing Techniques
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsMeaning (existential)Computer scienceAutomatic summarizationHypertextReading (process)Representation (politics)Interpretation (philosophy)Dimension (graph theory)Set (abstract data type)LinguisticsArtificial intelligenceEpistemologyPhilosophyWorld Wide WebMathematics

Abstract

fetched live from OpenAlex

We will begin by considering Zholkovsky and Schecheglov's formalist interpretation of a fable by the Russian fabulist Krylov called “Trishka’s Caftan” (Figure 1). Their approach is a very general way of capturing and mapping out the meaning of texts. We will consider next the theoretical and technical framework of an alternative mapping framework, cascading summaries. Summary trees, cascading summaries, or Russian doll texts are a kind of stratified hypertext (Vandendorpe) composed of a set of cascading and interleaved summaries. Such summaries represent a novel framework for describing the structure of textual meaning, a framework which seems crucially dependent on the electronic medium. Summarization alters the view we have of text and its meaning. In particular a cascading summary gives us a concrete representation of a hidden dimension of texts. The horizontal, linear surface of the text is explicit; we follow it left to right in our normal linear reading. Concordances show us a second vertical dimension of text by stacking up or aligning concordant segments throughout the text. Then, upon the velvet sinking, I betook myself to linking Fancy unto fancy, thinking what this ominous bird of yore -- What this grim, ungainly, ghastly, gaunt and ominous bird of yore Meant in croaking Nevermore. E. A. Poe “The Raven” Summarization shows us yet a third dimension, the depth of the text, where text segments are grouped and aligned with a textual variant that is a more general, abstract expression of the subtexts' combined meaning. The abstract variant is not in the text segments explicitly; it is an expression of the meaning of the segments and must be generated through manual or automatic summarization. We all possess the natural language competence that allows us to say more with less; it is fundamental to our use of language. Dictionaries are built on the principle that a single word (less) can be unpacked into a an explicative definition (more). Dictionaries encode a general-purpose correspondence between words, not the specific correspondence that is progressively constructed through the vertical reading of text (linguists would say that definitions are part of langue, not parole). Yet narrative texts are on-thefly dictionaries. To interpret them correctly, we must understand how they accumulate meaning in words as the text progresses. “Trishka's caftan” means little before the story; much at the end. How do texts accumulate meaning in symbols? Summaries, like the words they are composed of, mean more with less.

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.003
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: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.011
Threshold uncertainty score0.037

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0030.011
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0050.004
Science and technology studies0.0030.006
Scholarly communication0.0070.021
Open science0.0020.007
Research integrity0.0030.003
Insufficient payload (model declined to judge)0.0110.002

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.032
GPT teacher head0.302
Teacher spread0.269 · 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 designTheoretical or conceptual
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
Published2009
Admission routes2
Has abstractyes

Explore more

Same venueDigital Studies / Le champ numérique→Same topicNatural Language Processing Techniques→French-language works237,207→