<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>DIGITALHISTORIAN: Search &amp; Analytics Using Annotations</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Dhruv Gupta</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Jannik Str o¨tgen</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Klaus Berberich</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Max Planck Institute for Informatics</institution>
          ,
          <addr-line>Saarbr u ̈cken</addr-line>
          ,
          <country country="DE">Germany</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Saarbru ̈ cken Graduate School of Compute Science</institution>
          ,
          <addr-line>Saarbru ̈ cken</addr-line>
          ,
          <country country="DE">Germany</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>htw saar</institution>
          ,
          <addr-line>Saarbr u ̈cken</addr-line>
          ,
          <country country="DE">Germany</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Born-digital document collections contain vast amounts of historical facts and knowledge. However, manual assessment of these large text collections is infeasible. In this paper, we demonstrate a retrieval system, DIGITALHISTORIAN, that analyzes these document collections using semantic annotations in the form of temporal expressions and named entities linked to a knowledge graph. For queries about entities or events DIGITALHISTORIAN utilizes state-of-the-art methods to understand and analyze temporal expressions in the content of documents. It understands uncertainty in temporal expressions and uses them to mine interesting time intervals for keyword queries. These time intervals are further used for re-ranking and diversifying documents, so that the ranked list of documents portray a historic overview of the query. Further, to contextualize the interesting time intervals, we use frequently occurring named entities and display them in informative visualizations. DIGITALHISTORIAN is designed to help scholars in digital humanities explore large document collections quickly without having any prior knowledge about interesting time intervals or entities for given keyword query. Large born-digital document collections cannot be analyzed by manual human effort. Nowadays, however, they can be automatically annotated with temporal expressions and named entities. Time has been found to be a very important part of generic Web queries; recent studies [9] estimate that around 17.1% of them are implicitly time-sensitive in nature. In the context of digital humanities, these figures can be expected to be much higher. The desiderata that we believe many commercial search engines do not currently meet and which will be useful for scholars in digital humanities are: . the ability to automatically suggest interesting time intervals for history-oriented queries; . the ability to diversify or re-rank documents using temporal expressions; . the ability to establish relationships between the time intervals of interest for query and other evidences in text such as named entities; . the ability to visually analyze the different relationships established between the annotations in documents.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>Organization. The rest of the paper is organized as follows. In Section 2, we give a brief
description of the key methods applied for mining interesting time intervals, and how these are used for
search result re-ranking and diversification. In Section 3, we describe the technical building blocks of
DIGITALHISTORIAN. In Section 4, we describe how DIGTALHISTORIAN can be utilized to explore
document collections. We put our system in context to related systems in Section 5 and summarize the
contributions in Section 6.
2</p>
    </sec>
    <sec id="sec-2">
      <title>History by Algorithms</title>
      <p>
        The underlying methods for temporal search in DIGITALHISTORIAN are derived from our prior
research [
        <xref ref-type="bibr" rid="ref1 ref2 ref3 ref4">1, 2, 3, 4</xref>
        ]. We next give a brief description of these methods.
      </p>
      <p>
        Understanding Time. Temporal expressions in documents can be highly uncertain, for example
1990s. For such temporal expressions it is unclear how the time interval should be constructed for
further analysis. In order to represent such ambiguities in time, we use the time model proposed by
Berberich et al. [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] which allows for relaxations on the begin and end of time intervals. Thus, 1990s
may convey a time interval that can begin anywhere from [1990,1999] and end anywhere from [1990,
1999]. This new representation thus allows us to perform mathematical manipulations on uncertain and
ambiguous temporal expressions.
      </p>
      <p>
        Time Intervals of Interest to Queries. Given a history-oriented query such as george w bush, our
approach [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] can identify interesting time intervals (e.g., [2000,2004], [2004,2008]) by analyzing
the temporal expressions in its pseudo-relevant set of documents. This is achieved in two steps. First, by
counting the frequency of time intervals in the uncertainty-aware time model described earlier. Second,
by weighting each frequent time interval with relevance of the document to the query. This is done
recursively to generate interesting time intervals at year, month, and day level granularity.
      </p>
      <p>
        Re-ranking Documents Using Time. The ranking of the initial set of pseudo-relevant documents
can be refined by using one of the interesting time intervals for query expansion. Consider for example
the query george w bush reformulated with the time interval [2000,2004]. The documents which
contain temporal expressions that can generate the time interval in the query more frequently and also
have a higher textual relevance to the query will be promoted in the rankings [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. Hence, all documents
that are relevant to the time interval will be higher in the rankings.
      </p>
      <p>
        Diversifying Documents Using Time. The time intervals of interest can be considered to reflect
different temporal aspects underlying the query. The initial pseudo-relevant set of documents can then
be diversified so as to contain at least one document relevant to the different temporal aspects [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. The
temporally diverse set of documents can thus be viewed as a biography of an entity or a timeline of an
event.
      </p>
      <p>Counting Frequent Named Entities. The time intervals of interest can further be used as a
basis for aggregating different annotations in text. In particular, we aggregate the occurrence of unique
named entities. E.g., given the query george w bush and the time interval [2000,2004], we obtain the
aggregate counts of co-occurring named entities such as al gore.
3</p>
    </sec>
    <sec id="sec-3">
      <title>Architecture</title>
      <p>The key building blocks of DIGITALHISTORIAN are: a document collection, semantic annotators, an
information retrieval framework, a visualization engine, and the graphical user interface. We describe
each of them briefly in the following paragraphs.</p>
      <p>Document Collection. We used the The New York Times Annotated Corpus,1 a collection of news
articles published in The New York Times between 1987 to 2007. It comprises of roughly two million
news articles. As metadata, we used only the publication dates.</p>
      <p>
        Semantic Annotators. For annotating temporal expressions we utilized the HEIDELTIME temporal
tagger [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]. HEIDELTIME annotates implicit, explicit, and relative temporal expressions. For
disambiguating and linking named entities to the YAGO[
        <xref ref-type="bibr" rid="ref15">15</xref>
        ] knowledge graph, all documents were processed
with AIDA [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ].
      </p>
      <p>Information Retrieval Framework. All the documents along with their annotations were indexed
with the ELASTICSEARCH2 framework. As a baseline retrieval model for pseudo-relevant documents
we used the Okapi BM25 method implemented in ELASTICSEARCH. All our methods for temporal
search and aggregation were implemented in the JAVA language.</p>
      <p>Visualization and GUI. For generating visualizations, we used the BRUNEL VISUALIZATION3 API.
The entire graphical user interface was programmed using JAVA’s SWING API.
4</p>
    </sec>
    <sec id="sec-4">
      <title>Demonstration</title>
      <p>As outlined in the following, there are two key use cases that we would like to demonstrate with
DIGITALHISTORIAN. We also describe how the users will be able to interact with DIGITALHISTORIAN
using illustrations for the different use cases.</p>
      <p>Exploring Search Results. The foremost task that we address with DIGITALHISTORIAN is that
of exploring the document collection using the interesting time intervals identified for the query. The
main view (Figure 1) of the DIGITALHISTORIAN addresses this by providing the user with a search
field to issue keyword queries. Subsequent to the search operation, various interesting time intervals
are displayed in a list on the left hand-side of the interface. The list of time intervals are ordered by
their interestingness, i.e., how frequently they are generated by the temporal expressions in document
contents for the given query. A diversified set of documents is shown in the main display which gives a
temporal overview of documents for the query. Each document in the list is depicted by its headline, its
URL, a snippet from its contents and the normalized temporal expressions in its contents. Furthermore,
the users can double-click the various time intervals in the list to expand the query, so as to obtain more
documents concerning it. Unlike many commercial search engines, all of this is done automatically,
without imposing any sliders or check-boxes to manually specify relevant time intervals.</p>
      <p>Analytical Visualizations. We further construct informative visualizations by contextualizing the
interesting time intervals with co-occurring named entities. Currently, there are two analytical
visualizations available. Both of them show the frequency of various named entities that occur in different
time intervals. The first visualization is a chord diagram (Figure 2a), where an arc is drawn between a
time interval and a corresponding named entity that occurs in that time interval. The thickness of the
arc is in proportion to the frequency of the named entity in that time interval. The user can also hover
over to each individual chord in the graph to see the time interval and the entity it connects and the
corresponding aggregate count. The second visualization is a heatmap diagram (Figure 2b), where on
the x-axis the different time points and on the y-axis different named entities are plotted. The intensity
of the cell in the heatmap shows the frequency of that named entity in that time point. The user can
further drill up from years to decades and drill down from years to days by scrolling on the time axis to
inspect the different time intervals with their respective frequency of named entities.
1https://catalog.ldc.upenn.edu/LDC2008T19
2https://www.elastic.co/
3https://github.com/Brunel-Visualization/Brunel
Gupta, Stro¨ tgen, and Berberich
(a) In the chord diagram, we can see the key entities by
large chords corresponding to iraq, george w bush, and
iran. Iraq was involved in multiple conflicts which can be
seen in the highlighted boxes, i.e., the American invasion of
Iraq in 2003 and the Iran-Iraq war of 1980-1988. The most (b) In the heatmap diagram, each cell shows the frequency of the named
frequent entities are highlighted in the legend entity in the corresponding time point.</p>
    </sec>
    <sec id="sec-5">
      <title>Related Work</title>
      <p>
        There exists few demonstrations that utilize named entities and temporal expressions for search and
analysis of documents. None of them put any emphasis on the understanding and analysis of temporal
expressions in document contents as we have done in this paper. Some of the challenges that we
addressed, have been described in detail by Tahmesebi et al. from the digital humanities perspective [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ].
Hoffart et al. [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] demonstrated a search system that utilized named entities in the YAGO knowledge
graph for retrieval of documents. To this end they use named entities and their categorical types for
auto-complete suggestion to queries. They, however, rank documents based on publication dates. In
their subsequent work, Hoffart et al. [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] perform analytics by using a combination of document
publication dates and the entities contained therein. Yeung and Jatowt [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] use LDA topics over time in text to
assist historians in answering various queries. In contrast to these systems, we have looked at temporal
expressions in document contents in order to generate a deeper analysis for search results. Similarly,
Stro¨tgen and Gertz [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] extract content temporal expressions and geographic locations to anchor news
articles on a map, and Odjik et al. [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] present an interface to explore different document collections
using temporal expressions and text. However unlike both these systems, we have utilized disambiguated
named entities in a knowledge graph to contextualize interesting time intervals. Other systems such as
WAHSP [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] use sentiment in text, and the system HISTOGRAPH uses social relations in photographic
collections [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ].
6
      </p>
    </sec>
    <sec id="sec-6">
      <title>Summary References</title>
      <p>In this paper, we demonstrated DIGITALHISTORIAN, a system that is able to analyze temporal
expressions in document content to generate interesting time intervals which are subsequently used to re-rank
and diversify documents to give a historic overview for the issued query. It also offers capabilities to
analyze frequent named entities in the YAGO knowledge graph for informative visualizations.
DIGITALHISTORIAN thus provides scholars in digital humanities an informative and innovative way of exploring
semantically annotated document collections.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <surname>Berberich</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bedathur</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Alonso</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Weikum</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          <article-title>A language modeling approach for temporal information needs</article-title>
          .
          <source>In 32nd European Conference on IR Research (ECIR)</source>
          ,
          <article-title>(Milton Keynes</article-title>
          , UK,
          <year>2010</year>
          ). Springer,
          <fpage>13</fpage>
          -
          <lpage>25</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <surname>Gupta</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Berberich</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          <article-title>Identifying time intervals of interest to queries</article-title>
          .
          <source>In 23rd ACM International Conference on Conference on Information and Knowledge Management (CIKM)</source>
          , (Shanghai, China,
          <year>2014</year>
          ), ACM,
          <fpage>1835</fpage>
          -
          <lpage>1838</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <surname>Gupta</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Berberich</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          <article-title>Temporal query classification at different granularities</article-title>
          .
          <source>In 22nd edition of the International Symposium on String Processing and Information Retrieval (SPIRE)</source>
          , (London, UK,
          <year>2015</year>
          ), Springer,
          <fpage>156</fpage>
          -
          <lpage>164</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <surname>Gupta</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Berberich</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          <article-title>Diversifying search results using time</article-title>
          .
          <source>In 38th European Conference on Information Retrieval (ECIR)</source>
          ,
          <source>(Padova, Italy</source>
          ,
          <year>2016</year>
          ), Springer,
          <fpage>789</fpage>
          -
          <lpage>795</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <surname>Hoffart</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Milchevski</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Weikum</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          <article-title>AESTHETICS: Analytics with strings, things, and cats</article-title>
          .
          <source>In 23rd ACM International Conference on Conference on Information and Knowledge Management (CIKM)</source>
          , (Shanghai, China,
          <year>2014</year>
          ), ACM,
          <fpage>2018</fpage>
          -
          <lpage>2020</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <surname>Hoffart</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Milchevski</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Weikum</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          <article-title>STICS: Searching with strings, things, and cats</article-title>
          .
          <source>In 37th ACM International Conference on Research and Development in Information Retrieval (SIGIR)</source>
          , (Gold Coast, Australia,
          <year>2014</year>
          ), ACM,
          <fpage>1247</fpage>
          -
          <lpage>1248</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <surname>Hoffart</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yosef</surname>
            ,
            <given-names>M.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bordino</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          , Fu¨rstenau, H.,
          <string-name>
            <surname>Pinkal</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Spaniol</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Taneva</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Thater</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Weikum</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          <article-title>Robust disambiguation of named entities in text</article-title>
          .
          <source>In Conference on Empirical Methods in Natural Language Processing (EMNLP)</source>
          ,
          <article-title>(Edinburgh</article-title>
          , UK,
          <year>2011</year>
          ), ACL,
          <fpage>782</fpage>
          -
          <lpage>792</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <surname>Huijnen</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Laan</surname>
          </string-name>
          , F.,
          <string-name>
            <surname>de Rijke</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Pieters</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          <article-title>A digital humanities approach to the history of science - eugenics revisited in hidden debates by means of semantic text mining</article-title>
          . In Social Informatics - SocInfo 2013 International Workshops, QMC and
          <string-name>
            <surname>HISTOINFORMATICS</surname>
          </string-name>
          , (Kyoto, Japan,
          <year>2013</year>
          ),
          <fpage>71</fpage>
          -
          <lpage>85</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <surname>Kanhabua</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Blanco</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          and Nørva˚g,
          <string-name>
            <surname>K.</surname>
          </string-name>
          <article-title>Temporal information retrieval</article-title>
          .
          <source>Foundations and Trends in Information Retrieval</source>
          ,
          <volume>9</volume>
          (
          <issue>2</issue>
          ):
          <fpage>91</fpage>
          -
          <lpage>208</lpage>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <surname>Yeung</surname>
            ,
            <given-names>C.M.A.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Jatowt</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <article-title>Studying how the past is remembered: towards computational history through large scale text mining</article-title>
          .
          <source>In 20th ACM International Conference on Information and Knowledge Management (CIKM)</source>
          , (Glasgow, UK,
          <year>2011</year>
          ), ACM,
          <fpage>1231</fpage>
          -
          <lpage>1240</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <surname>Novak</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Micheel</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Melenhorst</surname>
            ,
            <given-names>M.S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wieneke</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          , D u¨ring,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Moron</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.G.</given-names>
            ,
            <surname>Pasini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Tagliasacchi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            and
            <surname>Fraternali</surname>
          </string-name>
          ,
          <string-name>
            <surname>P.</surname>
          </string-name>
          <article-title>Histograph - A visualization tool for collaborative analysis of networks from historical social multimedia collections</article-title>
          .
          <source>In 18th International Conference on Information Visualisation</source>
          , (IV), (Paris, France,
          <year>2014</year>
          ), IEEE Computer Society,
          <fpage>241</fpage>
          -
          <lpage>250</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <surname>Odijk</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          , Gaˆrbacea,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Schoegje</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            ,
            <surname>Hollink</surname>
          </string-name>
          , L.,
          <string-name>
            <surname>de Boer</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ribbens</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          , and van Ossenbruggen,
          <string-name>
            <surname>J.</surname>
          </string-name>
          <article-title>Supporting exploration of historical perspectives across collections</article-title>
          .
          <source>In 19th International Conference on Theory and Practice of Digital Libraries</source>
          ,
          <source>(TPDL)</source>
          , (Poznan´, Poland,
          <year>2015</year>
          ), Springer,
          <fpage>238</fpage>
          -
          <lpage>251</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13] Stro¨tgen, J. and
          <string-name>
            <surname>Gertz</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <article-title>Event-centric search and exploration in document collections</article-title>
          .
          <source>In 12th ACM/IEEECS Joint Conference on Digital Libraries</source>
          ,
          <source>(JCDL)</source>
          , (Washington, DC, USA,
          <year>2012</year>
          ), ACM,
          <fpage>223</fpage>
          -
          <lpage>232</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14] Stro¨tgen, J. and
          <string-name>
            <surname>Gertz</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <article-title>Multilingual and cross-domain temporal tagging</article-title>
          .
          <source>Language Resources and Evaluation</source>
          ,
          <volume>47</volume>
          (
          <issue>2</issue>
          ):
          <fpage>269</fpage>
          -
          <lpage>298</lpage>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <surname>Suchanek</surname>
            ,
            <given-names>F.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kasneci</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Weikum</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          <article-title>Yago: A large ontology from wikipedia and wordnet</article-title>
          .
          <source>Web Semantics</source>
          ,
          <volume>6</volume>
          (
          <issue>3</issue>
          ):
          <fpage>203</fpage>
          -
          <lpage>217</lpage>
          ,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <surname>Tahmasebi</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Borin</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Capannini</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dubhashi</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Exner</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Forsberg</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gossen</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Johansson</surname>
            ,
            <given-names>F.D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Johansson</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          , Ka˚geba¨ck,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Mogren</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            ,
            <surname>Nugues</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            and
            <surname>Risse</surname>
          </string-name>
          ,
          <string-name>
            <surname>T.</surname>
          </string-name>
          <article-title>Visions and open challenges for a knowledge-based culturomics</article-title>
          .
          <source>International Journal on Digital Libraries</source>
          ,
          <volume>15</volume>
          (
          <issue>2</issue>
          ):
          <fpage>169</fpage>
          -
          <lpage>187</lpage>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>