<!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>Do \Future Work" sections have a purpose? Citation links and entailment for global scientometric questions</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Simone Teufel</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Computer Laboratory, University of Cambridge, and Computer Science Department, Tokyo Institute of Technology</institution>
        </aff>
      </contrib-group>
      <abstract>
        <p>Which tasks in digital libraries might be interesting and addressable for us as a community now in the near future, given the recent developments in NLP? This paper attempts to make a guess. (Instead of actually even attempting to answer the question in its title.) What would we need to do today if we, at some point in the future, wanted to be able to answer this question objectively, quanti ably, and on a large text base? Many similar questions in the same vein exist, such as where the research of a eld as a whole is headed, where the currently most contested research issues in a eld are, which new ideas emerged in the past 5 years, and which ones of these are game-changers. I will argue that we might well be able to o er support for the answering of such questions sometime in the future, particularly if we are willing to turn our attention to entailment and inference in scienti c writing.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>Something always irks me when I read \future work" sections; be it the \future
work" sections of papers I review, those of papers I read for my research, or the
ones I have to compose when writing my own papers. Questions such as { what
exactly is the purpose of these sections, and what is the status of the ideas in
these sections? How should I interpret these descriptions in other papers, and
how should I write my own?</p>
      <p>In terms of communicative function, what a \future work" section is supposed
to accomplish is less clear-cut than, for instance, a \methods" section. Ideas we
express there don't really \count" in terms of the contributions of the paper:
the research ideas we present there are hypothetical (they are not yet done), so
no real contribution can be claimed for them. Lacking a potential reward, why
would we o er up our unprotected secret research plans to anybody who might
want to snatch them? On the other hand, social convention requires that we
write something; we can't just leave the space empty. True, occasionally one has
some ongoing work that one urgently wants to tell the community about, or a
particularly clever idea that ts neatly. But I suspect that many of the ideas I
read about are mechanically written possible avenues for future research, which
get forgotten almost as soon as the paper is published. Maybe they get taken
up by somebody { more likely not. (I know this because I sometimes do this
myself.)</p>
      <p>But \future work" sections could also in principle be like a market for ideas, a
notice board where we announce our true intentions, and where we compete with
our readers { just who manages to beat the time and bring out the next paper
on this hot future topic? Perhaps the main inspiration for a large proportion of
papers ever written was indeed such an open research question previously posed
in a paper the authors read?</p>
      <p>I wished that an enterprising social scientist, bibliometrist or historian of
science did this research, and I also wished he or she would (be able to) use the
large data repositories we now have at our ngertips when doing bibliographic
searches. I would personally like a quanti ably answer, which is precise and
supported by much textual historical evidence. Could this possibly be an application
of large-scale digital libraries in combination with natural language technology?
Maybe not quite yet, but thinking about what we would need in order to answer
this question could provide some near future goals for NLP.</p>
      <p>The short answer to what we would need to do is to match up descriptions of
planned research in an earlier set of papers, with research contributions of papers
later in time (either by the same or by di erent authors). The detailed answer
is more complicated and concerns technologies such as paraphrase detection,
citation link processing, citation block detection, entailment detection and many
more.
1.1</p>
    </sec>
    <sec id="sec-2">
      <title>A Simple Example</title>
      <p>Suppose we nd the following sentence in the \future work" section of a paper.
(1)</p>
      <p>We intend to investigate more sophisticated ways of document
representation and of extracting a citation's context.</p>
      <p>We then start a search for this task, and given that the communicative purpose
of a scienti c paper (its knowledge claim) is generally quite clearly marked, let's
say we nd a paper (by the same authors) in the future of the rst paper (say,
a year later), with the following title:
(2)</p>
      <p>Context Matters: Towards Extracting a Citations Context Using
Linguistic Features
We can't help concluding that the original intention of the authors, stated in
sentence (1) above, must have been real, as it was obviously followed up by
exactly the kind of research predicted. Manually nding examples where other
researchers take up a suggestion from a previous \future work" section is a bit
harder to do. Of course, in many cases we might never nd a good match.</p>
      <p>It is clear that a search engine that could provide a social scientist with
objective, hard data on how many times a plausible match occurs would have to be
pretty intelligent. It is de nitely addressing a text understanding problem. (My
de nition of \text understanding" is \any process that obtains new knowledge,
i.e., something that is true and relevant but that isn't explicitly stated in the
text). My guess is, however, that such a system wouldn't have to be impossibly
intelligent, given today's NLP technology.
1.2</p>
      <p>
        Paraphrases, pragmatic e ects, and concreteness
The rst component we would need is very robust paraphrase detection. Research
in paraphrase detection is long-standing, with many successful approaches [
        <xref ref-type="bibr" rid="ref12 ref3 ref31 ref7">3, 7,
12, 31</xref>
        ]. But we would need capability going beyond paraphrase detection. In
particular, we will need to draw inferences. Understanding how human inference
works, and sometimes being able to automate some of these steps, is an
important part of text understanding, and thus of arti cial intelligence{a worthwhile
exercise in its own right. For the current task at hand, being able to perform
inference would also happen to be extremely useful.
      </p>
      <p>
        The closest we have come as a eld to a shared inference task is the RTE [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ],
and its precursor, FRACAS [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]. In these tasks, systems have to verify or reject
a proposed logical entailment hypothesis between two sentences. While
FRACAS works with hand-crafted sentence pairs and concentrates on entailments
that follow from the manipulation of negation, quanti ers and scope, RTE uses
naturally occurring text. The inferences in RTE generally also require world
knowledge (this is the case for FRACAS to a much lower degree), and because
world knowledge is often not shared exactly across humans, the notion of
entailment becomes somewhat defeasible; ie., instead of \strictly logical" entailment,
a weaker notion of \plausible" entailment (that would generally be accepted by
most humans) is used.
      </p>
      <p>
        This has more recently been complemented by visual entailment tasks, such
as the one based on image captions that underlies the SNLI, the Stanford
Natural Language Inference corpus [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. This is a large-scale task consisting of around
570,000 sentence pairs. The possible hypotheses (entailed ones, non-entailed
ones, and possibly-entailed ones) were elicited from naive humans who did not
see the original image, but only had access to the caption as the basis on which
to form their hypotheses. Of course, such a task de nition excludes cognitive,
communicative and other abstract action, events and objects, which are an
essential part of the inference necessary for understanding real-world text such as
scienti c papers, but it does allow for the training of supervised machine learning
algorithms such as neural networks which require vast training material.
      </p>
      <p>Recognising and processing presuppositions, and implicatures in general, can
also help immensely. Apart from knowing about what is logically entailed in
a text, knowing what is implicated is another important mosaic stone in the
inference puzzle. Implicatures are de ned as those statements about the world
that are assumed to be true by the speaker and transmitted \along with" their
literal message, without being explicitly stated.
(3)
a.
b.</p>
      <p>Miller et al. did not manage to verify whether saturation was reached.</p>
      <p>Miller et al. did not verify whether saturation was reached.</p>
      <p>In contrast to entailment, implicatures cannot be cancelled by negation. If I state
sentence (3-a) above, we understand that Miller et al. attempted the veri cation,
but that the test was inconclusive. If I state sentence (3-b) above, I trigger a
very di erent meaning, namely that they didn't want to verify, and probably
didn't even run the test. Please also note that the presupposition \they had
the intention of verifying" survives even if we turn the negative sentence into a
positive one.</p>
      <p>This is a remarkable di erence, in that sentences (3-a) and (3-b) are
truthconditionally equivalent; the only thing that distinguishes them is the verb
manage to. Presuppositions are distinguished from general implicatures in that they
are lexically trigged.
(4)</p>
      <p>Miller attempted to model how X works.</p>
      <p>Miller modelled how X works.</p>
      <p>
        Another example concerns conversational implicatures. Stating sentence (4-a)
above conversationally implicates that Miller et al. didn't manage to
satisfactorily model how X works. (If they had, in the author's opinion, then sentence (4-b)
would have been more appropriate. This follows from the Gricean maxims [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ],
according to which one should always state the strongest relevant and true
statement one possibly can. \modelling" (i.e., attempting to model and then
succeeding) is stronger than simply \attempting to model".
      </p>
      <p>
        There are few works that model pragmatic reasoning e ects
computationally on a large scale, but some resources such as presupposition trigger lexicons
have been created, and some automatic research exists on detecting
presuppositions and implicatures beween pairs of verbs, e.g. [
        <xref ref-type="bibr" rid="ref29">29</xref>
        ]. In Cambridge, there is
some recent work on determining how the inference involved in interpreting \let
alone" sentences can be automated [
        <xref ref-type="bibr" rid="ref27">27</xref>
        ], which also involves decisions on possible
presupposition links between two statements.
      </p>
      <p>Overall, I believe that such works can contribute towards the question in the
title of this paper { nding links between people's proclaimed intentions of doing
something (as stated in the \future work" sections), and the reports of actually
having done that thing (in a research paper). They can potentially also help nd
similarities between methods used in di erent papers, and determine what the
exact di erence might be in cases where a contrast between some methods exists
but where the nature of the di erence is not spelled out by the authors.</p>
      <p>Scienti c writing, like all texts, contain many implicatures. According to
the Gricean Maxims, we would be insulting the reader's intelligence (or sound
pompous) if we tell them more than they need to know to make the inference
themselves, and the search space for possible inferences is very, very large. In my
opinion, any work on automatic inference should therefore start with the
clearcut, small-step cases, such as presuppositions and implicatures, where there is
normally very high human agreement that these statements have objectively
been asserted into the discourse, and what the implicature is. This is opposed to
other types of inference, where much more world knowledge is needed to make
the inference.</p>
      <p>Finally, I will propose that judging the \abstractness" of a \future work"
item would also be useful. This could serve to distinguish the following pair of
sentences:
(5)
a. In future work we intend to evaluate the algorithm as part of a
dialogue understanding system on state of the art benchmarks.
b. . . . it is not known exactly how well the model will perform in the
real world. Future work will examine installing models in real world
applications.</p>
      <p>
        The rst avenue for future work (sentence (5-a)) is quite concrete, and the
chances are high that the researchers, having already implemented their
algorithm, might conceivably next perform the rather concrete action of running an
evaluation. In sentence (5-b), the future work suggested sounds abstract and
vague, and like work of a di erent kind altogether, for which the research team
probably are neither equipped, nor have any real intention of doing. Research in
metaphor classi cation has contributed some methods for addressing the task of
judging the abstractness of phrases [
        <xref ref-type="bibr" rid="ref26 ref30">30, 26</xref>
        ]
1.3
      </p>
    </sec>
    <sec id="sec-3">
      <title>Global Scientometric Questions</title>
      <p>Predicting which \future work" suggestion is taken up in later work is an exciting
task. An additional question is that if some such suggestion does get taken up,
whether it is by the authors of the original paper or by somebody else. Given
an acceptably precision matching procedure, a natural gold standard for the
prediction task o ers itself, because in citation-based research we can manipulate
the time scale of papers we take into account, in order to simulate a \future"
that is to be predicted.</p>
      <p>
        There are various related scientometric questions we might ask about the
development of a eld, such as the task of describing the emergence and
development of a scienti c eld [
        <xref ref-type="bibr" rid="ref19 ref4">4, 19</xref>
        ], determining schools of thought [
        <xref ref-type="bibr" rid="ref1 ref22">22, 1</xref>
        ], nding the
occurrence of scienti c revolutions and paradigm shifts [
        <xref ref-type="bibr" rid="ref13 ref20">20, 13</xref>
        ], identifying the
scienti c areas where the most innovation currently occurs [
        <xref ref-type="bibr" rid="ref6 ref9">9, 6</xref>
        ], and detecting
the emergence of scienti c ideas [
        <xref ref-type="bibr" rid="ref21 ref23">21, 23</xref>
        ]. These questions have traditionally been
answered manually or purely quantitatively, and more recently with the help of
natural language processing technology such as automatic sentiment detection
and citation function classi cation [
        <xref ref-type="bibr" rid="ref14 ref15 ref17 ref18 ref2 ref24 ref25 ref28 ref8">25, 15, 24, 28, 18, 2, 14, 8, 17</xref>
        ]. My argument
here is that we need not stop there. In my opinion, these existing methods could
gainfully be complemented with computational linguistics research studying
textual entailment, text understanding and pragmatics of scienti c writing.
      </p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Allen</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>Referring to schools of thought: An example of symbolic citations</article-title>
          .
          <source>Social Studies of Science</source>
          <volume>27</volume>
          (
          <issue>6</issue>
          ),
          <volume>937</volume>
          {
          <fpage>949</fpage>
          (
          <year>1997</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Athar</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Teufel</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Detection of implicit citations for sentiment detection</article-title>
          .
          <source>In: Proceedings of ACL-12 Workshop on Discovering Structure in Scholarly Discourse. Jeju Island</source>
          , South Korea (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Barzilay</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lee</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>Learning to paraphrase: an unsupervised approach using multiple-sequence alignment</article-title>
          .
          <source>In: Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology-Volume 1</source>
          . pp.
          <volume>16</volume>
          {
          <fpage>23</fpage>
          .
          <article-title>Association for Computational Linguistics (</article-title>
          <year>2003</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Bettencourt</surname>
            ,
            <given-names>L.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ulwick</surname>
            ,
            <given-names>A.W.:</given-names>
          </string-name>
          <article-title>The customer-centered innovation map</article-title>
          .
          <source>Harvard Business Review</source>
          <volume>86</volume>
          (
          <issue>5</issue>
          ),
          <volume>109</volume>
          (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Bowman</surname>
            ,
            <given-names>S.R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Angeli</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Potts</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Manning</surname>
            ,
            <given-names>C.D.:</given-names>
          </string-name>
          <article-title>A large annotated corpus for learning natural language inference</article-title>
          .
          <source>arXiv preprint arXiv:1508.05326</source>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Boyack</surname>
            ,
            <given-names>K.W.</given-names>
          </string-name>
          :
          <article-title>Thesaurus-based methods for mapping contents of publication sets</article-title>
          .
          <source>Scientometrics</source>
          <volume>111</volume>
          (
          <issue>2</issue>
          ),
          <volume>1141</volume>
          {
          <fpage>1155</fpage>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Callison-Burch</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Syntactic constraints on paraphrases extracted from parallel corpora</article-title>
          .
          <source>In: Proceedings of the Conference on Empirical Methods in Natural Language Processing</source>
          . pp.
          <volume>196</volume>
          {
          <fpage>205</fpage>
          .
          <article-title>Association for Computational Linguistics (</article-title>
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Catalini</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lacetera</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Oettl</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>The incidence and role of negative citations in science</article-title>
          .
          <source>Proceedings of the National Academy of Sciences</source>
          <volume>112</volume>
          (
          <issue>45</issue>
          ),
          <volume>13823</volume>
          {
          <fpage>13826</fpage>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ibekwe-SanJuan</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hou</surname>
            ,
            <given-names>J.:</given-names>
          </string-name>
          <article-title>The structure and dynamics of cocitation clusters: A multiple-perspective cocitation analysis</article-title>
          .
          <source>Journal of the Association for Information Science and Technology</source>
          <volume>61</volume>
          (
          <issue>7</issue>
          ),
          <volume>1386</volume>
          {
          <fpage>1409</fpage>
          (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Cooper</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Crouch</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Van Eijck</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fox</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Van Genabith</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jaspars</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kamp</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Milward</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pinkal</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Poesio</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          , et al.:
          <article-title>Using the framework</article-title>
          .
          <source>Tech. rep.</source>
          ,
          <source>Technical Report LRE 62-051 D-16</source>
          , The FraCaS Consortium (
          <year>1996</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Dagan</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Glickman</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Magnini</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>The pascal recognising textual entailment challenge</article-title>
          . In:
          <article-title>Machine learning challenges. evaluating predictive uncertainty, visual object classi cation, and recognising tectual entailment</article-title>
          , pp.
          <volume>177</volume>
          {
          <fpage>190</fpage>
          . Springer (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Das</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Smith</surname>
            ,
            <given-names>N.A.</given-names>
          </string-name>
          :
          <article-title>Paraphrase identi cation as probabilistic quasi-synchronous recognition</article-title>
          .
          <source>In: Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP: Volume 1-</source>
          Volume 1. pp.
          <volume>468</volume>
          {
          <fpage>476</fpage>
          .
          <article-title>Association for Computational Linguistics (</article-title>
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>De</surname>
            <given-names>Langhe</given-names>
          </string-name>
          , R.:
          <article-title>Towards the discovery of scienti c revolutions in scientometric data</article-title>
          .
          <source>Scientometrics</source>
          <volume>110</volume>
          (
          <issue>1</issue>
          ),
          <volume>505</volume>
          {
          <fpage>519</fpage>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Ding</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhang</surname>
          </string-name>
          , G.,
          <string-name>
            <surname>Chambers</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Song</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zha</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Content-based citation analysis: The next generation of citation analysis</article-title>
          .
          <source>Journal of the Association for Information Science and Technology</source>
          <volume>65</volume>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Garzone</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mercer</surname>
            ,
            <given-names>R.E.</given-names>
          </string-name>
          :
          <article-title>Towards an automated citation classi er</article-title>
          .
          <source>In: Proceedings of the 13th Biennial Conference of the CSCI/SCEIO (AI-2000)</source>
          . pp.
          <volume>337</volume>
          {
          <issue>346</issue>
          (
          <year>2000</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Grice</surname>
            ,
            <given-names>H.P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cole</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          , Morgan, J., et al.:
          <article-title>Logic and conversation</article-title>
          .
          <source>1975</source>
          pp.
          <volume>41</volume>
          {
          <issue>58</issue>
          (
          <year>1975</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Jha</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jbara</surname>
            ,
            <given-names>A.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Qazvinian</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Radev</surname>
            ,
            <given-names>D.R.</given-names>
          </string-name>
          :
          <article-title>Nlp-driven citation analysis for scientometrics</article-title>
          .
          <source>Natural Language Engineering</source>
          <volume>23</volume>
          (
          <issue>1</issue>
          ),
          <volume>93</volume>
          {
          <fpage>130</fpage>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Kaplan</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Iida</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tokunaga</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Automatic extraction of citation contexts for research paper summarization: A coreference-chain based approach</article-title>
          .
          <source>In: Proceedings of the 2009 Workshop on Text and Citation Analysis for Scholarly Digital Libraries</source>
          . pp.
          <volume>88</volume>
          {
          <fpage>95</fpage>
          .
          <article-title>Association for Computational Linguistics (</article-title>
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Kiss</surname>
            ,
            <given-names>I.Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Broom</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Craze</surname>
            ,
            <given-names>P.G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rafols</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          :
          <article-title>Can epidemic models describe the di usion of topics across disciplines</article-title>
          ?
          <source>Journal of Informetrics</source>
          <volume>4</volume>
          (
          <issue>1</issue>
          ),
          <volume>74</volume>
          {
          <fpage>82</fpage>
          (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>Kuhn</surname>
            ,
            <given-names>T.S.:</given-names>
          </string-name>
          <article-title>The Structure of Scienti c Revolutions, 2nd enl</article-title>
          . ed. University of Chicago Press (
          <year>1970</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <surname>Kuhn</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Perc</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Helbing</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Inheritance patterns in citation networks reveal scienti c memes</article-title>
          .
          <source>Physical Review X</source>
          <volume>4</volume>
          (
          <issue>4</issue>
          ),
          <volume>041036</volume>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          22.
          <string-name>
            <surname>McCain</surname>
            ,
            <given-names>K.W.</given-names>
          </string-name>
          :
          <article-title>Cocited author mapping as a valid representation of intellectual structure</article-title>
          .
          <source>Journal of the American society for information science 37</source>
          (
          <issue>3</issue>
          ),
          <volume>111</volume>
          (
          <year>1986</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          23.
          <string-name>
            <surname>McKeown</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Daume</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chaturvedi</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Paparrizos</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Thadani</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Barrio</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Biran</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bothe</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          , Collins,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Fleischmann</surname>
          </string-name>
          ,
          <string-name>
            <surname>K.R.</surname>
          </string-name>
          , et al.:
          <article-title>Predicting the impact of scienti c concepts using full-text features</article-title>
          .
          <source>Journal of the Association for Information Science and Technology</source>
          <volume>67</volume>
          (
          <issue>11</issue>
          ),
          <volume>2684</volume>
          {
          <fpage>2696</fpage>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          24.
          <string-name>
            <surname>Nakov</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schwarz</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hearst</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          : Citances:
          <article-title>Citation sentences for semantic analysis of bioscience text</article-title>
          .
          <source>In: SIGIR'04 Workshop on Search and Discovery in Bioinformatics</source>
          (
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          25.
          <string-name>
            <surname>Nanba</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Okumura</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Towards multi-paper summarization using reference information</article-title>
          .
          <source>In: Proceedings of the XXth International Joint Conference on Arti cial Intelligence (IJCAI-99)</source>
          . pp.
          <volume>926</volume>
          {
          <issue>931</issue>
          (
          <year>1999</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          26.
          <string-name>
            <surname>Neuman</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Assaf</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cohen</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Last</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Argamon</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Howard</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Frieder</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          :
          <article-title>Metaphor identi cation in large texts corpora</article-title>
          .
          <source>PloS one 8</source>
          (
          <issue>4</issue>
          ),
          <year>e62343</year>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          27.
          <string-name>
            <surname>Razuvayevskaya</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Teufel</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Finding enthymemes in real-world texts: a feasibility study</article-title>
          .
          <source>Argument and Computation</source>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          28.
          <string-name>
            <surname>Teufel</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Siddharthan</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tidhar</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Automatic classi cation of citation function</article-title>
          .
          <source>In: Proceedings of EMNLP-06</source>
          (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          29.
          <string-name>
            <surname>Tremper</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Frank</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>A discriminative analysis of ne-grained semantic relations including presupposition: Annotation and classi cation</article-title>
          .
          <source>Dialogue &amp; Discourse</source>
          <volume>4</volume>
          (
          <issue>2</issue>
          ),
          <volume>282</volume>
          {
          <fpage>322</fpage>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          30.
          <string-name>
            <surname>Turney</surname>
            ,
            <given-names>P.D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Neuman</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Assaf</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cohen</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          :
          <article-title>Literal and metaphorical sense identi cation through concrete and abstract context</article-title>
          .
          <source>In: Proceedings of the Conference on Empirical Methods in Natural Language Processing</source>
          . pp.
          <volume>680</volume>
          {
          <fpage>690</fpage>
          .
          <article-title>Association for Computational Linguistics (</article-title>
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          31.
          <string-name>
            <surname>Xu</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ritter</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Grishman</surname>
          </string-name>
          , R.:
          <article-title>Gathering and generating paraphrases from twitter with application to normalization</article-title>
          .
          <source>In: Proceedings of the Sixth Workshop on Building and Using Comparable Corpora</source>
          . pp.
          <volume>121</volume>
          {
          <issue>128</issue>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>