• Aucun résultat trouvé

(1)Contents Introduction

N/A
N/A
Protected

Academic year: 2021

Partager "(1)Contents Introduction"

Copied!
1
0
0

Texte intégral

(1)

Contents

Introduction. . . 1

1 Motivation . . . 3

2 Objectives . . . 7

3 Structure . . . 15

I Information Extraction . . . 19

1 Background . . . 21

2 Named-Entity Recognition . . . 29

3 Relations and Events . . . 40

II Semantic Enrichment with Linked Data . . . 51

1 Making Sense of the Web . . . 53

2 Semantic Resources . . . 64

3 Enriching Content . . . 76

III The Humanities and Empirical Content . . . 89

1 Empirical Information . . . 91

2 Digital Humanities . . . 96

3 Historische Kranten . . . 107

IV Quality, Language, and Time. . . 123

1 Data Quality . . . 125

2 Multilingualism . . . 137

3 Language Evolution . . . 147

V Knowledge Discovery. . . 157

1 MERCKX: A Knowledge Extractor . . . 159

2 Evaluation . . . 175

3 Validation . . . 190

Conclusions . . . 207

1 Overview . . . 209

2 Outcomes . . . 213

3 Perspectives . . . 218

A Source Code . . . 223

B Guidelines for Annotators . . . 225

C Follow-up. . . 226

Detailed Contents . . . 227

Bibliography. . . 233 i

Références

Documents relatifs

While it is technically possible to export and make the Pryv datasets available to external applications in different formats, standards such as HL7 FHIR [1] impose the necessity

In this paper we present a discussion on the role of semantic web resources in the task of automatically enriching digitised cultural heritage collections using EL methods..

In particular we used DBPedia as the primary data hub, and exploited several links to other data sources like Project Gutenberg, New York Times Open Data, and the CIA World

The design of URIs satisfies the Linked Data principles 1) and 2). We also provide relevant information for the URI of each entity, and this implementation helps satisfy the

In this paper we present an approach for scalable semantic version control for Linked Data based on a delta-based storage and on-demand reconstruction of historic versions3.

The problem of finding all certain answers ans(q, P, D) to an arbitrary graph pattern query q, for a given RDF Peer System P and a stored database D, has PTIME data complexity.. Due

In this paper, we describe Denote – our annotator that uses a structured ontology, machine learning, and statistical analysis to perform tagging and topic discovery.. A

In this paper, we present a Linked Data-driven, semantically-enabled journal portal (SEJP) that currently supports over 20 different interactive analysis modules.. These modules