This document summarizes a project that automatically generates metadata and links between digital books. It extracts semantic tags from books using natural language processing, represents each book as a collection of tags, and links books that share common tags. It optimizes the linking process by only considering the top 50% of tags to improve performance. The project aims to scale this approach and provide semantic recommendations between related books.

1. Exposing Digital Content as Linked Data,
and Linking them using StoryBlink
Ben De Meester
Tom De Nies, Laurens De Vocht,
Ruben Verborgh, Erik Mannens,
and Rik Van de Walle
University Ghent – iMinds – Multimedia Lab
ben.demeester@ugent.be | @Ben__DM
NLPDBpedia2015@ISWC | October 11th 2015 | Bethlehem, PA

2. We live in a fast world
with a lot of content to sift through
http://blog.qmee.com/qmee-online-in-60-seconds/

3. Book ≠ Fast

4. Finding a good book in short time?
Recommendations!

5. Recommendations?
Social recommendations
Long tail
Metadata recommendations
Manual?

6. What do we want?
Automatic content-based metadata
to fuel future recommendation-engines

7. Content-based metadata
Get the tags…
DBPedia Spotlight
... use them to represent books’ content …
EPUB CFI, NIF, ITS, …
… and link to other books … in a good way.
TPF, EiCE
Storyblink!

8. Get the tags
Find out what a book is about…
Semantic tags!
Using NER/NED!
Extract all semantic concepts from the book

9. AGDISTIS

10. AGDISTIS
Open source
Local
NER/NED/NEL

11. From a book to a semantic book
… …
Split HTML
into chunks
HTML
to text
Local
Spotlight

12. Represent a book by tags
@prefix schema: <http://schema.org/> .
@prefix nif: <http://persistence.uni-leipzig.org/nlp2rdf/ontologies/nif-core#> .
@prefix itsrdf: <http://www.w3.org/2005/11/its/rdf#> .
@prefix dbr: <http://dbpedia.org/resource/> .
@prefix rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#> .
@prefix pg84: <http://www.gutenberg.org/ebooks/84.epub#> .
pg84:book a schema:Book .
pg84:epubcfi(/6/12!/4/2/4) itsrdf:taIdentRef dbr:Chamois ;
nif:sourceUrl pg84:book .
pg84:epubcfi(/6/2!/4/46[chap01]/16/42) itsrdf:taIdentRef dbr:Chamois ;
nif:sourceUrl pg84:book .
pg84:epubcfi(/6/12!/4/2/6) itsrdf:taIdentRef dbr:Desert ;
nif:sourceUrl pg84:book .
...

13. Represent a book by tags
@prefix schema: <http://schema.org/> .
@prefix nif: <http://persistence.uni-leipzig.org/nlp2rdf/ontologies/nif-core#> .
@prefix itsrdf: <http://www.w3.org/2005/11/its/rdf#> .
@prefix dbr: <http://dbpedia.org/resource/> .
@prefix rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#> .
@prefix pg84: <http://www.gutenberg.org/ebooks/84.epub#> .
pg84:book a schema:Book .
pg84:epubcfi(/6/12!/4/2/4) itsrdf:taIdentRef dbr:Chamois ;
nif:sourceUrl pg84:book .
pg84:epubcfi(/6/2!/4/46[chap01]/16/42) itsrdf:taIdentRef dbr:Chamois ;
nif:sourceUrl pg84:book .
pg84:epubcfi(/6/12!/4/2/6) itsrdf:taIdentRef dbr:Desert ;
nif:sourceUrl pg84:book .
...

14. Link to other books
Open Source
Linked data
path finding
Multiple paths

20. Keeping all concepts…
Not all mentioned concepts are useful.
The path finding becomes really slow.

21. Keeping all concepts…
Not all mentioned concepts are useful.
The path finding becomes really slow.
What happens if we keep the top X%?

22. 0
10
20
30
40
50
60
0
2
4
6
8
10
12
14
0 10 20 30 40 50 60 70 80 90 100
Time (s)#paths
Amount of considered concepts (%)
Top 50% of found concepts gives similar paths,
but a lot faster

23. 0
10
20
30
40
50
60
0
2
4
6
8
10
12
14
0 10 20 30 40 50 60 70 80 90 100
Time (s)#paths
Amount of considered concepts (%)
Top 50% of found concepts gives similar paths,
but a lot faster
Time-out

24. Optimized Results
@prefix schema: <http://schema.org/> .
@prefix nif: <http://persistence.uni-leipzig.org/nlp2rdf/ontologies/nif-core#>
@prefix itsrdf: <http://www.w3.org/2005/11/its/rdf#> .
@prefix dbr: <http://dbpedia.org/resource/> .
@prefix rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#> .
@prefix pg84: <http://www.gutenberg.org/ebooks/84.epub#> .
pg84:book a schema:Book .
pg84:book itsrdf:taIdentRef dbr:Chamois,
dbr:Desert,
...
http://uvdt.test.iminds.be/storyblinkdata/books

25. Storyblink
Exploring the links between classic works
Choose two books, and…

26. Storyblink

27. Next steps
Scale
Indirect paths
e.g. book about WWI and book about WWII
Relevancy measures
Knowledge base influence
Filtering influence

28. Storyblink
gives a semantic representation
of important semantic concepts
inside books, and uses those to connect
books together content-wise
http://uvdt.test.iminds.be/storyblink
Demo 48

29. Our project
The Publisher of the Future
Our pilot project partners: