<!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>
      <journal-title-group>
        <journal-title>Citation Type Labelled Citation Strings Unique Citation Strings Percentage
Journal Article</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>GIANT: The 1-Billion Annotated Synthetic Bibliographic-Reference-String Dataset for Deep Citation Parsing</article-title>
      </title-group>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>Trinity College Dublin, School of Computer Science, ADAPT Centre</institution>
          ,
          <addr-line>Ireland grennama,ancollin,beelj @tcd.ie</addr-line>
        </aff>
      </contrib-group>
      <volume>752</volume>
      <issue>005</issue>
      <abstract>
        <p>Extracting and parsing reference strings from research articles is a challenging task. State-of-the-art tools like GROBID apply rather simple machine learning models such as conditional random elds (CRF). Recent research has shown a high potential of deep-learning for reference string parsing. The challenge with deep learning is, however, that the training step requires enormous amounts of labelled data { which does not exist for reference string parsing. Creating such a large dataset manually, through human labor, seems hardly feasible. Therefore, we created GIANT. GIANT is a large dataset with 991,411,100 XML labeled reference strings. The strings were automatically created based on 677,000 entries from CrossRef, 1,500 citation styles in the citation-style language, and the citation processor citeproc-js. GIANT can be used to train machine learning models, particularly deep learning models, for citation parsing. While we have not yet tested GIANT for training such models, we hypothesise that the dataset will be able to signi cantly improve the accuracy of citation parsing. The dataset and code to create it, are freely available at https://github.com/BeelGroup/.</p>
      </abstract>
      <kwd-group>
        <kwd>Dataset</kwd>
        <kwd>Deep Citation Parsing</kwd>
        <kwd>Reference String Parsing</kwd>
        <kwd>Document Engineering</kwd>
        <kwd>Information Extraction</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>Accurate citation parsing is important as citations are often used as a proxy for
the strength of an academics career. In order to accurately report an researcher's
citations, or accurately calculate an impact factor, journals, academic search
engines and academic recommender systems must be able to extract citation
metadata from each publication in their database. Failure to accurately parse
citations could a ect the validity of their results and consequently, an author's
funding, status and future academic prospects.</p>
      <p>Citation parsing involves extracting machine readable metadata from a
bibliography or citation string. As input, a citation parser accepts a citation string
formatted in a particular citation style such as Harvard, APA, or IEEE. The
parser then extract the metadata from the citation string and produces labelled
output. The following citation string is formatted in Harvard style:
Councill, I.G., Giles, C.L. and Kan, M.Y., 2008, May. ParsCit: an Open-source
CRF Reference String Parsing Package. In LREC (Vol. 8, pp. 661-667).
The corresponding labelled output is shown in Fig. 1. The output is typically
formatted in XML with the eld names included as XML tags. Here, the labelled
output includes the authors' names, the date, the title of the article, the title of
the journal, the volume, and the page numbers.</p>
      <p>
        In spite of it's importance citation parsing remains an open and di cult problem.
In 2018 Tkaczyk et al. carried out a survey of ten open-source citation parsing
tools, six machine-learning based tools and four non machine-learning based [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ].
They reported that the ten tools had an average F1 of 0.56 and that ML-based
tools outperformed non ML-based approaches by 133% (F1 0.77 for ML-based
tools vs F1 0.33 for non-ML based tools). There remains room for signi cant
improvement however a number of issues contribute to making this challenging.
These include:
1. The large number of citation styles in use
2. The diversity of language used in citation strings
3. The diversity of citation types (e.g. books, journal articles, websites etc.)
4. The fact that each citation type may contain di erent elds and these elds
are not known before processing
5. The presence of formatting errors
6. The lack of large amounts of labelled training data
The strength of a ML citation parser often re ects the quantity and quality of
the training data. In order to train a ML citation parser to perform well on
unseen citations each challenge must be addressed in the training data. Namely,
the training dataset should incorporate a diverse range of citation styles and
citation types. It should contain citations from a broad range of disciplines and
also some of the more common formatting errors. In order to satisfy all of these
requirements the training dataset needs to be large.
      </p>
      <p>
        Current training datasets for citation parsing have two fundamental
problems. Firstly, they are homogeneous, with citations coming from a single
domain. Many domains favour a particular citation style and training a model on
only a few styles will not help it perform well across a range of domains.
Further, limiting the training dataset to a single domain will reduce the diversity
of domain-speci c language the model is exposed to. Secondly, the majority of
existing training datasets are small, having less than 8,000 labelled citations. It
would be impossible for a training dataset of this size to fully re ect the
diversity of citation styles or types that exist. Echoing these thoughts, a number of
authors have commented on the potential bene ts of having more training data
available [
        <xref ref-type="bibr" rid="ref4 ref6">4, 6</xref>
        ].
      </p>
      <p>
        With only small training datasets available common ML algorithms used for
citation parsing include Support Vector Machines (SVM), Hidden Markov
Models (HMM) and Conditional Random Fields (CRF). In 2018, Rodrigues et al. [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ]
and Prasad et al. [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ] both separately applied a deep-learning approach to the
problem of citation parsing. Although their training datasets are still relatively
small - Rodrigues reported a training dataset of 40,000 citations - the results
have been promising. Prasad et al. showed that Neural Parscit outperformed
their earlier, non deep-learning approach.
      </p>
      <p>Yet it remains to be seen what e ect a much larger training dataset could
have on the open problem of citation parsing. To fully leverage the potential
of deep learning for citation string parsing, a large corpus is needed. Manually
creating such a corpus does not seem reasonable and it is with this in mind that
we introduce GIANT, a dataset of 1 billion annotated reference strings.
2
2.1</p>
    </sec>
    <sec id="sec-2">
      <title>Related Work</title>
      <sec id="sec-2-1">
        <title>Machine Learning Citation Parsers</title>
        <p>We reviewed 31 papers on the topic of citation parsing and found that the number
who adopt a ML approach to citation parsing greatly outnumbers the number
that use non-ML methods (Fig. 2). Since 2010, 77% (24) of the 31 reviewed
papers surveyed have adopted a ML-based approach. This perhaps re ects the
growing consensus around the strengths of using ML methods. The four most
common ML approaches are SVM, HMM, CRF and deep-learning. Fig. 3 shows
the proportion of the 24 ML papers reviewed which used each model. Here, 12.5%
used SVM, 29.2% used HMM, 50% used CRF and 8.2% used deep-learning.</p>
        <p>Fig. 4 shows how the popularity of these ML models have changed over
time. It highlights how HMM was more common pre-2010, CRF has remained
consistently popular and a deep-learning approach has only been explored in the
last two years.</p>
        <p>Fig. 2. The number of papers which have adopted a ML-based and a non ML-based
approach to citation parsing between 2000 and 2019.</p>
        <p>
          Tkaczyk et al. [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ] showed that the performance of ML models can be
improved by retraining a ML model on task-speci c data. To improve a model's
performance on a particular citation style, or domain-speci c language, a ML
model needs to be re-trained on relevant data.
2.2
        </p>
      </sec>
      <sec id="sec-2-2">
        <title>Training Datasets</title>
        <p>6858 Computer Science &amp;</p>
        <p>Health Science</p>
        <p>It is worth highlighting two points from this table. Firstly, many of these
datasets were compiled from a single domain or sub-domain. Cora contains
citations solely from Computer Science, PubMed contains citations from MEDLINE,
a health science database and Venice contains citations from a corpus of
documents on the history of Venice. As previously noted, many domains have their
own domain-speci c language and preferred citation style. Training a model on a
single domain's technical language and only a few styles will not help it perform
well across a range of domains.</p>
        <p>
          The second point to note is the size of the training datasets. Aside from
Rodrigues et al. [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ] who have used a deep-learning approach and a training
dataset of 40,000 citations, the remaining tools are trained on datasets smaller
than 8,000 citations. Given the vast array of language and citation styles that
exist it would be impossible for a training dataset of a such a size to fully capture
this diversity. A number of authors have echoed these thoughts commenting on
the limitations of existing datasets [
          <xref ref-type="bibr" rid="ref14 ref15 ref4">4, 15, 14</xref>
          ].
2.3
        </p>
      </sec>
      <sec id="sec-2-3">
        <title>Deep Learning</title>
        <p>
          Citation parsing can be de ned as a sequence labelling problem. Advances
have been made in recent years in the application of deep learning techniques
to sequence-labelling tasks. The state-of-the-art architectures for sequence
labelling include a CRF prediction layer, word-embeddings and character-level
word-embeddings. They are trained either with Convolutional Neural Networks
(CNNs) [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ] or Recursive Neural Networks (RNNs) using Bidirectional
LongShort Term Memory (BiLSTM) layers [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ].
        </p>
        <p>
          Rodrigues et al. [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ] apply and compare the architectures of Lample et al.
[
          <xref ref-type="bibr" rid="ref8">8</xref>
          ] and Ma and Hovy [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ] to the task of reference mining. They de ne reference
mining as the detection, extraction and classi cation of bibliographic references
[
          <xref ref-type="bibr" rid="ref15">15</xref>
          ]. They trained and evaluated their model on citations extracted from a corpus
of literature on the history of Venice. Word embeddings were pre-trained using
Word2Vec [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ] on the entire publications from which they extracted citations
and the model was trained on 40,000 labelled citations. Extensive tuning was
undertaken. Their nal model outperformed a non deep-learning CRF baseline
by 7.03% achieving an F1 of 0.896.
        </p>
        <p>
          Prasad et al. [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ] also examined how well a deep-learning approach would
handle the task of citation parsing. Their nal model deployed a Long
ShortTerm Memory (LSTM) neural network with a layered CRF over the output. In
comparison against Parscit [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ], their previous CRF-only based citation parser,
they reported a signi cant (p &lt; 0.01) improvement. However, they failed to
show similar improvements in cross-domain performance and noted that a more
diverse training dataset could help here.
        </p>
        <p>Comparing the results of Prasad and Rodrigues is challenging. They both
use a di erent CRF baseline and both models are trained and evaluated on
di erent datasets. However, given that their available training data is relatively
small their results are promising and highlight the potential of a deep-learning
approach to the problem of citation parsing.
3</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Goal and Methodology</title>
      <p>Our goal was to create a large, diverse and annotated dataset that:</p>
      <sec id="sec-3-1">
        <title>1. Is large enough to train deep neural networks 2. Contains a wide variety of citation styles 3. Contains many di erent citation types, e.g. journal article, books etc. 4. Contains a diverse range of language</title>
        <p>3.1</p>
        <sec id="sec-3-1-1">
          <title>Overview</title>
          <p>
            GIANT was created using 677,000 bibliographic entries from Crossref. Each
Crossref entry was reproduced in over 1,500 styles using Citation Style Languages
(CSL) and the citation processor citeproc-js[
            <xref ref-type="bibr" rid="ref2">2</xref>
            ]. Reference management tools
like Zotero, Mendeley or Docear make use of CSL to automatically generate
references and bibliographies in any required citation style. CSL is an
XMLbased language that provides a machine-readable description of citation styles
and bibliographic format. There are three main components that are used by a
CSL processor to generate a reference string. These are an item's citation style,
metadata information and locale le. As shown in Fig. 5, combing these three
items in a CSL processor will produce a citation string. In Fig. 5 the following
citation string is produced: M. Grennan, 1st August 2019, The 1 Billion Dataset.
          </p>
          <p>In CSL a citation style is an XML le that de nes the format of the citation
string. Each referencing format - Harvard, IEEE etc. - has it's own citation style.
An item's metadata stores the bibliographic details of the entry you wish to cite.
This may include the author's names, the title, date etc. and common formats
for storing an item's metadata include BibTeX, RIS and JSON. Finally, locale
les are used to de ne language-speci c phrases in a citation string. In creating
GIANT we used the US-English locale le and all reference strings in GIANT
are in the English language.</p>
          <p>Training data for ML citation parsers must be labelled XML citation strings
such as that shown in Fig. 6. In order to create this training data the XML
citation styles were edited. These edited citation styles, along with a locale le
and an items metadata, were then combined with a CSL processor to produce
the desired labelled citation strings.</p>
          <p>
            Fig. 7 gives a high-level overview of the process. The citation styles were
edited and combined with citation metadata records and a locale le in a CSL
processor. The nal output is labelled XML citation strings.
To make GIANT diverse, we included 1,564 di erent XML citation styles
obtained from the o cial CSL repository [
            <xref ref-type="bibr" rid="ref3">3</xref>
            ]. The rst task in creating GIANT
was to edit these styles so that each eld would contain a pre x tag (&lt;author&gt;,
&lt;title&gt; etc.) and a su x tag (&lt;/author&gt;, &lt;/title&gt; etc.). Table 3.2 gives
examples of elds both before and after the pre x and su x tags were added.
          </p>
          <p>
            Di erent citation parsing tools require slightly di erent formatting for their
training data. Some tools, such as GROBID [
            <xref ref-type="bibr" rid="ref9">9</xref>
            ], require that all author names are
contained within a single author tag whilst other tools, such as Parscit [
            <xref ref-type="bibr" rid="ref5">5</xref>
            ], require
individual authors to be encapsulated within their own tag. To make GIANT as
widely usable as possible an author's rst name, middle name and surname were
given separate tags. A family tag was used to represent the author's surname
and a given tag was used to represent their rst name and/or middle name.
          </p>
          <p>Fig. 8 shows an example of a macro for author before and after tags for
author, family and given are added. The pre x and su x for family and given
are contained within each individual name-part tag. Before editing, the macro
in Fig. 8 will produce the following string: M. Grennan. After editing, the macro
will produce the following labelled author eld:</p>
          <p>&lt;author&gt;&lt;given&gt;M.&lt;/given&gt; &lt;family&gt;Grennan&lt;/family&gt;&lt;/author&gt;</p>
          <p>Should a citation contain multiple authors or editors their names will be
contained within the outer author tag, for example:</p>
          <p>&lt;author&gt;&lt;given&gt;M.&lt;/given&gt; &lt;family&gt;Grennan&lt;/family&gt;,
&lt;given&gt;U.&lt;/given&gt; &lt;family&gt;McMenamin&lt;/family&gt;&lt;/author&gt;
3.3</p>
        </sec>
        <sec id="sec-3-1-2">
          <title>Item Metadata and Crossref</title>
          <p>
            In order to obtain diversity in domain and citation type a large source of
accessible citation metadata is required. One large, freely-available source of scholarly
metadata is Crossref [
            <xref ref-type="bibr" rid="ref1">1</xref>
            ]. CrossRef is a not-for-pro t organisation that collates,
tags and shares metadata on scholarly publications. Their records contain over a
hundred billion records from a diverse range of academic elds. 677,000 random
records were obtained from Crossref using their public API and their random doi
method.
3.4
          </p>
        </sec>
        <sec id="sec-3-1-3">
          <title>CSL Processor</title>
          <p>
            Citeproc-js [
            <xref ref-type="bibr" rid="ref2">2</xref>
            ] was chosen as the CSL processor for the following reasons. It has
been in operation for over a decade, it is open-source and it is widely used.
          </p>
          <p>In order to use citeproc-js the input data must be in JSON form and follow
the citeproc-js JSON schema. Crossref returned metadata in JSON form but a
number of steps were required to make this JSON compatible with the
citeprocjs JSON schema. These steps included changing tag names and removing any
empty tags or tags not compatible with the citeproc-js JSON schema.
In an e ort to provide information for future users of GIANT three pieces of
metadata were included with each labelled citation. These were:</p>
        </sec>
      </sec>
      <sec id="sec-3-2">
        <title>1. The DOI of the citation</title>
        <p>2. The citation type (book, journal article etc.)
3. The citation style used (Harvard, MLA etc.)
Both the citation style and the citation type were included as indexes and a
separate lookup table is provided for both.
4</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Results</title>
      <p>The source code to create GIANT and instructions on how to download the
dataset (438GB) are available on GitHub https://github.com/BeelGroup/. The
nal format of GIANT is a CSV le with four columns: DOI, citation type,
citation style and labelled citation string. Table 3 gives an example of the layout.</p>
      <p>GIANT comprises of 633,895 unique reference strings, each available in 1,564
styles, resulting in a total of 991,411,100 labelled citation strings. Fig. 9 gives
the percentage breakdown of GIANT by citation type. Journal articles are the
most common type of citation making up 75.9% of GIANT, followed by chapter
citations, 12.4% and conference papers, 5.6%.</p>
      <p>Table 4 provides further detail with columns included for total number of
labelled citations, number of unique citation strings and percentage of dataset.
In GIANT, a container-title tag is used interchangeably to represent journal
titles, book titles and series titles. This is a potential disadvantage as some
citation parsing tools use di erent tags for each of these items. For example, they
may use a journal tag for a journal title and a book tag for a book title. This
disadvantage can be overcome by using the citation type lookup index provided
to map the container-title tag to more meaningful labels such as: journal, book,
conference-paper etc.</p>
      <p>
        As detailed in the related work the majority of existing citation parsing
tools use small, hand-labelled training datasets. Many diverse elds have made
signi cant advances in recent years due to the availability of more data and the
application of deep-learning. The work of Rodrigues et al. [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ] and Prasad et al.
[
        <xref ref-type="bibr" rid="ref14">14</xref>
        ] in 2018 has given an early indication that citation parsing is also likely to
bene t from applying deep-learning methods. The obvious area for future work
would be to train a deep-learning citation parsing tool using GIANT.
      </p>
      <p>GIANT is many orders of magnitude greater than any other available training
dataset. It has been shown to be diverse in citation style, type and domain.
Training a deep learning citation parsing tool with GIANT has the potential to
signi cantly improve the accuracy of citation parsing.
Citation</p>
      <p>Style Language (CSL),
Style</p>
      <p>Language
(CSL),</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>1. Crossref, https://www.crossref.org</mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          <article-title>2. A JavaScript implementation of the https://github</article-title>
          .com/Juris-M/citeproc-js
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          <article-title>3. O cial repository for Citation https://github.com/citation-style-language/styles</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Anzaroot</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>McCallum</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>A New Dataset for Fine-Grained Citation Field Extraction (</article-title>
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Councill</surname>
            ,
            <given-names>I.G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Giles</surname>
            ,
            <given-names>C.L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kan</surname>
          </string-name>
          , M.Y.:
          <article-title>Parscit: an open-source crf reference string parsing package</article-title>
          .
          <source>In: LREC</source>
          . vol.
          <volume>8</volume>
          , pp.
          <volume>661</volume>
          {
          <issue>667</issue>
          (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Fedoryszak</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tkaczyk</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bolikowski</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>Large scale citation matching using apache hadoop</article-title>
          .
          <source>In: International Conference on Theory and Practice of Digital Libraries</source>
          . pp.
          <volume>362</volume>
          {
          <fpage>365</fpage>
          . Springer (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Hetzner</surname>
          </string-name>
          , E.:
          <article-title>A simple method for citation metadata extraction using hidden markov models</article-title>
          .
          <source>In: Proceedings of the 8th ACM/IEEE-CS joint conference on Digital libraries</source>
          . pp.
          <volume>280</volume>
          {
          <fpage>284</fpage>
          .
          <string-name>
            <surname>ACM</surname>
          </string-name>
          (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Lample</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ballesteros</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Subramanian</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kawakami</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dyer</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Neural architectures for named entity recognition</article-title>
          .
          <source>arXiv preprint arXiv:1603.01360</source>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Lopez</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          : Grobid:
          <article-title>Combining automatic bibliographic data recognition and term extraction for scholarship publications</article-title>
          .
          <source>In: International conference on theory and practice of digital libraries</source>
          . pp.
          <volume>473</volume>
          {
          <fpage>474</fpage>
          . Springer (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Ma</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hovy</surname>
          </string-name>
          , E.:
          <article-title>End-to-end sequence labeling via bi-directional lstm-cnns-crf</article-title>
          .
          <source>arXiv preprint arXiv:1603.01354</source>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Mikolov</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sutskever</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Corrado</surname>
            ,
            <given-names>G.S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dean</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          :
          <article-title>Distributed representations of words and phrases and their compositionality</article-title>
          .
          <source>In: Advances in neural information processing systems</source>
          . pp.
          <volume>3111</volume>
          {
          <issue>3119</issue>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Ojokoh</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhang</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tang</surname>
            ,
            <given-names>J.:</given-names>
          </string-name>
          <article-title>A trigram hidden markov model for metadata extraction from heterogeneous references</article-title>
          .
          <source>Information Sciences</source>
          <volume>181</volume>
          (
          <issue>9</issue>
          ),
          <volume>1538</volume>
          {
          <fpage>1551</fpage>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Okada</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Takasu</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Adachi</surname>
          </string-name>
          , J.:
          <article-title>Bibliographic component extraction using support vector machines and hidden markov models</article-title>
          .
          <source>In: International Conference on Theory and Practice of Digital Libraries</source>
          . pp.
          <volume>501</volume>
          {
          <fpage>512</fpage>
          . Springer (
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Prasad</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kaur</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kan</surname>
          </string-name>
          , M.Y.:
          <article-title>Neural parscit: a deep learning-based reference string parser</article-title>
          .
          <source>International Journal on Digital Libraries</source>
          <volume>19</volume>
          (
          <issue>4</issue>
          ),
          <volume>323</volume>
          {
          <fpage>337</fpage>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <given-names>Rodrigues</given-names>
            <surname>Alves</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            ,
            <surname>Colavizza</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            ,
            <surname>Kaplan</surname>
          </string-name>
          ,
          <string-name>
            <surname>F.</surname>
          </string-name>
          :
          <article-title>Deep reference mining from scholarly literature in the arts and humanities</article-title>
          .
          <source>Frontiers in Research Metrics and Analytics</source>
          <volume>3</volume>
          ,
          <issue>21</issue>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Tkaczyk</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          , Collins,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Sheridan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            ,
            <surname>Beel</surname>
          </string-name>
          ,
          <string-name>
            <surname>J.:</surname>
          </string-name>
          <article-title>Machine learning vs. rules and out-of-the-box vs. retrained: An evaluation of open-source bibliographic reference and citation parsers</article-title>
          .
          <source>In: Proceedings of the 18th ACM/IEEE on joint conference on digital libraries</source>
          . pp.
          <volume>99</volume>
          {
          <fpage>108</fpage>
          .
          <string-name>
            <surname>ACM</surname>
          </string-name>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Tkaczyk</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Szostek</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dendek</surname>
            ,
            <given-names>P.J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fedoryszak</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bolikowski</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>Cermine{ automatic extraction of metadata and references from scienti c literature</article-title>
          .
          <source>In: 2014 11th IAPR International Workshop on Document Analysis Systems</source>
          . pp.
          <volume>217</volume>
          {
          <fpage>221</fpage>
          .
          <string-name>
            <surname>IEEE</surname>
          </string-name>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Yin</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          , Zhang,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Deng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            ,
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <surname>D.</surname>
          </string-name>
          :
          <article-title>Metadata extraction from bibliographies using bigram hmm</article-title>
          .
          <source>In: International Conference on Asian Digital Libraries</source>
          . pp.
          <volume>310</volume>
          {
          <fpage>319</fpage>
          . Springer (
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Zhang</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zou</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Le</surname>
            ,
            <given-names>D.X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Thoma</surname>
            ,
            <given-names>G.R.:</given-names>
          </string-name>
          <article-title>A structural svm approach for reference parsing</article-title>
          .
          <source>BMC bioinformatics 12</source>
          (
          <issue>3</issue>
          ),
          <source>S7</source>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>