Textual Variance - Revision history

Gremid at 18:53, 8 April 2011

2011-04-08T18:53:18Z

Gremid: /* Resources/ Bibliography */

2011-03-21T20:36:10Z

‎Resources/ Bibliography

Gremid at 13:28, 21 March 2011

2011-03-21T13:28:25Z

Piotr Banski: /* Aligner */ I hope this is a correction, please verify

2011-03-18T18:49:50Z

‎Aligner: I hope this is a correction, please verify

Gremid: /* Encoding challenges */

2011-03-18T11:27:51Z

‎Encoding challenges

Gremid: /* Visualization */

2011-03-17T23:11:51Z

‎Visualization

Gremid: /* The “variant graph”: Schmidt’s model of textual variance */

2011-03-17T23:10:45Z

‎The “variant graph”: Schmidt’s model of textual variance

Gremid: /* The “variant graph”: Schmidt’s model of textual variance */

2011-03-17T23:10:33Z

‎The “variant graph”: Schmidt’s model of textual variance

Gremid: /* The “variant graph”: Schmidt’s model of textual variance */

2011-03-17T22:42:03Z

‎The “variant graph”: Schmidt’s model of textual variance

Gremid at 22:24, 17 March 2011

2011-03-17T22:24:43Z

← Older revision		Revision as of 18:53, 8 April 2011
Line 105:		Line 105:

	[[Category:SIG:Manuscripts]]		[[Category:SIG:Manuscripts]]
		+	[[Category:Critical Apparatus]]

@@ Line 91: / Line 91: @@
 *  Multi-Version Document Format. [http://dx.doi.org/10.1016/j.ijhcs.2009.02.001 Schmidt, D. and Colomb, R, 2009. A data structure for representing multi-version texts online, International Journal of Human-Computer Studies, 67.6, 497-514.] (See the related [http://multiversiondocs.blogspot.com/ blog] and [http://multiversiondocs.blogspot.com/2008/03/whats-multi-version-document.html the post  “What's a Multi-Version Document?”].
 * Multi-Version Texts and Collation. [http://www.balisage.net/Proceedings/vol3/html/Schmidt01/BalisageVol3-Schmidt01.html Schmidt, Desmond. “Merging Multi-Version Texts: a Generic Solution to the Overlap Problem.”] Presented at Balisage: The Markup Conference 2009, Montréal, Canada, August 11 - 14, 2009. In Proceedings of Balisage: The Markup Conference 2009. Balisage Series on Markup Technologies, vol. 3 (2009). doi:10.4242/BalisageVol3.Schmidt01.]
 === Computer-aided collation: Concepts and algorithms ===

← Older revision		Revision as of 13:28, 21 March 2011
Line 109:		Line 109:
	* [http://code.google.com/p/multiversiondocs/wiki/NMerge NMerge]		* [http://code.google.com/p/multiversiondocs/wiki/NMerge NMerge]

−	~~[[Category:SIG\|MSS]]~~
	[[Category:SIG:Manuscripts]]		[[Category:SIG:Manuscripts]]

@@ Line 27: / Line 27: @@
 After the witnesses have been tokenized, collators try to align all witnesses involved. Simply put, aligning the witnesses means in this case: Find matching tokens and insert empty tokens (''gap tokens'') such that the token sequences of all witness line up properly. Interestingly this problem is computationally similar to the problem of [http://en.wikipedia.org/wiki/Sequence_alignment sequence alignment] encountered in bioinformatics.
-Looking at an example, assume that we have three witnesses: the first is comprised of the token sequence (a, b, c, d), the second reads (a, c, d, b) and the third (b, c, d). A collator might align these three witnesses as depicted in a tabular fashion on the right. Each witness occupies a column, matching tokens are aligned in a row, necessary gap tokens as inserted during the alignment process are denoted via a hyphen. Depending from which perspective one interprets this ''alignment table'', one can say for example that the (b) in the second row was ommitted in the second witness or it has been added in the first and the second. A similar statement can be made about (b) in the last row by just inverting the relationship of being added/ommitted.
+Looking at an example, assume that we have three witnesses: the first is comprised of the token sequence (a, b, c, d), the second reads (a, c, d, b) and the third (b, c, d). A collator might align these three witnesses as depicted in a tabular fashion on the right. Each witness occupies a column, matching tokens are aligned in a row, necessary gap tokens as inserted during the alignment process are denoted via a hyphen. Depending from which perspective one interprets this ''alignment table'', one can say for example that the (b) in the second row was ommitted in the second witness or it has been added in the first and the third. A similar statement can be made about (b) in the last row by just inverting the relationship of being added/ommitted.
 Alignment tables like the one shown can be encoded losslessly with an existing apparatus encoding scheme, in parallel segmentation mode, as long as only the textual content of token needs to be represented. Each row is represented by a segment with empty readings for gap tokens. Optionally consecutive rows with identical readings for each witness can be compressed into a single segment, e.g.

@@ Line 64: / Line 64: @@
 * If we model transpositions as links between tokens/segments in an alignment/apparatus, we will also need a way to encode these links. Transpositions in general have not been supported in the TEI until recently when the [[Genetic_Editions|WG “Genetic editions”]] proposed an encoding scheme in the context of document-oriented markup.
-* The proposed encoding scheme for transpositions should be reviewed, whether it is suitable as input for collation tools as an encoding scheme for user-declared alignments/transpositions would be helpful in supporting roundtrip collation.
+* The proposed encoding scheme for transpositions should be reviewed, whether it is suitable as input for collation tools. An encoding scheme for user-declared alignments/transpositions would help in supporting roundtrip collation.
 === Visualization ===

@@ Line 68: / Line 68: @@
 === Visualization ===
-The last part of the Gothenburg model deals with visualizing collation results. As we are concerned with modelling and encoding textual variance properly, the question of how to visualize it is of technical importance and should not be disregarded, but is essentially out of scope with regard to this discussion.
+The last module of the Gothenburg model deals with visualizing collation results. As we are concerned with modelling and encoding textual variance properly, the question of how to visualize it is of technical importance and should not be disregarded, but is essentially out of scope with regard to this discussion.
 == The “variant graph”: Schmidt’s model of textual variance ==

@@ Line 83: / Line 83: @@
 * more natural in expressing transpostions as matching segments are linked and not pairs of tokens.
-The tabular model on the other hand might be advantageous, if one wanted to keep collation results in a relational datastores.
+The tabular model on the other hand might be advantageous, if one wanted to keep collation results in a relational datastore.
 == Resources/ Bibliography ==

@@ Line 72: / Line 72: @@
 == The “variant graph”: Schmidt’s model of textual variance ==
-In a paper D. Schmidt and R. Colomb proposed a data model of textual variance (or “multi-version texts” as they call it in the title), which they call a ''variant graph'':
+In a [http://dx.doi.org/10.1016/j.ijhcs.2009.02.001 recent paper] D. Schmidt and R. Colomb proposed a data model of textual variance (or “multi-version texts” as they call it in the title), which they call a ''variant graph'':
 [[Image:Schmidt_Variant_Graph.png|frame|none|A variant graph]]
 == Resources/ Bibliography ==

← Older revision		Revision as of 22:24, 17 March 2011
Line 69:		Line 69:

	The last part of the Gothenburg model deals with visualizing collation results. As we are concerned with modelling and encoding textual variance properly, the question of how to visualize it is of technical importance and should not be disregarded, but is essentially out of scope with regard to this discussion.		The last part of the Gothenburg model deals with visualizing collation results. As we are concerned with modelling and encoding textual variance properly, the question of how to visualize it is of technical importance and should not be disregarded, but is essentially out of scope with regard to this discussion.
		+
		+	== The “variant graph”: Schmidt’s model of textual variance ==
		+
		+	In a paper D. Schmidt and R. Colomb proposed a data model of textual variance (or “multi-version texts” as they call it in the title), which they call a ''variant graph'':
		+
		+	[[Image:Schmidt_Variant_Graph.png\|frame\|none\|A variant graph]]
		+

	== Resources/ Bibliography ==		== Resources/ Bibliography ==