Testing Structural Properties in Textual Data: Beyond Document Grammars.

Schema languages concentrate on grammatical constraints on document structures, i.e. hierarchical relations between elements in a tree-like structure. In this paper, we complement this concept with a methodology for defining and applying structural constraints from the perspective of a single elemen...

Descripción completa

Detalles Bibliográficos
Publicado en:Literary & Linguistic Computing Vol. 18; no. 1; pp. 89 - 101
Autores principales: F. Sasaki, J. Pönninghaus
Formato: Artículo
Publicado: Oxford University Press / USA Apr2003
Materias:
Acceso en línea:Ver este registro en EBSCOhost
fields @attributes:
  recordID: 1
pdfLink:
plink: https://search.ebscohost.com/login.aspx?direct=true&db=hlh&AN=10500912&site=ehost-live
header:
  @attributes:
    shortDbName: hlh
    uiTerm: 10500912
    longDbName: Humanities International Complete
    uiTag: AN
  controlInfo:
    bkinfo:
    jinfo:
      jid:
        02681145
        BJ1
      jtl: Literary & Linguistic Computing
      issn: 02681145
      maglogo: N
    pubinfo:
      dt: Apr2003
      vid: 18
      iid: 1
      pid: 622
      pub: Oxford University Press / USA
    artinfo:
      ui:
        10500912
        10.1093/llc/18.1.89
      ppf: 89
      ppct: 12
      formats:
        fmt:
          @attributes:
            type: P
            size: 361KB
      tig:
        atl: Testing Structural Properties in Textual Data: Beyond Document Grammars.
      aug:
        au:
          F. Sasaki
          J. Pönninghaus
        affil: University of Bielefeld, Germany
      su:
        Programming languages
        Linguistics
      sug:
        subj:
          Programming languages
          Linguistics
      ab: Schema languages concentrate on grammatical constraints on document structures, i.e. hierarchical relations between elements in a tree-like structure. In this paper, we complement this concept with a methodology for defining and applying structural constraints from the perspective of a single element. These constraints can be used in addition to the existing constraints of a document grammar. There is no need to change the document grammar. Using a hierarchy of descriptions of such constraints allows for a classification of elements. These are important features for tasks such as visualizing, modelling, querying, and checking consistency in textual data. A document containing descriptions of such constraints we call a 'context specification document' (CSD). We describe the basic ideas of a CSD, its formal properties, the path language we are currently using, and related approaches. Then we show how to create and use a CSD. We give two example applications for a CSD. Modelling co-referential relations between textual units with a CSD can help to maintain consistency in textual data and to explore the linguistic properties of co-reference. In the area of textual, non-hierarchical annotation, several annotations can be held in one document and interrelated by the CSD. In the future we want to explore the relation and interaction between the underlying path language of the CSD and document grammars.
      pubtype: Academic Journal
      doctype: Article
      src: R
    language: English
    refInfo:
    copyright:
      @attributes:
        flag: Y
      custom: © 2019 EADH: The European Association for Digital Humanities.
      item: Literary & Linguistic Computing
      holder: Oxford University Press / USA
      dt:
        @attributes:
          year: 2003
    holdings:
      @attributes:
        islocal: N