standOff. When we have changed our mind. Some entries in the table begin with a word in capitals and the reason for it. EVIDENCE CORRECTED — the finding still stands, but we had quoted the wrong sentence from the paper, and the quotation has been replaced with the right one. RETRACTED — the entry itself was wrong; it stays on the page, marked, with the reason, rather than being deleted. WITHDRAWN AND REPLACED — the entry was wrong, and a corrected version of it appears in the entries below. Each mark carries its own reason, in brackets, because the reasons differ from one entry to the next. An entry we have WITHDRAWN is removed from this page and kept in the record, with its reason. A line reading Audit and a date is a later re-reading of the entry against its whole sentence: DOUBTFUL means it was kept, and the reason says what is loose about it. Quotation marks inside the tagger's sentence. Where a tag is the tagger's own sentence, a phrase in quotation marks inside it is borrowed from the paper — the tagger's wording around it is not. The paper's own sentence is the evidence quote shown on the same row, so the borrowing can be checked against the thing borrowed from without leaving this page. Nothing inside quotation marks anywhere on this page is ours: if it is quoted, it is the paper's. Whose words a concept carries. A concept entry records a term the paper itself uses, so the term, the sense given for it, and its evidence are the paper's own words, quoted where the paper fixes them. This is the opposite of a sense entry in the tag table, which is the tagger's sentence about how the paper uses a term. Where a concept entry could not be grounded in the paper's words, the entry says so on its own row.| second reading | alternatives | an independent re-reading of a facet, recorded whether or not it agrees |
| relation to other work | claim_relations | how this paper stands to another: agrees, contradicts, extends, qualifies |
| claim type | claim_type | the shape of the claim: existence, mechanism, method, critique, prediction, null |
| concept edge | concept_edges | an asserted relation between two concepts, with the sentence asserting it |
| content tag | content_tags | a finding, definition, quantity, statistic or variable named in the paper |
| limitation | limitations | what the paper says its evidence cannot support |
| mechanism | mechanisms | how the reported effect is said to come about |
| method | method | how the paper produced its evidence |
| object of study | object_of_study | what the paper is about — the thing it investigates |
| phenomenon | phenomenon | the effect or regularity under study |
| sense | senses | a distinct use of a term, quoted where the paper fixes it |
The reference list is not part of the text we hold for this paper. Our copy was extracted from the publisher's page and the bibliography did not survive that extraction, so the article below ends before its references. Nothing has been removed by us.
object_of_studyconcept_edgesIn 2020 there was an attempt to create an ontology (Andrews, 2020) for content_tags↗content_tags↗the variant graph, which is a data model used in tools such as CollateX (Haentjens Dekker et al., 2015), Stemmarest (Andrews, 2019), and TraVIZ (Jänicke et al., 2015) to represent and visualize text collations and certain sorts of annotation. limitationsconcept_edgescontent_tagsThe conclusion was that the ontology was not suitable for expressing the full data model employed in variant graphs, not least because all of them (Stemmarest most heavily) content_tagsrely on property attributes, which RDF and OWL do not handle well and which can therefore not be suitably represented in an ontology definition.
concept_edgesIndeed, although ontologies have in the meantime been proposed for various aspects of digital scholarly edition (NIE-INE, 2019) and specifically for critical apparatus (Giovannetti, 2021) and an opportunity to discuss these together would be very welcome, one major motivation for undertaking the 2020 project at all was to address the concerns, frequently heard by the author in a very heavily XML-based community, that since graph databases do not tend to have schemas and certainly have no way to enforce these schemas, content_tagsthey lack the foundations for sustainability and interoperability that TEI XML schemas or, indeed, relational database schemas provide. Many of those who expressed concerns went on to point to ontologies as examples of schemas that can be used to validate RDF data.
claim_relationsclaim_relationscontent_tagsWhat the 2020 project showed, in the end, was the inadequacy of ontologies and especially OWL as a validation model for graph-based data. sensesWhile many of the classes used by Stemmarest and their relationships to each other can be described adequately in OWL, the model relies upon many additional constraints that, while seemingly simple, go beyond OWL’s capabilities. concept_edgesconcept_edgesFor example, in the Stemmarest ontology we can say that a Witness can belong to a Tradition and also to one or more Stemmata, and that a Tradition can contain multiple Stemmata. sensesHowever, one of the important aspects of validation is to prevent inattentive mistakes in the data model. mechanismsFor example, if a witness W appears in a stemma belonging to tradition A, the model software should ensure that W also belongs to tradition A as a witness and not, for example, an unrelated tradition B; moreover, W should not appear in any stemmata of tradition B. mechanismssensesEven more intractable problems arise with more complex specifications: for example, the need to ensure that the variant graph is self-consistent, so that a user cannot create a situation in the model where a portion of the edited text loops back onto itself or is omitted altogether. mechanismslimitationscontent_tagsThus, while the Stemmarest ontology can describe the data reasonably well, it is not an adequate tool for setting constraints; these must still be described in code.
sensesclaim_relationsVogeler (2021, p. 80) notes in his discussion of graph-based models for critical edition that “the formal affordance of OWL is not really exploited in Digital Scholarly Editions”. mechanismssensesclaim_relationsWe would argue here that most editors are less interested in the sort of open-world inference for which OWL was intended (though Vogeler makes a case for why it might be interesting), as opposed to the formalisation, description, and consistency of their data. phenomenonclaim_relationsIn this sense, the critics of graph-based models do have a point; how do we validate our graphs? limitationssensesConstraint enforcement in Neo4J, perhaps the most popular graph database, is indeed limited strictly to data properties of nodes and relationships (Neo4J, Inc., 2022). limitationsThe situation is hardly better for LOD stores, which have so far depended more or less entirely on ontology specifications, with limitations as described above, to describe their data.
method↗Recently, however, there have been two intriguing developments in the Semantic Web world that are especially relevant to digital humanities projects, not least Stemmarest. The first of these is content_tags↗RDF*, an extension to RDF that allows an entire triple to be the subject or object in further triple statements (Arndt et al., 2021). limitationslimitationsclaim_relationsconcept_edgescontent_tagsWhile it is still in an early phase of development, RDF* provides the long-awaited ability to set context for LOD statements, and promises to triple stores the same ability to set properties on relationships that graph databases such as Neo4J have always provided; this in turn has opened the way for Stemmarest, and many other projects besides, to take advantage of Neo4J’s powerful graph traversal and analysis algorithms while preserving full interoperability with LOD formats.
alternativesThe second major development is content_tags↗SHACL (Shapes Constraint Language), a language whose purpose is to define a set of constraints against which RDF graphs can be validated (Knublauch and Kontokostas, 2017). claim_typemechanismsclaim_relationsconcept_edgescontent_tagsThis language solves exactly the problem that ontologies do not; specifically, in conjunction with a database that supports transactions and their rollbacks such as Neo4J, a set of SHACL constraints can ensure the consistency of data added to the graph, so that (to take the example above) a witness from one text tradition cannot be included in a stemma belonging to an entirely different tradition.
Perhaps the most intriguing feature of SHACL is the ability to include “constraint components” expressed in SPARQL or Javascript, providing more or less limitless possibilities for formalising complex models. mechanismslimitationsIn a sense, this affordance challenges the idea of the separation of program code and data that is the usual gold standard for sustainability efforts, insofar as constraints can be expressed as arbitrarily complex programming logic, embedded in RDF or Turtle files and saved as a schema alongside the data itself.
claim_relationsThe SHACL model thus provides a fascinating way to bring the intellectual contributions inherent in codework (Zundert, 2016; Antonijevic Ubois, van Zundert, and Andrews, 2018) across the “sustainability divide” that allows them to be properly valued and conserved as scholarship; at the same time, it points to a promising future model of digital work in the humanities, in which domain-specific code can live alongside the data, to be processed by more generic (and thus, hopefully, more long-lived) software platforms.
Relations on this page carry a quotation for the claim. Where a relation was separately evidenced — and so tested against the vocabulary for its type — the row says so; none of 7 relations here carry that mark. The rest are the tagger’s reading of the sentence quoted beside them.
This record holds no controls. A layer is empty when the tagger recorded nothing in it — which is not the same as the paper having nothing to record.
| facet | tag | field | conf. | whose words |
|---|---|---|---|---|
| object_of_study | The variant graph data model used to represent text collations, and whether its constraints can be expressed formally. | object_of_study | the paper's words | |
| claim_type | method | claim_type | the paper's words | |
| phenomenon | graph schema validation | phenomenon | the paper's words | |
| method | review also in: review | method | the paper's words | |
| mechanisms | An ontology describes what kinds of thing exist and how they relate, but cannot forbid a combination that is well-typed and still wrong | mechanisms[0] | the tagger's words | |
| mechanisms | The hard constraints are cross-object: an entity appearing in one structure must be consistent with its membership elsewhere | mechanisms[1] | the tagger's words | |
| mechanisms | Some constraints are global properties of the whole graph and cannot be checked object by object at all | mechanisms[2] | the tagger's words | |
| mechanisms | The original failure was not a modelling mistake but a mismatch of purpose - OWL was built for open-world inference and editors want description and consistency | mechanisms[3] | the tagger's words | |
| mechanisms | Constraints only bite if the store can undo a rejected write, so validation needs transactions and rollback underneath it | mechanisms[4] | the tagger's words | |
| mechanisms | Allowing arbitrary code inside constraints erases the code/data boundary that sustainability practice depends on, which the author treats as a feature | mechanisms[5] | the tagger's words | |
| limitations | The author's own earlier Stemmarest ontology describes the data adequately but cannot express the model's constraints, which still have to be written in program code. what this limits: any use of the ontology to enforce the model: WHILE THE STEMMAREST ONTOLOGY CAN DESCRIBE THE DATA REASONABLY WELL, IT IS NOT AN ADEQUATE TOOL FOR SETTING CONSTRAINTS; THESE MUST STILL BE DESCRIBED IN CODE | limitations[0] | the tagger's words | |
| limitations | RDF*, the extension the interoperability half of the proposal depends on, is acknowledged to be immature. what this limits: the interoperability half of the proposal: RDF* IS STILL IN AN EARLY PHASE OF DEVELOPMENT | limitations[1] | the tagger's words | |
| limitations | SHACL's SPARQL/Javascript constraint components undermine the separation of code from data that sustainability practice normally treats as the gold standard. what this limits: the sustainability claim for SHACL: constraint components CHALLENGE THE IDEA OF THE SEPARATION OF PROGRAM CODE AND DATA THAT IS THE USUAL GOLD STANDARD | limitations[2] | the tagger's words | |
| limitations | The 2020 ontology attempt failed because RDF and OWL handle property attributes badly, and the model depends on them what this limits: any RDF/OWL serialisation of a property-bearing graph: THE ONTOLOGY WAS NOT SUITABLE FOR EXPRESSING THE FULL DATA MODEL ... NOT LEAST BECAUSE ALL OF THEM ... RELY ON PROP[erty attributes] | limitations[3] | the tagger's words | |
| limitations | The graph database's own constraint mechanism reaches only data properties, not structure what this limits: the graph-database alternative: CONSTRAINT ENFORCEMENT IN NEO4J ... IS INDEED LIMITED STRICTLY TO DATA PROPERTIES OF NODES AND RELATIONSHIPS, not structure | limitations[4] | the tagger's words | |
| limitations | The extension that would fix the property problem is not yet mature what this limits: the same scope as limitations[1] - the fix for the property problem is immature | limitations[5] | the tagger's words | |
| limitations | Linked-data stores are in no better position, having relied on ontologies alone what this limits: the linked-data alternative: LOD STORES ... HAVE SO FAR DEPENDED MORE OR LESS ENTIRELY ON ONTOLOGY SPECIFICATIONS, WITH LIMITATIONS AS DESCRIBED ABOVE | limitations[6] | the tagger's words | |
| senses | schema - as DESCRIPTION: says what classes exist and how they may relate, which an ontology does well | senses[0] | 1.0 | the tagger's words |
| senses | schema - as CONSTRAINT: forbids configurations that are well-typed and still wrong, which is what validation actually needs | senses[1] | 1.0 | the tagger's words |
| senses | the graph problem - LOCAL: a property on a single node or relationship, which Neo4J can already enforce | senses[2] | 1.0 | the tagger's words |
| senses | the graph problem - GLOBAL: a property of the whole graph, such as the edited text not looping back on itself, which nothing local can check | senses[3] | 1.0 | the tagger's words |
| senses | OWL's purpose - as intended: open-world inference, deriving new facts from stated ones | senses[4] | 1.0 | the tagger's words |
| senses | OWL's purpose - as wanted by editors: formalisation, description and consistency, which is a different job it was not built for | senses[5] | 1.0 | the tagger's words |
| alternatives | claim_type: method a second reading reaching the same value. Recorded: method — note: a second reading reaching the same value from a different sentence. Not applied - a person decides. | alternatives.claim_type | the tagger's words | |
| claim_relations | builds-on → Andrews (2020), the 2020 attempt to build an ontology for the variant graph / Stemmarest | claim_relations[0] | the tagger's words | |
| claim_relations | extends → Vogeler (2021) on graph-based models for critical edition and the unexploited affordance of OWL | claim_relations[1] | the tagger's words | |
| claim_relations | builds-on → SHACL (Shapes Constraint Language), Knublauch and Kontokostas (2017) | claim_relations[2] | the tagger's words | |
| claim_relations | builds-on → RDF* (Arndt et al., 2021) | claim_relations[3] | the tagger's words | |
| claim_relations | critiques → the author's own 2020 attempt to build a variant-graph ontology | claim_relations[4] | the tagger's words | |
| claim_relations | critiques → the argument that graph databases lack the sustainability foundations of XML or relational schemas | claim_relations[5] | the tagger's words | |
| claim_relations | extends → Vogeler on graph-based models for critical edition | claim_relations[6] | the tagger's words | |
| claim_relations | supports → the codework literature arguing that code embodies scholarship | claim_relations[7] | the tagger's words | |
| concept_edges | SHACL —contrasted-with→ ontology strength of the relation: 1 | concept_edges[0] | the tagger's words | |
| concept_edges | RDF* —operationalised-as→ property attributes strength of the relation: 1
Audit 2026-09-28: DOUBTFUL - read against its span and kept, but RDF* allows properties on relationships; operationalised-as 'property attributes' is the wrong type. also in: RDF* · property attributes | concept_edges[2] | the tagger's words | |
| concept_edges | property attributes —distinct-from→ OWL strength of the relation: 1
Audit 2026-09-28: DOUBTFUL - read against its span and kept, but OWL does not handle property attributes; distinct-from paraphrases an inability. also in: property attributes · OWL | concept_edges[3] | the tagger's words | |
| concept_edges | witness —part-of→ tradition strength of the relation: 1 | concept_edges[4] | the tagger's words | |
| concept_edges | EVIDENCE CORRECTED (RE-GROUNDED) · stemma —part-of→ tradition EVIDENCE CORRECTED: RE-GROUNDED. The old span attested 'stemma' only inside 'Stemmarest', the TOOL'S OWN NAME - a run of letters, not the word. This clause writes both terms and states the containment in the paper's own verb: a stemma BELONGS TO a tradition. — strength of the relation: 1 | concept_edges[5] | the tagger's words | |
| concept_edges | Stemmarest —operationalised-as→ variant graph strength of the relation: 1
Audit 2026-09-28: DOUBTFUL - read against its span and kept, but Stemmarest USES the variant graph model; operationalised-as is the wrong type. also in: Stemmarest · variant graph | concept_edges[8] | the tagger's words | |
| concept_edges | critical apparatus —part-of→ digital scholarly edition strength of the relation: 1
Audit 2026-09-28: DOUBTFUL - read against its full span and kept, but the span says ontologies were proposed for aspects of digital scholarly edition and specifically for critical apparatus; part-of is loose. also in: critical apparatus · digital scholarly edition | concept_edges[11] | the tagger's words | |
| content_tags | An ontology could not express the variant graph model, because the model relies on property attributes that RDF and OWL handle badly. | content_tags.findings[0] | the tagger's words | |
| content_tags | The 2020 project showed that ontologies, and OWL in particular, are inadequate as a validation model for graph-based data. | content_tags.findings[1] | the tagger's words | |
| content_tags | The concern being answered is that graph databases lack the schema enforcement that gives XML and relational data their sustainability and interoperability. about this quote: THE QUOTE IS A CONCERN THE PAPER SETS OUT TO ADDRESS, NOT ITS FINDING - it completes a sentence that says the project was undertaken 'to address the concerns, frequently heard' that. | content_tags.findings[2] | the tagger's words | |
| content_tags | an ontology can describe the model adequately and still be unable to constrain it, leaving the constraints in code | content_tags.findings[3] | the tagger's words | |
| content_tags | the failure traces to RDF and OWL handling properties on relationships badly | content_tags.findings[4] | the tagger's words | |
| content_tags | RDF* supplies the missing ability to put properties on relationships, though it is early | content_tags.findings[5] | the tagger's words | |
| content_tags | SHACL constraints plus a transactional store can enforce the cross-object consistency an ontology cannot | content_tags.findings[6] | the tagger's words | |
| content_tags | variant graph also in: variant graph | content_tags.definitions[0] | the tagger's words | |
| content_tags | SHACL also in: SHACL | content_tags.definitions[1] | the tagger's words | |
| content_tags | RDF* also in: RDF* | content_tags.definitions[2] | the tagger's words | |
| content_tags | variant graph also in: variant graph | content_tags.definitions[3] | the tagger's words |
Tags that could not be placed in the text:
What was deliberately not tagged, and why, is recorded per paper by the tagger. Where a paper has no such record, this page says so rather than implying that nothing was declined.