Modular Ontology Modeling

Total Page:16

File Type:pdf, Size:1020Kb

Modular Ontology Modeling Semantic Web 0 (2021) 1–0 1 IOS Press 1 1 2 2 3 3 4 Modular Ontology Modeling 4 5 5 6 6 a b a 7 Cogan Shimizu Karl Hammar Pascal Hitzler 7 a 8 Department of Computer Science, Kansas State University, USA 8 b 9 Department of Computer Science, Jönköping University, Sweden 9 10 10 11 11 12 12 13 13 Abstract. Reusing ontologies for new purposes, or adapting them to new use-cases, is frequently difficult. In our experiences, 14 14 we have found this to be the case for several reasons: (i) differing representational granularity in ontologies and in use-cases, 15 15 (ii) lacking conceptual clarity in potentially reusable ontologies, (iii) lack and difficulty of adherence to good modeling princi- 16 ples, and (iv) a lack of reuse emphasis and process support available in ontology engineering tooling. In order to address these 16 17 concerns, we have developed the Modular Ontology Modeling (MOMo) methodology, and its supporting tooling infrastructure, 17 18 CoModIDE (the Comprehensive Modular Ontology IDE – “commodity”). MOMo builds on the established eXtreme Design 18 19 methodology, and like it emphasizes modular development and design pattern reuse; but crucially adds the extensive use of 19 20 graphical schema diagrams, and tooling that support them, as vehicles for knowledge elicitation from experts. In this paper, we 20 21 present the MOMo workflow in detail, and describe several experiences in executing it. We provide a thorough and rigorous eval- 21 22 uation of CoModIDE in its role of supporting the MOMo methodology’s graphical modeling paradigm. We find that CoModIDE 22 23 significantly improves approachability of such a paradigm, and that it displays a high usability. 23 24 24 Keywords: keywords 25 25 26 26 27 27 28 1. Introduction fering representational granularity, (ii) lack of concep- 28 29 29 tual clarity in many ontologies, (iii) lack and difficulty 30 30 Over the last two decades, ontologies have seen wide- of adherence to established good modeling principles, 31 31 spread use for a variety of purposes. Some of them, and (iv) lack of re-use emphasis and process support 32 32 such as the Gene Ontology [1], have found significant in available ontology engineering tooling. We explain 33 33 use by third parties. However, the majority of ontolo- 34 these aspects in more detail in the following. As a rem- 34 gies have seen hardly any re-use outside the use cases 35 edy for these issues, we propose tool-supported modu- 35 for which they were originally designed [2]. 36 larization, in a specific sense which we also explain in 36 detail. 37 It behooves us to ask why this is the case, in partic- 37 38 38 ular, since the heavy re-use of ontologies was part of Representational granularity refers to modeling choices 39 39 the original conception for the Semantic Web field. In- which determine the level of detail to be included in 40 40 deed, many use cases have high topic overlap, so that the ontology, and thus in the data (knowledge) graph. 41 41 a re-use of ontologies on similar topics should, in prin- As an example, one model may simply refer to temper- 42 ciple, lower development cost. However, according to 42 43 atures at specific space-time locations. Another model 43 our experience, it is often much easier to develop a may also record an uncertainty interval. A third model 44 new ontology from scratch, than it is to try to re-use 44 may also record information about the measurement 45 and adapt an existing ontology. We can observe that 45 instrument, while a fourth may furthermore record cal- 46 this sentiment is likely shared by many others, as the 46 ibration data for said instrument. Another example 47 new development of an ontology so often seems to be 47 48 may be population figures for cities; the values are fre- 48 preferred over adapting an existing one. 49 quently estimated through the use of statistical mod- 49 50 We posit, based on our experience, that four of the els. That is, depending on the data and which statistical 50 51 major issues preventing wide-spread re-use are (i) dif- model was used, different figures would be calculated. 51 1570-0844/21/$35.00 © 2021 – IOS Press and the authors. All rights reserved 2 C. Shimizu, K. Hammar, P. Hitzler / 1 Note that a fine-grained ontology can be populated By definition, an ontology with high conceptual clar- 1 2 with coarse-granularity data; the converse is not true. ity will be much easier to re-use, simply because it 2 3 If a use case requires fine-granularity data, a coarse- is much easier to understand the ontology in the first 3 4 grained ontology is essentially useless. On the other place. Thus, a key quest for ontology research is to de- 4 5 hand, using a fine-grained ontology for a use case that velop ontology modeling methodologies which make 5 6 requires only coarse granularity data is unwieldy due it easier to produce ontologies with high conceptual 6 7 to (possibly massively) increased size of ontology and clarity. 7 8 data graph. 8 9 That following already established good modeling 9 10 Even more problematically, is that two use cases may principles makes an ontology easier to understand and 10 11 differ in granularity in different ways in different parts re-use, should go without saying. However, good mod- 11 12 of the data, respectively, ontology. That is, the level of eling principles are not simply a checklist that can eas- 12 13 abstraction is not uniform across the data. For exam- ily be followed. Even simple cases, such as the recom- 13 2 14 ple, one use case may call for details on the statistical mendation to not have perdurants and endurants to- 14 15 models underlying population data, but not for mea- gether in subclass relationships (in the example above, 15 16 surement instruments for temperatures, whereas an- author should not be a subclass of person; rather, au- 16 17 other use case may only need estimated population fig- thorship is a role of the person) are commonly not fol- 17 18 ures, but require calibration data for temperature mea- lowed in existing ontologies. At the current stage of re- 18 19 surements. Essentially, this means that attempting to search, “good modeling” appears to largely be a func- 19 20 re-use a traditional ontology may require modifying it tion of modeling experience and more of an art, than 20 21 in very different ways in different parts of the ontol- a science, which has not been condensed well enough 21 22 ogy. An additional complication is that ontologies are into tangible insights that can easily be written up in a 22 23 traditionally presented as monolithic entities and it is tutorial or textbook. 23 24 often hard to determine where exactly to apply such a 24 25 change in granularity. A further issue is that even in cases where the afore- 25 26 mentioned re-use challenges are manageable, imple- 26 27 Conceptual clarity is a rather elusive concept that cer- menting and subsequently maintaining re-use in prac- 27 28 tainly has a strong subjective component. By this, we tice is problematic due to limited support for re-use in 28 29 mean that an ontology should be designed and pre- available tooling. Once a reusable ontology resource 29 30 sented in such a way that it “makes sense” to do- has been located, preparing it for re-use – which can 30 31 main experts, without too much difficulty. While pre- be done in many ways, e.g., by copying the entire de- 31 32 sentation and documentation do play a major role, it is sign, by using owl:Imports, by copying individual def- 32 33 equally important to have intuitive naming conventions initions, by locally subsuming the remote ontology en- 33 34 for ontological entities and, in particular, a structural tities, etc. – is time-consuming and error-prone (espe- 34 35 organization (i.e., a schema for a data graph) which is cially when several resources are re-used). 35 36 meaningful for the domain expert. 36 37 Furthermore, through ontology re-use, the ontologist 37 We can briefly illustrate this using an example from the 38 commits to a design and logic built by a third party. 38 OAEI1 Conference benchmark ontologies [3, 4]. One 39 As the resulting ontology evolves, keeping track of the 39 lists “author of paper” and “author of student paper” 40 provenance of re-used ontological resources and their 40 as two distinct subclasses of “person.” This raises the 41 locally instantiated representations may become im- 41 question: why is “author of student paper” not a sub- 42 portant, e.g., to resolve design conflicts resulting from 42 class of “author of paper” (apart from subclassing both 43 differing requirements, or to keep up-to-date with the 43 44 as “person” which we will discuss in the next para- evolution of the re-used ontology. Such state-keeping 44 45 graph). In another ontology in this collection, “author” is decidedly non-trivial without appropriate tool sup- 45 46 is a subclass of “user", and “author” itself has exactly port. 46 47 two subclasses: “author, who is not a reviewer” and 47 48 “co-author” – which is hardly intuitive. 48 2These are ontological terms; a perdurant means “an entity that 49 49 only exists partially at any given point in time” and and endurant 50 1For more information on the Ontology Alignment Evaluation means “an entity that can be observed as a complete concept, regard- 50 51 Initiative, see http://oaei.ontologymatching.org/.
Recommended publications
  • Validating RDF Data Using Shapes
    83 Validating RDF data using Shapes a Jose Emilio Labra Gayo ​ ​ a University​ of Oviedo, Spain Abstract RDF forms the keystone of the Semantic Web as it enables a simple and powerful knowledge representation graph based data model that can also facilitate integration between heterogeneous sources of information. RDF based applications are usually accompanied with SPARQL stores which enable to efficiently manage and query RDF data. In spite of its well known benefits, the adoption of RDF in practice by web programmers is still lacking and SPARQL stores are usually deployed without proper documentation and quality assurance. However, the producers of RDF data usually know the implicit schema of the data they are generating, but they don't do it traditionally. In the last years, two technologies have been developed to describe and validate RDF content using the term shape: Shape Expressions (ShEx) and Shapes Constraint Language (SHACL). We will present a motivation for their appearance and compare them, as well as some applications and tools that have been developed. Keywords RDF, ShEx, SHACL, Validating, Data quality, Semantic web 1. Introduction In the tutorial we will present an overview of both RDF is a flexible knowledge and describe some challenges and future work [4] representation language based of graphs which has been successfully adopted in semantic web 2. Acknowledgements applications. In this tutorial we will describe two languages that have recently been proposed for This work has been partially funded by the RDF validation: Shape Expressions (ShEx) and Spanish Ministry of Economy, Industry and Shapes Constraint Language (SHACL).ShEx was Competitiveness, project: TIN2017-88877-R proposed as a concise and intuitive language for describing RDF data in 2014 [1].
    [Show full text]
  • V a Lida T in G R D F Da
    Series ISSN: 2160-4711 LABRA GAYO • ET AL GAYO LABRA Series Editors: Ying Ding, Indiana University Paul Groth, Elsevier Labs Validating RDF Data Jose Emilio Labra Gayo, University of Oviedo Eric Prud’hommeaux, W3C/MIT and Micelio Iovka Boneva, University of Lille Dimitris Kontokostas, University of Leipzig VALIDATING RDF DATA This book describes two technologies for RDF validation: Shape Expressions (ShEx) and Shapes Constraint Language (SHACL), the rationales for their designs, a comparison of the two, and some example applications. RDF and Linked Data have broad applicability across many fields, from aircraft manufacturing to zoology. Requirements for detecting bad data differ across communities, fields, and tasks, but nearly all involve some form of data validation. This book introduces data validation and describes its practical use in day-to-day data exchange. The Semantic Web offers a bold, new take on how to organize, distribute, index, and share data. Using Web addresses (URIs) as identifiers for data elements enables the construction of distributed databases on a global scale. Like the Web, the Semantic Web is heralded as an information revolution, and also like the Web, it is encumbered by data quality issues. The quality of Semantic Web data is compromised by the lack of resources for data curation, for maintenance, and for developing globally applicable data models. At the enterprise scale, these problems have conventional solutions. Master data management provides an enterprise-wide vocabulary, while constraint languages capture and enforce data structures. Filling a need long recognized by Semantic Web users, shapes languages provide models and vocabularies for expressing such structural constraints.
    [Show full text]
  • The Opencitations Data Model
    The OpenCitations Data Model Marilena Daquino1;2[0000−0002−1113−7550], Silvio Peroni1;2[0000−0003−0530−4305], David Shotton2;3[0000−0001−5506−523X], Giovanni Colavizza4[0000−0002−9806−084X], Behnam Ghavimi5[0000−0002−4627−5371], Anne Lauscher6[0000−0001−8590−9827], Philipp Mayr5[0000−0002−6656−1658], Matteo Romanello7[0000−0002−7406−6286], and Philipp Zumstein8[0000−0002−6485−9434]? 1 Digital Humanities Advanced research Centre (/DH.arc), Department of Classical Philology and Italian Studies, University of Bologna fmarilena.daquino2,[email protected] 2 Research Centre for Open Scholarly Metadata, Department of Classical Philology and Italian Studies, University of Bologna 3 Oxford e-Research Centre, University of Oxford [email protected] 4 Institute for Logic, Language and Computation (ILLC), University of Amsterdam [email protected] 5 Department of Knowledge Technologies for the Social Sciences, GESIS - Leibniz-Institute for the Social Sciences [email protected], [email protected] 6 Data and Web Science Group, University of Mannheim [email protected] 7 cole Polytechnique Fdrale de Lausanne [email protected] 8 Mannheim University Library, University of Mannheim [email protected] Abstract. A variety of schemas and ontologies are currently used for the machine-readable description of bibliographic entities and citations. This diversity, and the reuse of the same ontology terms with differ- ent nuances, generates inconsistencies in data. Adoption of a single data model would facilitate data integration tasks regardless of the data sup- plier or context application. In this paper we present the OpenCitations Data Model (OCDM), a generic data model for describing bibliographic entities and citations, developed using Semantic Web technologies.
    [Show full text]
  • Using Shape Expressions (Shex) to Share RDF Data Models and to Guide Curation with Rigorous Validation B Katherine Thornton1( ), Harold Solbrig2, Gregory S
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Repositorio Institucional de la Universidad de Oviedo Using Shape Expressions (ShEx) to Share RDF Data Models and to Guide Curation with Rigorous Validation B Katherine Thornton1( ), Harold Solbrig2, Gregory S. Stupp3, Jose Emilio Labra Gayo4, Daniel Mietchen5, Eric Prud’hommeaux6, and Andra Waagmeester7 1 Yale University, New Haven, CT, USA [email protected] 2 Johns Hopkins University, Baltimore, MD, USA [email protected] 3 The Scripps Research Institute, San Diego, CA, USA [email protected] 4 University of Oviedo, Oviedo, Spain [email protected] 5 Data Science Institute, University of Virginia, Charlottesville, VA, USA [email protected] 6 World Wide Web Consortium (W3C), MIT, Cambridge, MA, USA [email protected] 7 Micelio, Antwerpen, Belgium [email protected] Abstract. We discuss Shape Expressions (ShEx), a concise, formal, modeling and validation language for RDF structures. For instance, a Shape Expression could prescribe that subjects in a given RDF graph that fall into the shape “Paper” are expected to have a section called “Abstract”, and any ShEx implementation can confirm whether that is indeed the case for all such subjects within a given graph or subgraph. There are currently five actively maintained ShEx implementations. We discuss how we use the JavaScript, Scala and Python implementa- tions in RDF data validation workflows in distinct, applied contexts. We present examples of how ShEx can be used to model and validate data from two different sources, the domain-specific Fast Healthcare Interop- erability Resources (FHIR) and the domain-generic Wikidata knowledge base, which is the linked database built and maintained by the Wikimedia Foundation as a sister project to Wikipedia.
    [Show full text]
  • Shape Designer for Shex and SHACL Constraints Iovka Boneva, Jérémie Dusart, Daniel Fernández Alvarez, Jose Emilio Labra Gayo
    Shape Designer for ShEx and SHACL Constraints Iovka Boneva, Jérémie Dusart, Daniel Fernández Alvarez, Jose Emilio Labra Gayo To cite this version: Iovka Boneva, Jérémie Dusart, Daniel Fernández Alvarez, Jose Emilio Labra Gayo. Shape Designer for ShEx and SHACL Constraints. ISWC 2019 - 18th International Semantic Web Conference, Oct 2019, Auckland, New Zealand. 2019. hal-02268667 HAL Id: hal-02268667 https://hal.archives-ouvertes.fr/hal-02268667 Submitted on 30 Sep 2019 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Shape Designer for ShEx and SHACL Constraints∗ Iovka Boneva1, J´er´emieDusart2, Daniel Fern´andez Alvarez´ 3, and Jose Emilio Labra Gayo3 1 Univ. Lille, CNRS, Centrale Lille, Inria, UMR 9189 - CRIStAL - Centre de Recherche en Informatique Signal et Automatique de Lille, F-59000 Lille, France 2 Inria, France 3 University of Oviedo, Spain Abstract. We present Shape Designer, a graphical tool for building SHACL or ShEx constraints for an existing RDF dataset. Shape Designer allows to automatically extract complex constraints that are satisfied by the data. Its integrated shape editor and validator allow expert users to combine and modify these constraints in order to build an arbitrarily complex ShEx or SHACL schema.
    [Show full text]
  • Validating RDF with Shape Expressions
    Validating RDF with Shape Expressions Iovka Boneva Jose Emilio Labra Gayo LINKS, INRIA & CNRS University of Oviedo University of Lille, France Spain Samuel Hym Eric G. Prud'hommeau 2XS W3C University of Lille, France Stata Center, MIT Harold Solbrig S lawek Staworko∗ Mayo Clinic College of Medicine LINKS, INRIA & CNRS Rochester, MN, USA University of Lille, France Abstract We propose shape expression schema (ShEx), a novel schema formalism for describing the topology of an RDF graph that uses regular bag expressions (RBEs) to define con- straints on the admissible neighborhood for the nodes of a given type. We provide two alternative semantics, multi- and single-type, depending on whether or not a node may have more than one type. We study the expressive power of ShEx and study the complexity of the validation problem. We show that the single-type semantics is strictly more ex- pressive than the multi-type semantics, single-type validation is generally intractable and multi-type validation is feasible for a small class of RBEs. To further curb the high com- putational complexity of validation, we propose a natural notion of determinism and show that multi-type validation for the class of deterministic schemas using single-occurrence regular bag expressions (SORBEs) is tractable. Finally, we consider the problem of val- idating only a fragment of a graph with preassigned types for some of its nodes, and argue that for deterministic ShEx using SORBEs, multi-type validation can be performed efficiently and single-type validation can be performed with a single pass over the graph. 1 Introduction Schemas have a number of important functions in databases.
    [Show full text]
  • Validating Shacl Constraints Over a Sparql Endpoint
    Validating shacl constraints over a sparql endpoint Julien Corman1, Fernando Florenzano2, Juan L. Reutter2 , and Ognjen Savković1 1 Free University of Bozen-Bolzano, Bolzano, Italy 2 PUC Chile and IMFD, Chile Abstract. shacl (Shapes Constraint Language) is a specification for describing and validating RDF graphs that has recently become a W3C recommendation. While the language is gaining traction in the industry, algorithms for shacl constraint validation are still at an early stage. A first challenge comes from the fact that RDF graphs are often exposed as sparql endpoints, and therefore only accessible via queries. Another difficulty is the absence of guidelines about the way recursive constraints should be handled. In this paper, we provide algorithms for validating a graph against a shacl schema, which can be executed over a sparql end- point. We first investigate the possibility of validating a graph through a single query for non-recursive constraints. Then for the recursive case, since the problem has been shown to be NP-hard, we propose a strategy that consists in evaluating a small number of sparql queries over the endpoint, and using the answers to build a set of propositional formu- las that are passed to a SAT solver. Finally, we show that the process can be optimized when dealing with recursive but tractable fragments of shacl, without the need for an external solver. We also present a proof-of-concept evaluation of this last approach. 1 Introduction shacl (for SHApes Constraint Language),3 is an expressive constraint lan- guage for RDF graph, which has become a W3C recommendation in 2017.
    [Show full text]
  • Semi Automatic Construction of Shex and SHACL Schemas Iovka Boneva, Jérémie Dusart, Daniel Fernández Alvarez, Jose Emilio Labra Gayo
    Semi Automatic Construction of ShEx and SHACL Schemas Iovka Boneva, Jérémie Dusart, Daniel Fernández Alvarez, Jose Emilio Labra Gayo To cite this version: Iovka Boneva, Jérémie Dusart, Daniel Fernández Alvarez, Jose Emilio Labra Gayo. Semi Automatic Construction of ShEx and SHACL Schemas. 2019. hal-02193275 HAL Id: hal-02193275 https://hal.archives-ouvertes.fr/hal-02193275 Preprint submitted on 24 Jul 2019 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Semi Automatic Construction of ShEx and SHACL Schemas Iovka Boneva1, J´er´emieDusart2, Daniel Fern´andez Alvarez,´ and Jose Emilio Labra Gayo3 1 University of Lille, France 2 Inria, France 3 University of Oviedo, Spain Abstract. We present a method for the construction of SHACL or ShEx constraints for an existing RDF dataset. It has two components that are used conjointly: an algorithm for automatic schema construction, and an interactive workflow for editing the schema. The schema construction algorithm takes as input sets of sample nodes and constructs a shape con- straint for every sample set. It can be parametrized by a schema pattern that defines structural requirements for the schema to be constructed. Schema patterns are also used to feed the algorithm with relevant infor- mation about the dataset coming from a domain expert or from some ontology.
    [Show full text]
  • DINGO: an Ontology for Projects and Grants Linked Data
    DINGO: an ontology for projects and grants linked data Diego Chialva∗1 and Alexis-Michel Mugabushaka1 1ERCEA†, Place Charles Rogier 16, 1210 Brussels, Belgium‡ Abstract We present DINGO (Data INtegration for Grants Ontology), an ontology that provides a machine readable extensible framework to model data for semantically-enabled applications relative to projects, funding, actors, and, notably, funding policies in the research landscape. DINGO is designed to yield high modeling power and elasticity to cope with the huge variety in funding, research and policy practices, which makes it applicable also to other areas besides research where funding is an important aspect. We discuss its main features, the principles followed for its development, its community uptake, its maintenance and evolution. Keywords: ontology linked data, research funding, research projects, research policies 1 Introduction, Motivation, Goals and Idea Services and resources built around Semantic Web, semantically-enabled applications and linked (open) data technologies have been increasingly impacting research and research-related activities in the last years. Development has been intense along several directions, for instance in “semantic publishing” [36], but also in the aspects directed toward the reproducibility and attribution of research and scholarly outputs, leading also to the interest in having Open Science Graphs interconnected at the global level [21]. All this has become more and more essential to research practices, also in light of the so-called reproducibility crisis affecting a number of research fields (see, for instance, the huge list of latest studies at https://reproduciblescience.org/2019 ). In fact, the demand of easily and automatically parsable, interoperable and processable data goes beyond the purely academic sphere.
    [Show full text]
  • Reading an XML Text Like a Human with Semantic Web Technologies 1
    BASEL DIGITAL FRÜHE NEUZEIT WIRTSCHAFT Reading an XML Text Like a Human with Semantic Web Technologies Learning from the Basel City Accounts as Digital Edition Georg Vogeler 26.05.2021 Historical texts carry information. Though this assertion will hardly surprise historians, they less often consider how much this information is influenced by the material, visual, and organisational context of the text. Which archive considered the text worth preserving? How is the text organised on the page? Who wrote the text? What material was used to create the text? Digital editing all- ows us to create representations of texts which take into account all these aspects. 1 The digital scholarly edition of the Basel city accounts 1535–1611, created in collaboration with Susanna Burg- hartz and teams from Basel and Graz, and published in 2015,1 demonstrates both the feasibility and effective- ness of this digital approach to editing historical accoun- ting records. It has become a major reference for digital scholarly editions of historical accounts. Starting from the experience in the work with this his- torical object, this contribution reflects on technical solutions which can help to realise editions similar to the Basel city accounts. The edition uses a combina- tion of two well-established technologies in the Digital Humanities: the Text Encoding Initiative (TEI2) XML markup for transcriptions, and the Resource Description Framework (RDF3), defined by the World Wide Web con- sortium (W3C), to publish the content of the accounts in the «Web of Data» or the «Semantic Web». RDF is based on globally unique identifiers in the form of web addresses (URI4) and a formal structure similar to simple textual statements: «subject, object, predicate».
    [Show full text]
  • Document (1407
    Plenary Debates of the Parliament of Finland as Linked Open Data and in Parla-CLARIN Markup Laura Sinikallio # Senka Drobac # HELDIG Centre for Digital Humanities, Department of Computer Science, SeCo Research Group, SeCo Research Group, University of Helsinki, Finland Aalto University, Finland Minna Tamper # Rafael Leal # Department of Computer Science, HELDIG Centre for Digital Humanities, SeCo Research Group, SeCo Research Group, Aalto University, Finland University of Helsinki, Finland Mikko Koho # Jouni Tuominen # HELDIG Centre for Digital Humanities, Aalto University, Finland SeCo Research Group, HELDIG Centre for Digital Humanities, University of Helsinki, Finland SeCo Research Group, University of Helsinki, Finland Matti La Mela # Eero Hyvönen # HELDIG Centre for Digital Humanities, Aalto University, Finland SeCo Research Group, HELDIG Centre for Digital Humanities, University of Helsinki, Finland SeCo Research Group, University of Helsinki, Finland Abstract This paper presents a knowledge graph created by transforming the plenary debates of the Parliament of Finland (1907–) into Linked Open Data (LOD). The data, totaling over 900 000 speeches, with automatically created semantic annotations and rich ontology-based metadata, are published in a Linked Open Data Service and are used via a SPARQL API and as data dumps. The speech data is part of larger LOD publication FinnParla that also includes prosopographical data about the politicians. The data is being used for studying parliamentary language and culture in Digital Humanities in several universities. To serve a wider variety of users, the entirety of this data was also produced using Parla-CLARIN markup. We present the first publication of all Finnish parliamentary debates as data. Technical novelties in our approach include the use of both Parla-CLARIN and an RDF schema developed for representing the speeches, integration of the data to a new Parliament of Finland Ontology for deeper data analyses, and enriching the data with a variety of external national and international data sources.
    [Show full text]
  • Multi-‐Entity Models of Resource Description in the Semantic
    Multi-Entity Models of Resource Description in the Semantic Web: A comparison of FRBR, RDA, and BIBFRAME Thomas Baker, Department of Library and Information Science, Sungkyunkwan University, Seoul, Korea Karen Coyle, consultant, Berkeley, California, USA Sean Petiya, School of Library and Information Science, Kent State University, Kent, Ohio, USA (Preprint) Abstract Bibliographic description in emerging library standards is embracing a multi-entity model that describes varying levels of abstraction from the conceptual work to the physical item. Three of these multi-entity models have been published as vocabularies using the Semantic Web standard Resource Description Framework (RDF): FRBR, RDA, and BIBFRAME. The authors test RDF data based on the three vocabularies using common Semantic Web-enabled software. The analysis demonstrates that the intended data structure of the models is not supported by the RDF vocabularies. In some cases this results in undesirable incompatibilities between the vocabularies, which will be a hindrance to interoperability in the open data environment of the Web.* Data Files The data files supporting this study are available at: http://lod-lam.slis.kent.edu/wemi-rdf/ Introduction Most bibliographic metadata on the Web, such as data describing a book, article, or image, follows the implicit model of a single entity (a “resource”) with attributes (properties). This model is reflected, for example, in the widely used Dublin-Core-based XML format of the Open Archives Initiative Protocol for Metadata Harvesting (OAI-PMH). Over the past two decades, however, the library world has developed more differentiated models of bibliographic resources. These models do not see a book as just a book, but as a set of entities variously reflecting the meaning, expression, and physicality of a resource.
    [Show full text]