MétaCan
Menu
Back to cohort
Record W4226242566 · doi:10.16995/dscn.8103

Designing an API-Based Protocol for the Interoperability of Textual Resources

2021· article· en· W4226242566 on OpenAlexvenueno aff
Pascal Belouin, Shih-Pei Chen, Sean Wang

Bibliographic record

VenueDigital Studies / Le champ numérique · 2021
Typearticle
Languageen
FieldComputer Science
TopicDigital Rights Management and Security
Canadian institutionsnot available
Fundersnot available
KeywordsMetadataInteroperabilityComputer scienceProtocol (science)World Wide WebConsistency (knowledge bases)HumanitiesArtificial intelligenceArt

Abstract

fetched live from OpenAlex

Designing a protocol for the interoperability of digital textual resources—or, more simply, a “IIIF for texts”—remains a challenge, as such a protocol must cater to their vastly heterogenous formats, structures, languages, text encodings and metadata. There have been many attempts to propose a standard for textual resource interoperability, from the ubiquitous Text Encoding Initiative (TEI) format to more recent proposals like the Distributed Text Services (DTS) protocol. In this paper, we introduce our proposal called SHINE, which prioritizes instead the ease for software developers to represent and exchange textual resources and their associated metadata. We do so by combining a hierarchical model of textual structure with a flexible metadata scheme in SHINE, and we continue to define and develop it based on user-centered and iterative design principles. Therefore, we argue that SHINE is a protocol for textual interoperability that successfully balances flexibility of resource representation, consistency across resource representation, and overall simplicity of implementation.RésuméConcevoir un protocole pour l’interopérabilité des ressources textuelles numériques – c’est-à-dire, un IIIF pour des textes – demeure un défi, puisqu’un tel protocole doit correspondre à leurs formats considérablement hétérogènes, ainsi qu’à leurs structures, langues, encodages textuels et métadonnées. Il existe déjà plusieurs tentatives de proposer des standards pour l’interopérabilité des ressources textuelles, tel que l’ubiquiste Text Encoding Initiative (TEI – Initiative d’encodage textuel) ou des propositions plus récentes comme le protocole de Distributed Text Services (DTS – Services de texte distribuées). Dans cet article, nous présenterons une proposition que nous appelons SHINE, qui priorise la facilité de la représentation et de l’échange des ressources textuelles et des métadonnées associées pour les développeurs de logiciel. Nous le ferons en combinant un modèle de structure textuelle hiérarchique avec un schéma de métadonnées flexible dans SHINE et nous le définirons et le développerons selon des principes axés sur l’utilisateur et selon des principes de conceptions itératifs. Par conséquent, nous avançons que SHINE est un protocole pour l’interopérabilité textuelle qui équilibre systématiquement la flexibilité de la représentation de ressources, ainsi que la simplicité globale de l’implémentation, pour toute représentation de ressources.Mots-clés: format d’échange; modélisation de documents; métadonnées; infrastructure numériques; interopérabilité

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.034
metaresearch head score (Gemma)0.037
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: Methods · Consensus signal: Methods
Teacher disagreement score0.034
Threshold uncertainty score0.180

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0340.037
Meta-epidemiology (narrow)0.0010.002
Meta-epidemiology (broad)0.0020.003
Bibliometrics0.0040.003
Science and technology studies0.0040.006
Scholarly communication0.0110.019
Open science0.0050.012
Research integrity0.0050.010
Insufficient payload (model declined to judge)0.0100.009

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.062
GPT teacher head0.315
Teacher spread0.252 · 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
GenreMethods

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
Published2021
Admission routes1
Has abstractyes

Explore more

Same venueDigital Studies / Le champ numériqueSame topicDigital Rights Management and SecurityFrench-language works237,207