The Communications of the TEX Users Group Volume 29 ... - TUG

More documents

Recommendations

Info

$E-m: Guidelines for Future TEX Extensions - TUG$

$TUG 2001: A TEX Odyssey PROGRAM$

$LATEX Sophisticated professional typesetting for business and ...$

$TEX and Scripting Languages - TUG$

$Geometric Diversions with TEX, METAFONT and METAPOST - TUG$

$Writing Gregg Shorthand with mEtaFoNt and LATEX - TUG$

$Generating LaTeX documents through Matlab - TUG$

John Plaice, Blanca Mancilla and Chris Rowley can encode any sort of simple record or entry. In this section, we indicate with a few more examples how the tuple structure can encode different kinds of data structure. As was described in the previous section, there are typing, property and indexing dimensions in a tuple. If we restrict ourselves to the indexing dimensions, then the tuple can be considered to be a (partial) function from an index set (the structured set of indexing dimensions) to a set of values, which are in general themselves tuples, interpreting a singleton value as a type of tuple singleton and indexing set of size 1 {0}. If, in the sense of datatypes, these singleton values are strongly typed, then these singleton values will need a datatype property dimension. • Declined word-stem sequences: To enhance document search or to effect grammatical analysis, it is common to stem words, separating the stem and the prefixes or suffixes of the words. We would then end up with entries such as: or [ type: verb language: English stem: carry mood: indicative tense: present perfect voice: active person: 3rd number: singular unicharstring: "has carried" ] [ type: noun language: French stem: pomme gender: feminine number: plural unicharstring: "pommes" ] Should the system not be able to parse such a word/phrase, then it will store only its unicharstring until it is appropriately updated. • Parse trees: The result of the natural language parsing of a sentence is a richer text structure that is often encoded in a tree structure. Below is a possible parse tree for the sentence “Mary seems to sleep.”, first presented in the section on AVMs (§2): [ type: sentence NP: Mary VP: [ type: verbPhrase V: seems VP: [ type: verbPhrase Aux: to VP: [ type: verb V: sleep ]]]] • Hierarchical document structure: The traditional book with frontmatter, chapters, sections and subsections is a typical example of a document tree. This hierarchy can be extended downwards to paragraphs, sentences, phrases, words and characters. • Attribute-value matrices: As explained in §2, these contain shared structures. Below is the AVM for the last example sentence. [ type: AVMentries numberEntries: 3 1: [ type: AVM subj: 2 comp: 3 pred: seem tense: pres ] 2: [ type: AVM agr: [ type: AVM pers: 3rd num: sg ] pred: mary ] 3: [ type: AVM subj: 2 pred: sleep tense: none ] ] • Tables: The encoding of tables by Wang and Wood is our final example of the model. Here is a possible encoding, where the dimensions are allowed to range over a set of possible values in order to encode the boxed values. [ type: WWtable [ type: WWindex year: 1991 term: Winter mark: Assignments.Ass1 ] : 85 ... [ type: WWindex year: 1991 term: Winter..Fall mark: Assignments.Ass3 ] : 75 ... [ type: WWindex year: 1992 term: Winter..Spring mark: Assignments.Ass3..Midterm ] : 70 ... [ type: WWindex year: 1992 term: Fall mark: Grade ] : 70 ] 478 TUGboat, Volume 29 (2008), No. 3 — Proceedings of the 2008 Annual Meeting
5 Conclusions The model introduced in this paper, based on general tuples, is as simple as possible whilst being flexible enough to encode a large range of different approaches to the study and manipulation of text in all of its forms, as well as to support the encoding and linguistic tools such as language dictionaries. However, the real power of the model is the idea of the index, built right into the model, which provides access to any piece of data, thereby supporting the specification of algorithms and hypertextlike links between document components. The infinite index sets correspond to iterators into containers, as used, for example, in the C++ STL (Standard Template Library) for generic programming. Furthermore, using these sets it is even possible that certain tuples are, conceptually, countable infinite (like lists in a functional programming language), with the components being evaluated in a lazy manner, on-demand. In future papers we shall show how this unifying data model makes it easy to combine in a single system myriad ways of editing, storing, manipulating and presenting text and to manipulate all of these together. References Multidimensional text [1] R. A. Bailey, Cheryl E. Praeger, C.A. Rowley, and T. P. Speed. Generalized wreath products of permutation groups. Proc. Lond. Math. Soc., s3–47(1):69–82, July 1983. [2] Gábor Bella. Modélisation du texte numérique multilingue: vers des modèles généraux et extensibles fondés sur le concept de textème. PhD thesis, Télécom Bretagne, Brest, France, 2008. [3] Mark Johnson. Attribute-Value Logic and the Theory of Grammar. Center for the Study of Language and Information, Stanford University, 1988. [4] Blanca Mancilla and John Plaice. Possible worlds versioning. Mathematics in Computer Science, 2008. In press. [5] John Plaice and Chris Rowley. Characters are not simply names, nor documents trees. In Glyph and Typesetting Workshop, East Asian Center for Informatics in Humanities, Kyoto University, 2003. http://coe21.zinbun.kyoto-u.ac.jp/ papers/ws-type-2003/009-plaice.pdf. [6] Chris Rowley and John Plaice. New directions in document formatting: What is text? In Glyph and Typesetting Workshop, East Asian Center for Informatics in Humanities, Kyoto University, 2003. http://coe21.zinbun.kyoto-u.ac.jp/ papers/ws-type-2003/001-rowley.pdf. [7] Xinxin Wang and Derick Wood. A conceptual model for tables. In Ethan V. Munson, Charles K. Nicholas, and Derick Wood, editors, PODDP, volume 1481 of Lecture Notes in Computer Science, pages 10–23. Springer, 1998. TUGboat, Volume 29 (2008), No. 3 — Proceedings of the 2008 Annual Meeting 479
Page 1 and 2:
The Communications of the TEX Users
Page 3 and 4:
TUG2008 Proceedings University Coll
Page 5 and 6:
TUG 2008—program Monday, July 21
Page 7 and 8:
At the reception. Around the front
Page 9 and 10:
Taco Hoekwater, inside the Beamish
Page 11 and 12:
Another, equally large, disadvantag
Page 13 and 14:
This “saves” the original \text
Page 15 and 16:
Figure 5: Macro result pushed back
Page 17 and 18:
TEXworks: Lowering the barrier to e
Page 19 and 20:
Direct and reverse synchronization
Page 21 and 22:
The TEXnical terms used to describe
Page 23 and 24:
6.2 An orthogonal implementation On
Page 25 and 26:
In fact, the text editors and the v
Page 27 and 28:
albanian greek norwegian belarusian
Page 29 and 30:
input manually, but are generated b
Page 31 and 32:
1.2 Commercially available software
Page 33 and 34:
If L ATEX can fit the snippet into
Page 35 and 36:
Pascal MetaPost, but using CWEB as
Page 37 and 38:
The TEX-Lua mix Hans Hagen Pragma A
Page 39 and 40:
\setbox0=\hbox{x}\the\wd0 In Lua we
Page 41 and 42:
start.char = uc return true end end
Page 43 and 44:
stream-based approach, this time th
Page 45 and 46:
example is support for OpenType fon
Page 47 and 48:
typesetting system is TEX [4] creat
Page 49 and 50:
13. Image conversion from various f
Page 51 and 52:
the mapping file example.paraStyleN
Page 53 and 54:
The second author accepts or reject
Page 55 and 56:
Languages for bibliography styles J
Page 57 and 58:
@STRING{srd = {Stephen Reeder Donal
Page 59 and 60:
# # standard footnote format (latex
Page 61 and 62:
. , \bbled \bbleds .
Page 63 and 64:
Languages for bibliography styles (
Page 65 and 66:
References [1] James C. Alexander:
Page 67 and 68:
Vistas for TEX: liberate the typogr
Page 69 and 70:
- even direct formatting instructio
Page 71 and 72:
e that quick, simple and clear rend
Page 73 and 74:
see that there are slight differenc
Page 75 and 76:
Creating cuneiform fonts with MetaT
Page 77 and 78:
Definition of encoding (Unicode) Pl
Page 79 and 80:
epresentation with proper path dire
Page 81 and 82: When it came to implementing the T1
Page 83 and 84: 4.3 OpenType math in new TEX engine
Page 85 and 86: However, there have always been exc
Page 87 and 88: [2] Nelson Beebe: Character set enc
Page 89 and 90: Meta-designing parameterized Arabic
Page 91 and 92: on the pen direction at each point
Page 93 and 94: % Description for isolated ’alif
Page 95 and 96: Figure 15: Tracing a word from left
Page 97 and 98: Table 1 shows the MOS scores for in
Page 99 and 100: P3 P3 P3 Q2 Q2 Q2 � � W3 W3 W3
Page 101 and 102: abridged form, it looks like this:
Page 103 and 104: with extensions is still somewhat m
Page 105 and 106: local rx, ry = second.y_coord - ty,
Page 107 and 108: \startreusableMPgraphic{name}... \s
Page 109 and 110: the macro \testengine sees two argu
Page 111 and 112: and exhyph-uk.tex, respectively. Th
Page 113 and 114: stand for markers of semiconsonants
Page 115 and 116: y finite state transducers (FSTs).
Page 117 and 118: local p = hpack(copy(h.list)) lastl
Page 119 and 120: with PDF documents. Several new tec
Page 121 and 122: Advanced features for publishing ma
Page 125 and 126: — — — — — — — — Fig
Page 129 and 130: telegraph. The relatively recent di
Page 131: 1: [ type: unichar, code: 0073 ] ]
Page 135 and 136: 4 Why TEX files and not other marku
Page 137 and 138: The galley Module or: How I Learned
Page 139: TUGboat, Volume 29 (2008), No. 3 48
Page 142 and 143: 488 TUGboat, Volume 29 (2008), No.
Page 144 and 145: TUGBOAT Volume 29 (2008), No. 3 Tab
show all

The Communications of the TEX Users Group Volume 29 ... - TUG

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?