Concurrent document hierarchies in MECS and SGML
Identifieur interne : 000243 ( Istex/Corpus ); précédent : 000242; suivant : 000244Concurrent document hierarchies in MECS and SGML
Auteurs : Cm Sperberg-Mcqueen ; C. HuitfeldtSource :
- Literary and Linguistic Computing [ 0268-1145 ] ; 1999-04.
Abstract
Applications of computers to humanistic research rely increasingly on SGML or XML markup; it is a persistent challenge to find suitable representations in these tree-based formalisms, for the overlap of textual features. SGML lends itself to a straightforward data model with a simple relationship between markup (element and attributes) and features or structures in the text. Barnard et al. (Computers and the Humanities, 22: 265-76, 1988; 29: 21131, 1995) and TEI (Guidelines for Electronic Text Encoding and Interchange, 1994) have presented methods for registering the existence of overlap using SGML notations, but these methods are often felt to be unsatisfactory, in part (we argue) because they complicate the otherwise straightforward SGML data model. The MECS and CONCUR notations described here allow the straightforward markup of overlapping textual features. CONCUR further allows the formulation of useful document grammars for concurrent hierarchies of textual features. The theoretical and practical advantages outweigh the practical disadvantages, and the humanities computing community should begin serious experimentation with CONCUR.
Url:
DOI: 10.1093/llc/14.1.29
Links to Exploration step
ISTEX:0CF08E6CBA7184C71238BFA20A2CE6C7DC1B7745Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Concurrent document hierarchies in MECS and SGML</title><author><name sortKey="Sperberg Mcqueen, Cm" sort="Sperberg Mcqueen, Cm" uniqKey="Sperberg Mcqueen C" first="Cm" last="Sperberg-Mcqueen">Cm Sperberg-Mcqueen</name><affiliation><mods:affiliation>Corresponding author at: Computer Center (M/C 135), University of Illinois at Chicago, 1940 W Taylor St, Room 124, Chicago, IL 60612-72352, USA. E-mail: cmsmcq@acm.org</mods:affiliation></affiliation><affiliation><mods:affiliation>The Wittgenstein Archives at the University of Bergen, Norway</mods:affiliation></affiliation></author><author><name sortKey="Huitfeldt, C" sort="Huitfeldt, C" uniqKey="Huitfeldt C" first="C" last="Huitfeldt">C. Huitfeldt</name><affiliation><mods:affiliation>The Wittgenstein Archives at the University of Bergen, Norway</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:0CF08E6CBA7184C71238BFA20A2CE6C7DC1B7745</idno><date when="1999" year="1999">1999</date><idno type="doi">10.1093/llc/14.1.29</idno><idno type="url">https://api.istex.fr/document/0CF08E6CBA7184C71238BFA20A2CE6C7DC1B7745/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000243</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Concurrent document hierarchies in MECS and SGML</title><author><name sortKey="Sperberg Mcqueen, Cm" sort="Sperberg Mcqueen, Cm" uniqKey="Sperberg Mcqueen C" first="Cm" last="Sperberg-Mcqueen">Cm Sperberg-Mcqueen</name><affiliation><mods:affiliation>Corresponding author at: Computer Center (M/C 135), University of Illinois at Chicago, 1940 W Taylor St, Room 124, Chicago, IL 60612-72352, USA. E-mail: cmsmcq@acm.org</mods:affiliation></affiliation><affiliation><mods:affiliation>The Wittgenstein Archives at the University of Bergen, Norway</mods:affiliation></affiliation></author><author><name sortKey="Huitfeldt, C" sort="Huitfeldt, C" uniqKey="Huitfeldt C" first="C" last="Huitfeldt">C. Huitfeldt</name><affiliation><mods:affiliation>The Wittgenstein Archives at the University of Bergen, Norway</mods:affiliation></affiliation></author></analytic><monogr></monogr><series><title level="j">Literary and Linguistic Computing</title><title level="j" type="abbrev">Lit Linguist Computing</title><idno type="ISSN">0268-1145</idno><idno type="eISSN">1477-4615</idno><imprint><publisher>Oxford University Press</publisher><date type="published" when="1999-04">1999-04</date><biblScope unit="volume">14</biblScope><biblScope unit="issue">1</biblScope><biblScope unit="page" from="29">29</biblScope><biblScope unit="page" to="42">42</biblScope></imprint><idno type="ISSN">0268-1145</idno></series><idno type="istex">0CF08E6CBA7184C71238BFA20A2CE6C7DC1B7745</idno><idno type="DOI">10.1093/llc/14.1.29</idno><idno type="local">5</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0268-1145</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Applications of computers to humanistic research rely increasingly on SGML or XML markup; it is a persistent challenge to find suitable representations in these tree-based formalisms, for the overlap of textual features. SGML lends itself to a straightforward data model with a simple relationship between markup (element and attributes) and features or structures in the text. Barnard et al. (Computers and the Humanities, 22: 265-76, 1988; 29: 21131, 1995) and TEI (Guidelines for Electronic Text Encoding and Interchange, 1994) have presented methods for registering the existence of overlap using SGML notations, but these methods are often felt to be unsatisfactory, in part (we argue) because they complicate the otherwise straightforward SGML data model. The MECS and CONCUR notations described here allow the straightforward markup of overlapping textual features. CONCUR further allows the formulation of useful document grammars for concurrent hierarchies of textual features. The theoretical and practical advantages outweigh the practical disadvantages, and the humanities computing community should begin serious experimentation with CONCUR.</div></front></TEI><istex><corpusName>oup</corpusName><author><json:item><name>CM Sperberg-McQueen</name><affiliations><json:string>Corresponding author at: Computer Center (M/C 135), University of Illinois at Chicago, 1940 W Taylor St, Room 124, Chicago, IL 60612-72352, USA. E-mail: cmsmcq@acm.org</json:string><json:string>The Wittgenstein Archives at the University of Bergen, Norway</json:string></affiliations></json:item><json:item><name>C Huitfeldt</name><affiliations><json:string>The Wittgenstein Archives at the University of Bergen, Norway</json:string></affiliations></json:item></author><language><json:string>eng</json:string></language><originalGenre><json:string>research-article</json:string></originalGenre><abstract>Applications of computers to humanistic research rely increasingly on SGML or XML markup; it is a persistent challenge to find suitable representations in these tree-based formalisms, for the overlap of textual features. SGML lends itself to a straightforward data model with a simple relationship between markup (element and attributes) and features or structures in the text. Barnard et al. (Computers and the Humanities, 22: 265-76, 1988; 29: 21131, 1995) and TEI (Guidelines for Electronic Text Encoding and Interchange, 1994) have presented methods for registering the existence of overlap using SGML notations, but these methods are often felt to be unsatisfactory, in part (we argue) because they complicate the otherwise straightforward SGML data model. The MECS and CONCUR notations described here allow the straightforward markup of overlapping textual features. CONCUR further allows the formulation of useful document grammars for concurrent hierarchies of textual features. The theoretical and practical advantages outweigh the practical disadvantages, and the humanities computing community should begin serious experimentation with CONCUR.</abstract><qualityIndicators><score>6.956</score><pdfVersion>1.3</pdfVersion><pdfPageSize>521 x 703 pts</pdfPageSize><refBibsNative>false</refBibsNative><keywordCount>0</keywordCount><abstractCharCount>1154</abstractCharCount><pdfWordCount>5692</pdfWordCount><pdfCharCount>33339</pdfCharCount><pdfPageCount>14</pdfPageCount><abstractWordCount>163</abstractWordCount></qualityIndicators><title>Concurrent document hierarchies in MECS and SGML</title><genre><json:string>research-article</json:string></genre><host><volume>14</volume><publisherId><json:string>litlin</json:string></publisherId><pages><last>42</last><first>29</first></pages><issn><json:string>0268-1145</json:string></issn><issue>1</issue><genre><json:string>journal</json:string></genre><language><json:string>unknown</json:string></language><eissn><json:string>1477-4615</json:string></eissn><title>Literary and Linguistic Computing</title></host><categories><wos><json:string>LINGUISTICS</json:string><json:string>LITERATURE</json:string></wos></categories><publicationDate>1999</publicationDate><copyrightDate>1999</copyrightDate><doi><json:string>10.1093/llc/14.1.29</json:string></doi><id>0CF08E6CBA7184C71238BFA20A2CE6C7DC1B7745</id><score>0.20111065</score><fulltext><json:item><original>true</original><mimetype>application/pdf</mimetype><extension>pdf</extension><uri>https://api.istex.fr/document/0CF08E6CBA7184C71238BFA20A2CE6C7DC1B7745/fulltext/pdf</uri></json:item><json:item><original>false</original><mimetype>application/zip</mimetype><extension>zip</extension><uri>https://api.istex.fr/document/0CF08E6CBA7184C71238BFA20A2CE6C7DC1B7745/fulltext/zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/document/0CF08E6CBA7184C71238BFA20A2CE6C7DC1B7745/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Concurrent document hierarchies in MECS and SGML</title><respStmt xml:id="ISTEX-API" resp="Références bibliographiques récupérées via GROBID" name="ISTEX-API (INIST-CNRS)"></respStmt><respStmt xml:id="ISTEX-API" resp="Références bibliographiques récupérées via GROBID" name="ISTEX-API (INIST-CNRS)"></respStmt><respStmt><resp>Références bibliographiques récupérées via GROBID</resp><name resp="ISTEX-API">ISTEX-API (INIST-CNRS)</name></respStmt></titleStmt><publicationStmt><authority>ISTEX</authority><publisher>Oxford University Press</publisher><availability><p>OUP</p></availability><date>1999</date></publicationStmt><sourceDesc><biblStruct type="inbook"><analytic><title level="a" type="main" xml:lang="en">Concurrent document hierarchies in MECS and SGML</title><author><persName><forename type="first">CM</forename><surname>Sperberg-McQueen</surname></persName><email>cmsmcq@acm.org</email><affiliation>The Wittgenstein Archives at the University of Bergen, Norway</affiliation></author><author><persName><forename type="first">C</forename><surname>Huitfeldt</surname></persName><affiliation>The Wittgenstein Archives at the University of Bergen, Norway</affiliation></author></analytic><monogr><title level="j">Literary and Linguistic Computing</title><title level="j" type="abbrev">Lit Linguist Computing</title><idno type="pISSN">0268-1145</idno><idno type="eISSN">1477-4615</idno><imprint><publisher>Oxford University Press</publisher><date type="published" when="1999-04"></date><biblScope unit="volume">14</biblScope><biblScope unit="issue">1</biblScope><biblScope unit="page" from="29">29</biblScope><biblScope unit="page" to="42">42</biblScope></imprint></monogr><idno type="istex">0CF08E6CBA7184C71238BFA20A2CE6C7DC1B7745</idno><idno type="DOI">10.1093/llc/14.1.29</idno><idno type="local">5</idno></biblStruct></sourceDesc></fileDesc><profileDesc><creation><date>1999</date></creation><langUsage><language ident="en">en</language></langUsage><abstract xml:lang="en"><p>Applications of computers to humanistic research rely increasingly on SGML or XML markup; it is a persistent challenge to find suitable representations in these tree-based formalisms, for the overlap of textual features. SGML lends itself to a straightforward data model with a simple relationship between markup (element and attributes) and features or structures in the text. Barnard et al. (Computers and the Humanities, 22: 265-76, 1988; 29: 21131, 1995) and TEI (Guidelines for Electronic Text Encoding and Interchange, 1994) have presented methods for registering the existence of overlap using SGML notations, but these methods are often felt to be unsatisfactory, in part (we argue) because they complicate the otherwise straightforward SGML data model. The MECS and CONCUR notations described here allow the straightforward markup of overlapping textual features. CONCUR further allows the formulation of useful document grammars for concurrent hierarchies of textual features. The theoretical and practical advantages outweigh the practical disadvantages, and the humanities computing community should begin serious experimentation with CONCUR.</p></abstract></profileDesc><revisionDesc><change when="1999-04">Published</change><change xml:id="refBibs-istex" who="#ISTEX-API" when="2016-3-14">References added</change><change xml:id="refBibs-istex" who="#ISTEX-API" when="2016-3-21">References added</change><change xml:id="refBibs-istex" who="#ISTEX-API" when="2016-07-27">References added</change></revisionDesc></teiHeader></istex:fulltextTEI><json:item><original>false</original><mimetype>text/plain</mimetype><extension>txt</extension><uri>https://api.istex.fr/document/0CF08E6CBA7184C71238BFA20A2CE6C7DC1B7745/fulltext/txt</uri></json:item></fulltext><metadata><istex:metadataXml wicri:clean="corpus oup" wicri:toSee="no header"><istex:xmlDeclaration>version="1.0" encoding="US-ASCII"</istex:xmlDeclaration><istex:docType PUBLIC="-//NLM//DTD Journal Publishing DTD v2.3 20070202//EN" URI="journalpublishing.dtd" name="istex:docType"></istex:docType><istex:document><article xml:lang="en" article-type="research-article"><front><journal-meta><journal-id journal-id-type="publisher-id">litlin</journal-id><journal-id journal-id-type="hwp">litlin</journal-id><journal-title>Literary and Linguistic Computing</journal-title><abbrev-journal-title abbrev-type="publisher">Lit Linguist Computing</abbrev-journal-title><issn pub-type="ppub">0268-1145</issn><issn pub-type="epub">1477-4615</issn><publisher><publisher-name>Oxford University Press</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="other">5</article-id><article-id pub-id-type="doi">10.1093/llc/14.1.29</article-id><article-categories><subj-group subj-group-type="heading"><subject>Article</subject></subj-group></article-categories><title-group><article-title>Concurrent document hierarchies in MECS and SGML</article-title></title-group><contrib-group><contrib contrib-type="author"><name><surname>Sperberg-McQueen</surname><given-names>CM</given-names></name><xref rid="Z">Z</xref></contrib><contrib contrib-type="author"><name><surname>Huitfeldt</surname><given-names>C</given-names></name></contrib><aff> The Wittgenstein Archives at the University of Bergen, Norway <target target-type="aff" id="Z"></target><label>Z</label>Corresponding author at: Computer Center (M/C 135), University of Illinois at Chicago, 1940 W Taylor St, Room 124, Chicago, IL 60612-72352, USA. E-mail: cmsmcq@acm.org </aff></contrib-group><pub-date pub-type="ppub"><month>04</month><year>1999</year></pub-date><volume>14</volume><issue>1</issue><fpage>29</fpage><lpage>42</lpage><permissions><copyright-statement>Copyright 1999</copyright-statement><copyright-year>1999</copyright-year></permissions><abstract xml:lang="en"><p>Applications of computers to humanistic research rely increasingly on SGML or XML markup; it is a persistent challenge to find suitable representations in these tree-based formalisms, for the overlap of textual features. SGML lends itself to a straightforward data model with a simple relationship between markup (element and attributes) and features or structures in the text. Barnard <italic>et al. (Computers and the Humanities</italic>, 22: 265-76, 1988; 29: 21131, 1995) and TEI (<italic>Guidelines for Electronic Text Encoding and Interchange</italic>, 1994) have presented methods for registering the existence of overlap using SGML notations, but these methods are often felt to be unsatisfactory, in part (we argue) because they complicate the otherwise straightforward SGML data model. The MECS and CONCUR notations described here allow the straightforward markup of overlapping textual features. CONCUR further allows the formulation of useful document grammars for concurrent hierarchies of textual features. The theoretical and practical advantages outweigh the practical disadvantages, and the humanities computing community should begin serious experimentation with CONCUR.</p></abstract><custom-meta-wrap><custom-meta><meta-name>hwp-legacy-fpage</meta-name><meta-value>29</meta-value></custom-meta><custom-meta><meta-name>hwp-legacy-dochead</meta-name><meta-value>Article</meta-value></custom-meta></custom-meta-wrap></article-meta></front></article></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>Concurrent document hierarchies in MECS and SGML</title></titleInfo><titleInfo type="alternative" lang="en" contentType="CDATA"><title>Concurrent document hierarchies in MECS and SGML</title></titleInfo><name type="personal"><namePart type="given">CM</namePart><namePart type="family">Sperberg-McQueen</namePart><affiliation>Corresponding author at: Computer Center (M/C 135), University of Illinois at Chicago, 1940 W Taylor St, Room 124, Chicago, IL 60612-72352, USA. E-mail: cmsmcq@acm.org</affiliation><affiliation>The Wittgenstein Archives at the University of Bergen, Norway</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">C</namePart><namePart type="family">Huitfeldt</namePart><affiliation>The Wittgenstein Archives at the University of Bergen, Norway</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre type="research-article" displayLabel="research-article"></genre><originInfo><publisher>Oxford University Press</publisher><dateIssued encoding="w3cdtf">1999-04</dateIssued><copyrightDate encoding="w3cdtf">1999</copyrightDate></originInfo><language><languageTerm type="code" authority="iso639-2b">eng</languageTerm><languageTerm type="code" authority="rfc3066">en</languageTerm></language><physicalDescription><internetMediaType>text/html</internetMediaType></physicalDescription><abstract lang="en">Applications of computers to humanistic research rely increasingly on SGML or XML markup; it is a persistent challenge to find suitable representations in these tree-based formalisms, for the overlap of textual features. SGML lends itself to a straightforward data model with a simple relationship between markup (element and attributes) and features or structures in the text. Barnard et al. (Computers and the Humanities, 22: 265-76, 1988; 29: 21131, 1995) and TEI (Guidelines for Electronic Text Encoding and Interchange, 1994) have presented methods for registering the existence of overlap using SGML notations, but these methods are often felt to be unsatisfactory, in part (we argue) because they complicate the otherwise straightforward SGML data model. The MECS and CONCUR notations described here allow the straightforward markup of overlapping textual features. CONCUR further allows the formulation of useful document grammars for concurrent hierarchies of textual features. The theoretical and practical advantages outweigh the practical disadvantages, and the humanities computing community should begin serious experimentation with CONCUR.</abstract><relatedItem type="host"><titleInfo><title>Literary and Linguistic Computing</title></titleInfo><titleInfo type="abbreviated"><title>Lit Linguist Computing</title></titleInfo><genre type="journal">journal</genre><identifier type="ISSN">0268-1145</identifier><identifier type="eISSN">1477-4615</identifier><identifier type="PublisherID">litlin</identifier><identifier type="PublisherID-hwp">litlin</identifier><part><date>1999</date><detail type="volume"><caption>vol.</caption><number>14</number></detail><detail type="issue"><caption>no.</caption><number>1</number></detail><extent unit="pages"><start>29</start><end>42</end></extent></part></relatedItem><identifier type="istex">0CF08E6CBA7184C71238BFA20A2CE6C7DC1B7745</identifier><identifier type="DOI">10.1093/llc/14.1.29</identifier><identifier type="local">5</identifier><accessCondition type="use and reproduction" contentType="copyright">Copyright 1999</accessCondition><recordInfo><recordContentSource>OUP</recordContentSource></recordInfo></mods></metadata><enrichments><istex:catWosTEI uri="https://api.istex.fr/document/0CF08E6CBA7184C71238BFA20A2CE6C7DC1B7745/enrichments/catWos"><teiHeader><profileDesc><textClass><classCode scheme="WOS">LINGUISTICS</classCode><classCode scheme="WOS">LITERATURE</classCode></textClass></profileDesc></teiHeader></istex:catWosTEI><json:item><type>refBibs</type><uri>https://api.istex.fr/document/0CF08E6CBA7184C71238BFA20A2CE6C7DC1B7745/enrichments/refBibs</uri></json:item></enrichments><serie></serie></istex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Ticri/explor/TeiVM2/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000243 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 000243 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Ticri
|area= TeiVM2
|flux= Istex
|étape= Corpus
|type= RBID
|clé= ISTEX:0CF08E6CBA7184C71238BFA20A2CE6C7DC1B7745
|texte= Concurrent document hierarchies in MECS and SGML
}}
| This area was generated with Dilib version V0.6.31. |  |