<!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>International Workshop on Knowledge Graph Summarization, October</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>More Informative List Verbalisations</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Lea Krause</string-name>
          <email>l.krause@vu.nl</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Pia Sommerauer</string-name>
          <email>pia.sommerauer@vu.nl</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Piek Vossen</string-name>
          <email>p.t.j.m.vossen@vu.nl</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>KGQA</institution>
          ,
          <addr-line>List verbalisation, Ranking, Summarisation, Gricean maxims</addr-line>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Vrije Universiteit Amsterdam</institution>
          ,
          <country country="NL">The Netherlands</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2022</year>
      </pub-date>
      <volume>23</volume>
      <issue>2022</issue>
      <fpage>136</fpage>
      <lpage>146</lpage>
      <abstract>
        <p>In this paper we propose the task of list verbalisation within a Knowledge Graph Question Answering system. Inspired by the Gricean Maxims of Quantity, Relation, and Manner we show a proof of concept ranking answer candidates through graph-based and language model-based measurements for on the one hand popularity and on the other hand a more pragmatically informed context. Our finding show that in our current set-up graph-based measures work best, while language model-based systems need further refinement and may benefit from approaches such as fine-tuning or prompting. We evaluate our approach with a user study and give insights into promising future directions of the task.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        Question Answering (QA) systems are becoming more prevalent in both research and
realworld applications such as virtual assistants like Siri or Alexa. With vast amounts of structured
knowledge available in ontologies, they have been a key element in furthering QA development
and adaptation. Up until recently their answers were however limited to formal query responses,
which limit usefulness for conversational systems as well as non-expert users. To increase
naturalness and understanding [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], a recent focus of Knowledge Graph Question Answering
(KGQA) systems has been the verbalisation of the query answer [
        <xref ref-type="bibr" rid="ref1 ref2 ref3 ref4">1, 2, 3, 4</xref>
        ]. They take the
generated formal query response and present it in natural language, for example by taking into
account the wording of the question [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. While investigating existing data sets we noticed that
(long) list answers are currently poorly dealt with or excluded from the data. We see filling this
gap as a natural next step in towards more informative and natural KGQA verbalisation.
      </p>
      <p>
        Responses consisting of a whole list present the user with information overload, in particular
when questions result in a large number of answers. They will most likely not succeed in
ifnding an answer that is informative to them. From a pragmatic perspective, we can analyse
the likely success of a question-answer exchange through the lens of the co-operative principle
consisting of four maxims proposed by Grice [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. We focus on the maxims of Quantity, Relation,
and Manner to improve the communication of the results. Consequently, we slightly alter the
LGOBE
(P. Vossen)
https://lkra.github.io/ (L. Krause); https://piasommerauer.github.io (P. Sommerauer); https://vossen.info
© 2022 Copyright for this paper by its authors. Use permitted under Creative Commons License Attribution 4.0 International (CC BY 4.0).
CEUR
suggested verbalisation template, cut down the list of given answers and pick the most relevant
ones. This can be done in a generic way, picking the most popular one, or in a context-dependent
way, in which we consider previous conversations, the user, or the specific application. We give
preliminary results of our method based on a small user study.
      </p>
      <p>Our approach combines summarisation and ranking, to find the most informative answer
for the user. It is a first step to, on the one hand, the verbalisation of more complex formal
query responses, and on the other hand the inclusion of context in the summarisation and
verbalisation of structured data.</p>
      <p>
        Our contributions in this paper are as follows:
1. Task We create the new task of list verbalisation, which was previously neglected
(VQuAnDa [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]) or excluded (VANiLLa [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]) from KG verbalisation tasks. The focus lies
on the combination with context cues as secondary properties which can personalise or
diversify the verbalisation.
2. Implementation We show a proof of concept and implement first measurements for
popularity and context cue specific verbalisation.
3. System Comparison We conduct a system comparison between language model-based
and graph-based metrics and verify our set-ups with human evaluation.
      </p>
    </sec>
    <sec id="sec-2">
      <title>2. Related work</title>
      <p>As our task and evaluation approach are influenced by a range of research fields, we will describe
previous approaches from a range of fields including KGQA systems, data-to-text generation,
summarisation, ranking, and their evaluations. To the best of our knowledge, this paper is the
ifrst exploration of list verbalisation in the context of Gricean maxims.</p>
      <sec id="sec-2-1">
        <title>2.1. QA tasks and systems</title>
        <p>
          Most QA systems can be divided into two groups. The first group works with unstructured data
such as SQuAD [
          <xref ref-type="bibr" rid="ref6 ref7">6, 7</xref>
          ] or CoQA [8], while the second is based on structured knowledge such as
DBpedia [9] or Wikidata [10].
        </p>
        <p>In a KGQA task the question is given in natural language, gets translated into a query, queries
a database and retrieves an answer. The most common data in KGQA sets are the editions
of QALD [11] and LC-QuAD [12]. The former’s focus has over the years shifted towards
multi-linguality [13]. The latter provides a data set of 5000 complex question-query pairs over
DBpedia.</p>
      </sec>
      <sec id="sec-2-2">
        <title>2.2. A data to text problem</title>
        <p>Our focus lies on the verbalisation of the formal query response, turning the problem into a
data-to-text task. Most approaches for this task are based on WebNLG [14] and more recently
AGENDA [15] and use either transformers [15, 16] or Graph Neural Nets (GNN) [17]. Most of
the previously described tasks are however too domain specific to be applied to an open-domain
knowledge graph like DBpedia or Wikidata.</p>
        <p>
          Data sets that have specifically explored verbalisation in a KGQA context are VQuAnDa [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ],
VANiLLa [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ], ParaQA [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ]. VQuAnDa [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ] consists of 5000 complex questions, SPARQL queries
and answer verbalisation. ParaQA [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ] expands the verbalised answers of VQuAnDa with two to
eight paraphrased natural language responses per question. VANiLLa [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ] contains 100k simple
questions with their respective queries and verbalised answers, adapted from CSQA [
          <xref ref-type="bibr" rid="ref8">18</xref>
          ] and
SimpleQuestionsWikidata [
          <xref ref-type="bibr" rid="ref9">19</xref>
          ]. When dealing with lists, VQuAnDa and ParaQA give a filler
token [answer]instead of the full list in their verbalised sentences. VANiLLa, on the other hand,
excludes list question-answer pairs. We focus on the question-answer pairs containing lists in
VQuAnDa.
        </p>
        <p>
          List verbalisation can be approached from the perspective of ranking with respect to relevance.
Approaches considering the ranking of multiple query response options have been extensively
studied in the field Information Retrieval, ranking from early symbolic approaches [
          <xref ref-type="bibr" rid="ref10">20</xref>
          ] to
recent neural ranking models [
          <xref ref-type="bibr" rid="ref11 ref12">21, 22</xref>
          ]. Within graphical entity summarisation there have been
approaches focusing on relevance-oriented entity summarisation [
          <xref ref-type="bibr" rid="ref13">23</xref>
          ] and diversity [
          <xref ref-type="bibr" rid="ref14">24</xref>
          ] though
they difer from ours by specifically aiming to provide generic summaries instead of a context
dependent ones.
        </p>
        <p>
          Context in Information Retrieval and Summarisation systems is mostly based on
personalisation of the results for the user based on their previous interaction with the system [
          <xref ref-type="bibr" rid="ref15 ref16 ref17 ref18">25, 26, 27, 28</xref>
          ].
Other forms of context can include location metadata or time [29].
        </p>
      </sec>
      <sec id="sec-2-3">
        <title>2.3. Evaluation in terms of Gricean Maxims</title>
        <p>
          Our evaluation is guided by the Gricean maxims [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ] of Quantity, Relation and Manner. They
define principles that should be fulfilled in order to successfully communicate. The maxim of
Quantity states that all necessary information should be given, but not more than the intent of
the question requires. This guides our general reduction of answers given and reformulation of
the answer template. The maxim of Relation stresses the importance of adapting the information
to be relevant to the communication partner, in this case the user. The maxim of Manner states
that communication should be orderly and brief, avoiding obscurity and ambiguity. The maxims
are widely used within pragmatics and have been applied to time series summarisation [30]
and recently chatbots [31]. Other common metrics in NLG evaluation are ROUGE, BLEU and
METEOR; these are, however, based on n-gram similarity which is not suitable for our case
since there is no ground truth available for comparison. Furthermore, these measures fail to
take pragmatic factors like purpose or context into account [32]. We aim to go beyond existing
approaches and directly evaluate the output of our systems through human judgements of
whether the verbalisations adhere to the maxims of Quantity, Relation, and Manner.
        </p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. Task</title>
      <p>We propose a the new task of list verbalisation with respect to the Gricean maxims of Quantity,
Relation, and Manner. Given a long answer list, the task is to select a small number of items
that serve to illustrate the most relevant information conveyed by the list.</p>
      <p>What is relevant to the user can be highly situation-dependent and depend on individual
factors specific to the user. In this first approach, we define a number of specific contextual
cues that define what is relevant for the user. In the simplest scenario, we assume that the user
is simply interested in the most popular examples from the entire list.</p>
      <p>Another reason to not only work with the highest scores is that they enforce popularity bias.
DBpedia is based on Wikipedia which is predominantly white, western and male [33, 34, 35, 36].
Cues are an option to diversify or personalise results and increase the exposure of non-popular
items.</p>
      <p>The contextual cues should reflect relatively open secondary factors. We currently use the
following: location (place of birth, place of publication, nationality), time (recency, time of
publication, date of birth), genre, and gender.</p>
      <p>We illustrate the task using the following question / verbalisation pair:
Question: ”Whose work is in the Musée d’Orsay?”</p>
      <p>VQuAnDa answer template: ”The artists of the artworks located in the Musée d’Orsay are
[answer].”</p>
      <p>The place holder [answer] is filled with 30 names (see step 1 Figure 1), which is still on the
lower end, as the number of items in such lists can exceed 1000. Giving an answer consisting
of 30 names would be a violation of the Gricean Maxim of Quantity since it presents more
information than can be the assumed was intent of the user’s question. This can lead to an
information overload and the relevant information being buried. An answer consisting of three
very popular artists (Vincent van Gogh, Paul Gauguin, Henri Matisse), however, would not
violate the maxim and can be considered relevant. If we want to consider a particular context
(e.g. a previous conversational context of female artists), another subset of artists can provide a
relevant answer (e.g. examples of female artists).</p>
    </sec>
    <sec id="sec-4">
      <title>4. Method</title>
      <p>
        We explore two approaches to list verbalisation: A language-model based approach and a
knowledge-graph based approach. In both approaches, we aim to rank the answer list with
respect to popularity or a particular contextual cue to retrieve the most relevant answers. After
a brief outline of the data we work with (Section 4.1), we introduce the two ranking approaches
we use to generate answers (Section 4.2). Finally, we describe the set-up of our human evaluation
(Section 4.3).
4.1. Data
As described in section 2, available verbalisation data sets and systems do not currently deal
with long list answers in an adequate manner. VQuAnDa [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] contains 444 examples (8.9%) that
have 15 or more answers and are therefore not verbalised. From these examples, we select ten
instances for our exploratory experiments. The lists range in number of answer candidates
from 13 to 1239. We only select 10 instances, as our evaluations relies on human judgements of
system output.
      </p>
      <sec id="sec-4-1">
        <title>4.2. Ranking and answer-generation</title>
        <p>We construct list verbalisations containing the top- list items retrieved by our raking
approaches. The final verbalisation is presented through a template. Consider the example below
showing the answer to the questions about artists in the Musée d’Orsay (introduced in Section 3).
New answer template: ”The artists of the artworks located in the Musée d’Orsay are for
example [top-] and [n - top-] others.”
Our template is only going to verbalise the top- answers and enumerates the rest of the list, to
still convey the information of more answers being present.</p>
        <p>We use two diferent techniques to identify the top-  answer candidates, the probability given
to an answer candidate by a language model (GPT-2 [37], LM) and the density of a constructed
graph for an answer candidate. Both ranking approaches only consider the items already
provided in the list.</p>
        <sec id="sec-4-1-1">
          <title>4.2.1. Language model-based measures</title>
          <p>We can expect that language model prediction can, at least to some degree, reflect the relevance
of an answer-candidate with respect to a particular context. To score the answer options, we
ifrst create a template to fill with singular answers instead of plural. This is done by converting
the subject and predicate of the sentence into singular. For the museum example this means:
Singular answer template: ”An artist of the artworks located in the Musée d’Orsay is
[answer].”
When ranking answers with respect to a contextual cue, we currently add the cue to the
template sentence, after which the answer candidates are ranked:
Singular answer template with gender cue: ”A female artist of the artworks located in the
Musée d’Orsay is [answer].”
We fill the answer slot for each answer candidate and use GPT-2 1 to calculate the answer’s
log-likelihood and perplexity. Upon initial qualitative exploration, we noticed that log-likelihood
provided better answers than expected, despite its tendency to penalise longer answers (e.g.
names consisting of multiple tokens). As expected, perplexity also resulted in high-quality
answers. When investigating the correlation between answer length and LM scoring more
closely we found that while maximising for log-likelihood significantly penalises answers for
being long, minimising for perplexity overly rewards them (see Figure 2a). We include both
metrics in our experiments to establish whether humans may have a preference for shorter or
longer list items in the answers.
(a) Influence of answer length on log-likelihood
(b) Influence of answer length on perplexity</p>
        </sec>
        <sec id="sec-4-1-2">
          <title>4.2.2. Graph-based measures</title>
          <p>To retrieve relevant answers from a graph, we construct the corresponding graph of each answer
candidate containing all outgoing nodes. To identify the most relevant graph we use density
(D):
||
 =</p>
          <p>| |(| | − 1)
where  is the number of edges and  is the number of nodes in the graph. Density reflects
how well connected a graph is and can thus be seen as an approximation of popularity. More
recently it has also been shown to correlate well with human judgements in the evaluation of
open-domain dialogue systems [38]. The higher the density of the graph, the higher we rank
the corresponding answer option. For an example result see step 2 in Figure 1. To calculate
density for lists with specific contextual cures, we add an additional restriction containing the
context cue.</p>
          <p>While we considered a more commonly used metric such as PageRank, the implementation
would have led to the loss of examples since DBpedia does not currently provide a PageRank
measurement in its SPARQL endpoint. Reformatting to for example the Wikidata format would
have lead to either loss of examples and answer options due to an imperfect mapping or labour
intensive human input.</p>
        </sec>
      </sec>
      <sec id="sec-4-2">
        <title>4.3. Human evaluation</title>
        <p>The goal of our evaluation is to establish whether potential users prefer the verbalisations
created by our ranking approaches over the original, long lists. In addition, we check whether
the ranked examples in our verbalisations are perceived as more helpful than random examples.
We thus create verbalised answer options with rankings according to randomness (unranked),
log-likelihood, perplexity and density.</p>
        <p>In order to verify our ranking we conducted a survey with 10 participants. For each of the
selected examples they were presented with five verbalised answer rankings: Random order,
ranked by log-likelihood, by perplexity, and by density. As a fith alternative we included an
option to indicate if they thought the full list would have been more suitable. They then ranked
the options from most (1rst choice) to least (5th choice) relevant. Context cues were included
as a highlighted word below the question and participants were instructed to include them in
their ranking. Participants were told to not rank questions if they were too unfamiliar with the
topic in question2.</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Results</title>
      <p>In our experiments we are taking the first steps in providing a proof of concept for our extractive
summarisation and context cues. For each approach, we fill our answer template (see Section
4.2) with the top- =3 ranking results. The results of the human ratings are summarised in
Table 1 (general popularity ranking) and Table 2 (ranking with respect to context cues). The
Tables show how many times an answer created through the diferent ranking methods was
placed on a particular rank by the human participants.</p>
      <p>The participants clearly favoured density over the other measures for both popularity and
context cue options. Log-likelihood outperforms perplexity in case of popularity, but both are
ranked lower than random when including the context cue. A promising finding is that even for
shorter lists, the adjusted verbalisation was preferred over the full list. The low performance of
the LM-based measurements could be improved by fine-tuning on the task or using prompting,
which we are considering as next steps.
2One participant accidentally left out a question in the popularity ranking option leading to one score less than in
the context cue option.</p>
    </sec>
    <sec id="sec-6">
      <title>6. Conclusion</title>
      <p>We identified the task of list verbalisation as a subtask of KGQA Answer Verbalisation. We
show a first proof of concept ranking answers incorporating both graph-based and language
model-based measurements to identify the most informative answer candidates. We base our
approach on the Gricean Maxims and show that popularity alone might not sufice to create an
informative answer. We are currently including only the Maxims of Quantity, Relation, and
Manner, but hope to expand to the Maxim of Quality in the future. We will do this by moving
from our current extractive summaries to more abstractive renditions. Instead of slot filling we
will work on full pipeline or end-to-end verbalisation systems.</p>
    </sec>
    <sec id="sec-7">
      <title>Acknowledgments</title>
      <p>This research was funded by the Vrije Universiteit Amsterdam and the Netherlands Organisation
for Scientific Research (NWO) through the Hybrid Intelligence Centre via the Zwaartekracht
grant (024.004.022), and the Spinoza grant (SPI 63-260) awarded to Piek Vossen. We would also
like to thank the reviewers for their excellent feedback that enhanced this paper. All remaining
errors are our own.
tics, Melbourne, Australia, 2018, pp. 784–789. URL: https://aclanthology.org/P18-2124.
doi:10.18653/v1/P18- 2124.
[8] S. Reddy, D. Chen, C. D. Manning, CoQA: A Conversational Question Answering Challenge,
Transactions of the Association for Computational Linguistics 7 (2019) 249–266. URL:
https://aclanthology.org/Q19-1016. doi:10.1162/tacl_a_00266, place: Cambridge, MA
Publisher: MIT Press.
[9] S. Auer, C. Bizer, G. Kobilarov, J. Lehmann, R. Cyganiak, Z. Ives, DBpedia: A Nucleus for
a Web of Open Data, in: K. Aberer, K.-S. Choi, N. Noy, D. Allemang, K.-I. Lee, L. Nixon,
J. Golbeck, P. Mika, D. Maynard, R. Mizoguchi, G. Schreiber, P. Cudré-Mauroux (Eds.), The
Semantic Web, Lecture Notes in Computer Science, Springer, Berlin, Heidelberg, 2007, pp.
722–735. doi:10.1007/978- 3- 540- 76298- 0_52.
[10] D. Vrandečić, M. Krötzsch, Wikidata: a free collaborative knowledgebase, Communications
of the ACM 57 (2014) 78–85. Publisher: ACM New York, NY, USA.
[11] V. Lopez, C. Unger, P. Cimiano, E. Motta, Evaluating question answering over linked data,
Web Semantics Science Services And Agents On The World Wide Web 21 (2013) 3–13.
doi:10.1016/j.websem.2013.05.006, publisher: Elsevier.
[12] P. Trivedi, G. Maheshwari, M. Dubey, J. Lehmann, LC-QuAD: A Corpus for Complex
Question Answering over Knowledge Graphs, in: C. d’Amato, M. Fernandez, V. Tamma,
F. Lecue, P. Cudré-Mauroux, J. Sequeda, C. Lange, J. Heflin (Eds.), The Semantic Web – ISWC
2017, volume 10588, Springer International Publishing, Cham, 2017, pp. 210–218. URL: http:
//link.springer.com/10.1007/978-3-319-68204-4_22. doi:10.1007/978- 3- 319- 68204- 4_
22, series Title: Lecture Notes in Computer Science.
[13] A. Perevalov, D. Diefenbach, R. Usbeck, A. Both, QALD-9-plus: A Multilingual Dataset for
Question Answering over DBpedia and Wikidata Translated by Native Speakers, in: 2022
IEEE 16th International Conference on Semantic Computing (ICSC), 2022, pp. 229–234.
doi:10.1109/ICSC52841.2022.00045, iSSN: 2325-6516.
[14] T. Castro Ferreira, D. Moussallem, E. Krahmer, S. Wubben, Enriching the WebNLG corpus,
in: Proceedings of the 11th International Conference on Natural Language Generation,
Association for Computational Linguistics, Tilburg University, The Netherlands, 2018, pp.
171–176. URL: https://aclanthology.org/W18-6521. doi:10.18653/v1/W18- 6521.
[15] R. Koncel-Kedziorski, D. Bekal, Y. Luan, M. Lapata, H. Hajishirzi, Text Generation from
Knowledge Graphs with Graph Transformers, in: Proceedings of the 2019 Conference of
the North American Chapter of the Association for Computational Linguistics: Human
Language Technologies, Volume 1 (Long and Short Papers), Association for Computational
Linguistics, Minneapolis, Minnesota, 2019, pp. 2284–2293. URL: https://aclanthology.org/
N19-1238. doi:10.18653/v1/N19- 1238.
[16] M. Schmitt, L. F. R. Ribeiro, P. Dufter, I. Gurevych, H. Schütze, Modeling Graph Structure via
Relative Position for Text Generation from Knowledge Graphs, in: Proceedings of the
Fifteenth Workshop on Graph-Based Methods for Natural Language Processing
(TextGraphs15), Association for Computational Linguistics, Mexico City, Mexico, 2021, pp. 10–21. URL:
https://aclanthology.org/2021.textgraphs-1.2. doi:10.18653/v1/2021.textgraphs- 1.2.
[17] D. Marcheggiani, L. Perez-Beltrachini, Deep Graph Convolutional Encoders for Structured
Data to Text Generation, in: Proceedings of the 11th International Conference on Natural
Language Generation, Association for Computational Linguistics, Tilburg University, The</p>
      <p>Graph, 2018. doi:10.1109/ICALIP.2018.8455241, pages: 83.
[29] P. N. Bennett, F. Radlinski, R. W. White, E. Yilmaz, Inferring and using location metadata to
personalize web search, in: Proceedings of the 34th international ACM SIGIR conference on
Research and development in Information Retrieval, SIGIR ’11, Association for Computing
Machinery, New York, NY, USA, 2011, pp. 135–144. URL: https://doi.org/10.1145/2009916.
2009938. doi:10.1145/2009916.2009938.
[30] S. G. Sripada, E. Reiter, J. Hunter, J. Yu, Generating English summaries of time series
data using the Gricean maxims, in: Proceedings of the ninth ACM SIGKDD international
conference on Knowledge discovery and data mining, KDD ’03, Association for Computing
Machinery, New York, NY, USA, 2003, pp. 187–196. URL: https://doi.org/10.1145/956750.
956774. doi:10.1145/956750.956774.
[31] V. Setlur, M. Tory, How do you Converse with an Analytical Chatbot? Revisiting Gricean
Maxims for Designing Analytical Conversational Behavior, in: CHI Conference on Human
Factors in Computing Systems, ACM, New Orleans LA USA, 2022, pp. 1–17. URL: https:
//dl.acm.org/doi/10.1145/3491102.3501972. doi:10.1145/3491102.3501972.
[32] E. Lloret, L. Plaza, A. Aker, The challenging task of summary evaluation: an overview,
Language Resources and Evaluation 52 (2018) 101–148. URL: https://doi.org/10.1007/
s10579-017-9399-2. doi:10.1007/s10579-017-9399-2.
[33] P. Konieczny, M. Klein, Gender gap through time and space: A journey through
Wikipedia biographies via the Wikidata Human Gender Indicator, New Media &amp;
Society 20 (2018) 4608–4633. URL: https://doi.org/10.1177/1461444818779080. doi:10.1177/
1461444818779080, publisher: SAGE Publications.
[34] M. Hinnosaar, Gender inequality in new media: Evidence from Wikipedia, Journal of
Economic Behavior &amp; Organization 163 (2019) 262–276. URL: https://www.sciencedirect.
com/science/article/pii/S0167268119301234. doi:10.1016/j.jebo.2019.04.020.
[35] J. M. Ezell, Empathy plasticity: decolonizing and reorganizing Wikipedia and other
online spaces to address racial equity, Ethnic and Racial Studies 44 (2021) 1324–1336.
URL: https://www.tandfonline.com/doi/full/10.1080/01419870.2020.1851383. doi:10.1080/
01419870.2020.1851383.
[36] L. M. Bridges, R. Pun, R. A. Arteaga (Eds.), Wikipedia and Academic Libraries, Michigan
Publishing, 2021. URL: https://hdl.handle.net/2027/fulcrum.cv43p013f. doi:10.3998/mpub.
11778416.
[37] A. Radford, J. Wu, R. Child, D. Luan, D. Amodei, I. Sutskever, Language Models are</p>
      <p>Unsupervised Multitask Learners (2019) 24.
[38] S. Báez Santamaría, P. Vossen, T. Baier, Evaluating Agent Interactions Through Episodic
Knowledge Graphs, 2022. URL: http://arxiv.org/abs/2209.11746. doi:10.48550/arXiv.
2209.11746, arXiv:2209.11746 [cs].</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>E.</given-names>
            <surname>Kacupaj</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Banerjee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Singh</surname>
          </string-name>
          ,
          <string-name>
            <surname>J. Lehmann,</surname>
          </string-name>
          <article-title>ParaQA: A Question Answering Dataset with Paraphrase Responses for Single-Turn Conversation</article-title>
          , arXiv:
          <fpage>2103</fpage>
          .07771 [cs] (
          <year>2021</year>
          ). URL: http://arxiv.org/abs/2103.07771, arXiv:
          <fpage>2103</fpage>
          .
          <fpage>07771</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>E.</given-names>
            <surname>Kacupaj</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Zafar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Lehmann</surname>
          </string-name>
          , M. Maleshkova,
          <article-title>VQuAnDa: Verbalization QUestion ANswering DAtaset</article-title>
          , in: A.
          <string-name>
            <surname>Harth</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Kirrane</surname>
          </string-name>
          , A.
          <string-name>
            <surname>-C. Ngonga Ngomo</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          <string-name>
            <surname>Paulheim</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Rula</surname>
            ,
            <given-names>A. L.</given-names>
          </string-name>
          <string-name>
            <surname>Gentile</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Haase</surname>
          </string-name>
          , M. Cochez (Eds.),
          <source>The Semantic Web, Lecture Notes in Computer Science</source>
          , Springer International Publishing, Cham,
          <year>2020</year>
          , pp.
          <fpage>531</fpage>
          -
          <lpage>547</lpage>
          . doi:
          <volume>10</volume>
          .1007/978- 3-
          <fpage>030</fpage>
          - 49461- 2_
          <fpage>31</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>D.</given-names>
            <surname>Biswas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Dubey</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. R. A. H.</given-names>
            <surname>Rony</surname>
          </string-name>
          , J. Lehmann, VANiLLa : Verbalized Answers in Natural Language at Large Scale, arXiv:
          <fpage>2105</fpage>
          .11407 [cs] (
          <year>2021</year>
          ). URL: http://arxiv.org/abs/ 2105.11407, arXiv:
          <fpage>2105</fpage>
          .11407 version: 1.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>E.</given-names>
            <surname>Kacupaj</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Premnadh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Singh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Lehmann</surname>
          </string-name>
          ,
          <string-name>
            <surname>M.</surname>
          </string-name>
          <article-title>Maleshkova, VOGUE: Answer Verbalization through Multi-Task Learning</article-title>
          , arXiv:
          <fpage>2106</fpage>
          .13316 [cs] (
          <year>2021</year>
          ). URL: http: //arxiv.org/abs/2106.13316, arXiv:
          <fpage>2106</fpage>
          .13316 version: 2.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>H. P.</given-names>
            <surname>Grice</surname>
          </string-name>
          ,
          <article-title>Logic and conversation</article-title>
          , in: Speech acts, Brill,
          <year>1975</year>
          , pp.
          <fpage>41</fpage>
          -
          <lpage>58</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>P.</given-names>
            <surname>Rajpurkar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Lopyrev</surname>
          </string-name>
          , P. Liang, SQuAD:
          <volume>100</volume>
          ,000+
          <article-title>Questions for Machine Comprehension of Text</article-title>
          ,
          <source>in: Proceedings of the 2016 Conference on Empirical Methods in Natural Language Processing</source>
          , Association for Computational Linguistics, Austin, Texas,
          <year>2016</year>
          , pp.
          <fpage>2383</fpage>
          -
          <lpage>2392</lpage>
          . URL: https://aclanthology.org/D16-1264. doi:
          <volume>10</volume>
          .18653/v1/
          <fpage>D16</fpage>
          - 1264.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>P.</given-names>
            <surname>Rajpurkar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Jia</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Liang</surname>
          </string-name>
          ,
          <string-name>
            <surname>Know What You Don't Know</surname>
          </string-name>
          :
          <article-title>Unanswerable Questions for SQuAD, in: Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics</article-title>
          (Volume
          <volume>2</volume>
          :
          <string-name>
            <surname>Short</surname>
            <given-names>Papers)</given-names>
          </string-name>
          ,
          <source>Association for Computational LinguisNetherlands</source>
          ,
          <year>2018</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>9</lpage>
          . URL: https://aclanthology.org/W18-6501. doi:
          <volume>10</volume>
          .18653/v1/
          <fpage>W18</fpage>
          -6501.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>A.</given-names>
            <surname>Saha</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Pahuja</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Khapra</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Sankaranarayanan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Chandar</surname>
          </string-name>
          , Complex Sequential Question Answering:
          <article-title>Towards Learning to Converse Over Linked Question Answer Pairs with a Knowledge Graph</article-title>
          ,
          <source>Proceedings of the AAAI Conference on Artificial Intelligence</source>
          <volume>32</volume>
          (
          <year>2018</year>
          ). URL: https://ojs.aaai.org/index.php/AAAI/article/view/11332. doi:
          <volume>10</volume>
          .1609/aaai. v32i1.11332,
          <issue>number</issue>
          :
          <fpage>1</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>D.</given-names>
            <surname>Diefenbach</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T. P.</given-names>
            <surname>Tanon</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Singh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Maret</surname>
          </string-name>
          , Question Answering Benchmarks for Wikidata,
          <source>in: ISWC</source>
          <year>2017</year>
          , Vienne, Austria,
          <year>2017</year>
          . URL: https://hal.archives-ouvertes.fr/ hal-01637141.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>S.</given-names>
            <surname>Chaudhuri</surname>
          </string-name>
          ,
          <string-name>
            <surname>G. Das</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          <string-name>
            <surname>Hristidis</surname>
          </string-name>
          , G. Weikum,
          <article-title>Probabilistic information retrieval approach for ranking of database query results</article-title>
          ,
          <source>ACM Transactions on Database Systems</source>
          <volume>31</volume>
          (
          <year>2006</year>
          )
          <fpage>1134</fpage>
          -
          <lpage>1168</lpage>
          . URL: https://dl.acm.org/doi/10.1145/1166074.1166085. doi:
          <volume>10</volume>
          .1145/1166074. 1166085.
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>J.</given-names>
            <surname>Guo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Fan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Pang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Ai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Zamani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W. B.</given-names>
            <surname>Croft</surname>
          </string-name>
          , X. Cheng,
          <article-title>A Deep Look into neural ranking models for information retrieval</article-title>
          ,
          <source>Information Processing &amp; Management</source>
          <volume>57</volume>
          (
          <year>2020</year>
          )
          <article-title>102067</article-title>
          . URL: https://www.sciencedirect.com/science/article/pii/ S0306457319302390. doi:
          <volume>10</volume>
          .1016/j.ipm.
          <year>2019</year>
          .
          <volume>102067</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Shen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Deng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Du</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Fan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Lei</surname>
          </string-name>
          ,
          <article-title>Knowledge-aware Attentive Neural Network for Ranking Question Answer Pairs</article-title>
          ,
          <source>in: The 41st International ACM SIGIR Conference on Research &amp; Development in Information Retrieval</source>
          , SIGIR '18,
          <string-name>
            <surname>Association</surname>
          </string-name>
          for Computing Machinery, New York, NY, USA,
          <year>2018</year>
          , pp.
          <fpage>901</fpage>
          -
          <lpage>904</lpage>
          . URL: https://doi.org/10. 1145/3209978.3210081. doi:
          <volume>10</volume>
          .1145/3209978.3210081.
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>A.</given-names>
            <surname>Thalhammer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Lasierra</surname>
          </string-name>
          ,
          <string-name>
            <surname>A</surname>
          </string-name>
          . Rettinger,
          <article-title>LinkSUM: Using Link Analysis to Summarize Entity Data</article-title>
          , in: A.
          <string-name>
            <surname>Bozzon</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Cudre-Maroux</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          Pautasso (Eds.),
          <source>Web Engineering, Lecture Notes in Computer Science</source>
          , Springer International Publishing, Cham,
          <year>2016</year>
          , pp.
          <fpage>244</fpage>
          -
          <lpage>261</lpage>
          . doi:
          <volume>10</volume>
          .1007/978-3-
          <fpage>319</fpage>
          -38791-8_
          <fpage>14</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>M.</given-names>
            <surname>Sydow</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Pikuła</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Schenkel</surname>
          </string-name>
          ,
          <article-title>The notion of diversity in graphical entity summarisation on semantic knowledge graphs</article-title>
          ,
          <source>Journal of Intelligent Information Systems</source>
          <volume>41</volume>
          (
          <year>2013</year>
          )
          <fpage>109</fpage>
          -
          <lpage>149</lpage>
          . URL: https://doi.org/10.1007/s10844-013-0239-6. doi:
          <volume>10</volume>
          .1007/ s10844-013-0239-6.
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [25]
          <string-name>
            <given-names>T.</given-names>
            <surname>Safavi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Belth</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Faber</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Mottin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Muller</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Koutra</surname>
          </string-name>
          ,
          <article-title>Personalized Knowledge Graph Summarization: From the Cloud to Your Pocket</article-title>
          , in: 2019
          <source>IEEE International Conference on Data Mining (ICDM)</source>
          , IEEE, Beijing, China,
          <year>2019</year>
          , pp.
          <fpage>528</fpage>
          -
          <lpage>537</lpage>
          . URL: https: //ieeexplore.ieee.org/document/8970788/. doi:
          <volume>10</volume>
          .1109/ICDM.
          <year>2019</year>
          .
          <volume>00063</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [26]
          <string-name>
            <given-names>L.</given-names>
            <surname>Faber</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Koutra</surname>
          </string-name>
          ,
          <article-title>Adaptive personalized knowledge graph summarization</article-title>
          ,
          <source>in: Proceedings of the 14th international workshop on mining and learning with graphs (MLG)</source>
          ,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [27]
          <string-name>
            <given-names>E.</given-names>
            <surname>Choi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Iyyer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Yatskar</surname>
          </string-name>
          , W.-t. Yih,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Choi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Liang</surname>
          </string-name>
          , L. Zettlemoyer, QuAC: Question Answering in Context,
          <source>in: Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing</source>
          , Association for Computational Linguistics, Brussels, Belgium,
          <year>2018</year>
          , pp.
          <fpage>2174</fpage>
          -
          <lpage>2184</lpage>
          . URL: https://aclanthology.org/D18-1241. doi:
          <volume>10</volume>
          . 18653/v1/
          <fpage>D18</fpage>
          -1241.
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [28]
          <string-name>
            <given-names>P.</given-names>
            <surname>Wu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Lei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Qiu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Li</surname>
          </string-name>
          , Template Oriented Text Summarization via Knowledge
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>