GODDAG: A Data Structure for Overlapping Hierarchies

Sperberg‐McQueen, C. M.; Huitfeldt, Claus

doi:10.1007/978-3-540-39916-2_12

Cited by 37 publications

(40 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Again, [59] compare state of the art in overlapping markup approaches, including alternatives to XML's data model (e.g. a directed acyclic graph structure (GODDAG, [45]) over the XML inherent tree) and its notation. In addition, the Prolog fact base approach discussed by [54,55] or adding delay nodes to the XQuery 1.0 and XPath 2.0 Data Model (XDM) as virtual representation of nodes proposed by [29] allowing different nodes to share children describe other non-XML based specifications.…”

Section: Representation Formatsmentioning

confidence: 99%

Integrated Linguistic Annotation Models and Their Application in the Domain of Antecedent Detection

Witt

Stührenberg

Goecke

et al. 2011

Modeling, Learning, and Processing of Text Technological Data Structures

View full text Add to dashboard Cite

Abstract. Seamless integration of various, often heterogeneous linguistic resources in terms of their output formats and a combined analysis of the respective annotation layers are crucial tasks for linguistic research. After a decade of concentration on the development of formats to structure single annotations for specific linguistic issues, in the last years a variety of specifications to store multiple annotations over the same primary data has been developed. The paper focuses on the integration of the knowledge resource logical document structure information into a text document to enhance the task of automatic anaphora resolution both for the task of candidate detection and antecedent selection. The paper investigates data structures necessary for knowledge integration and retrieval. IntroductionAnaphora Resolution (AR) describes the process of identifying the correct antecedent for a given anaphoric element and, in general, consists of three steps: (1) identification of anaphoric elements, (2) creation of a candidate set for each anaphora and (3) detection of the correct antecedent from the candidate set. In this paper we will focus on the second and third step and we will investigate the question how to create an appropriate candidate set.In recent approaches that define anaphora resolution as a pairwise decision, the candidate set is created by choosing all candidates that precede a given anaphora

show abstract

Section: Representation Formatsmentioning

confidence: 99%

Integrated Linguistic Annotation Models and Their Application in the Domain of Antecedent Detection

Witt

Stührenberg

Goecke

et al. 2011

Modeling, Learning, and Processing of Text Technological Data Structures

View full text Add to dashboard Cite

show abstract

“…First, a historical solution: CONCUR [7], then adhoc solutions as proposed by the TEI (Text Encoding Initiative) consortium [4], next models not compatible with the XML language ( [8], [15], [13], [16]), finally those compatible with XML ( [14], [10], [3], [12], [1]). Each solution is analysed according to six dimensions: expressiveness of the model determines if there is an explicitly defined model and if it responds to the problem of static representation of multistructured documents ; genericity of the model determines, when a model exists, if we can modify it in order to manage problems outside of the initial scope of multi-structured documents representation ; quality of the implementation measures the care taken to develop an effective implementationa ; compatibility with XML tools determines if it is possible to integrate the solution with the numerous existing XML tools used to manage XML documents (especially typing tools such as XML Schemas, ...) ; query mechanisms for multistructured documents ; change management in data or structures, analyses if the model is robust to change.…”

Section: Existing Solutionsmentioning

confidence: 99%

Creation and maintenance of multi-structured documents

Portier

Calabretto

2009

Proceedings of the 9th ACM Symposium on Document Engineering

View full text Add to dashboard Cite

In this article, we introduce a new problem: the construction of multi-structured documents. We first offer an overview of existing solutions to the representation of such documents. We then notice that none of them consider the problem of their construction. In this context, we use our experience with philosophers who are building a digital edition of the work of Jean-Toussaint Desanti, in order to present a methodology for the construction of multi-structured documents. This methodology is based on the MSDM model in order to represent such documents. Moreover each step of the methodology has been implemented in the Haskell functional programming language.

show abstract

“…KyGODDAG (KyGODDAG is derived from a more generic GODDAG data structure [4]) combines the DOM trees for each individual hierarchy in one structure with shared root and content. We have also extended XPath, to path expressions over KyGODDAG [1].…”

Section: Definition An Xml View Of An Xml Document D Is a Set Of Nodesmentioning

confidence: 99%