<!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>Case-Based Slogan Production</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Martin Znidarsic</string-name>
          <email>martin.znidarsic@ijs.si</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Polona Tomasic</string-name>
          <email>polona.tomasic@gmail.com</email>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Gregor Papa</string-name>
          <email>gregor.papa@ijs.si</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>Jozef Stefan Institute</institution>
          ,
          <addr-line>Jamova cesta 39, SI-1000 Ljubljana</addr-line>
          ,
          <country country="SI">Slovenia</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Jozef Stefan International Postgraduate School</institution>
          ,
          <addr-line>Jamova cesta 39, SI-1000 Ljubljana</addr-line>
          ,
          <country country="SI">Slovenia</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>OLAII d.o.o.</institution>
          ,
          <addr-line>Pot za Brdom 100, SI-1000 Ljubljana</addr-line>
          ,
          <country country="SI">Slovenia</country>
        </aff>
      </contrib-group>
      <fpage>123</fpage>
      <lpage>130</lpage>
      <abstract>
        <p>This paper presents a case-based approach to automated generation of slogans. We use a collection of cases out of which the selected ones get transformed and adapted to a new context that is represented by a textual description of the slogan's target. We also propose a methodology for evaluation and ranking of the nal results. The approach is experimentally applied to two real-world use cases. The results indicate the ability of the approach to create slogan prototypes and reveal the issues to tackle in the next steps of solving this challenging problem.</p>
      </abstract>
      <kwd-group>
        <kwd>slogan generation</kwd>
        <kwd>CBR</kwd>
        <kwd>transformational adaptation</kwd>
        <kwd>computational creativity</kwd>
        <kwd>natural language</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>Invention of slogans is a task that demands knowledge about the object of the
slogan, its context and the intended message. However, such knowledge is not
enough, as it has to be used in a creative way to produce a slogan that is novel,
interesting and memorable. As a task that demands common knowledge and
a high level of creativity, slogan generation is inherently di cult to automate.
The aim of the work presented in this paper is to contribute to solutions of this
challenging problem.</p>
      <p>Our approach uses the texts of slogan cases to create new slogans that follow
the grammatical structure of the initial cases, but use di erent words and phrases
that are related to the slogans' target objects and contexts. As we use a collection
of cases that we build upon and transform, this approach can be considered
an application of case-based reasoning (CBR) in the domain of computational
creativity.</p>
      <p>It is very hard to automatically generate novel slogans that would be ready
for use without further adaptations and corrections. This is not the case for
simple template-based techniques4, but these are not useful for our purposes
4 Such as: "X, you have to buy it!" (put the name of the product in place of X).
Copyright © 2015 for this paper by its authors. Copying permitted for private and
academic purposes. In Proceedings of the ICCBR 2015 Workshops. Frankfurt, Germany.
as despite producing ready-made solutions, they are not innovative and do not
produce context dependent results.</p>
      <p>The outputs of the more innovative approaches often contain grammatical
errors and semantic incoherencies. These outcomes can be considered slogan
prototypes rather than slogans. They are useful in the conceptualization phase,
as an addition to other techniques for production of solution drafts.</p>
      <p>The case-based slogan generation is an example of a hybrid approach: it
uses case texts, but not as rigid templates and it aims at incorporating some of
the context of the slogan's target object. We have experimentally applied this
methodology to two use cases. The relevant results and their assessments are
provided in the paper, along with a discussion of the strong and weak points of
our approach.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Related Work</title>
      <p>
        Automatic generation of innovative creative artefacts that have a de ned
semantics is very challenging and the outcomes of such systems and methods are
usually not ready for use without some sort of human curation. The computational
creativity problems that are similar to slogan generation in terms of di culty
and representation are generation of jokes [
        <xref ref-type="bibr" rid="ref1 ref10">1, 10</xref>
        ], poems [
        <xref ref-type="bibr" rid="ref3 ref4">4, 3</xref>
        ] and generation of
stories [
        <xref ref-type="bibr" rid="ref2 ref6">2, 6</xref>
        ], to some extent also the automatic generation of acronyms [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ].
      </p>
      <p>
        In the case of automated generation of slogans, there are only two lines
of research work to the best of our knowledge: (I) the BrainSup approach by
O zbal et. al. [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ], which is the most well known and (II) the work by Tomasic et.
al. [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ], which is heavily in uenced by the BrainSup approach, but complements
it with the use of a genetic algorithm and additional evaluation functions. While
the former expects relevant meta-data to be provided by the user, such as the
keywords, the domain, etc., the latter is made to be completely autonomous.
Consequently the reported results of BrainSup are of much higher quality.
      </p>
      <p>
        In terms of CBR, the studies related to the work in this paper are the ones
that are concerned with the use of textual data in CBR [
        <xref ref-type="bibr" rid="ref13 ref8">13, 8</xref>
        ]. Among these, we
can also nd some that are related by domain, such as the study on the use of
CBR for story generation [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ].
3
      </p>
    </sec>
    <sec id="sec-3">
      <title>Slogan Collection</title>
      <p>In our experiments we used a manually generated dataset of 5183 distinct items,
each containing words transformed to lowercase, that appear in an example of a
slogan.</p>
      <p>Besides the words with their grammatical characteristics, we do not store
other information, for example the particular product or product type that the
slogan might be used for. Most of the slogans are used for promotion of the
values and characteristics of a company and all its products, which might be
numerous and diverse. As the characteristics of the products are re ected in the
characteristics of the company and vice versa, it is usually di cult to determine
whether a slogan is meant to be general or product-speci c.</p>
      <p>Cases in the collection are targeting diverse products and companies, from
housing and nancial services to food and cosmetics products. They di er a lot
also in other characteristics, like length for example. The shortest one in the
collection is only a 4 characters long word, while the longest one consists of 215
characters and 34 words. The median number of characters in the cases of this
collection is 28, while the median number of words is 5.
4</p>
    </sec>
    <sec id="sec-4">
      <title>Generation Process</title>
      <p>
        The slogan generation process mostly follows the usual CBR steps [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] and is
also presented in this fashion, by rst describing the retrieval of similar cases,
then the adaptation and transformation to suit a particular target and nally
the evaluation and ranking of results.
4.1
      </p>
      <sec id="sec-4-1">
        <title>Retrieval of Relevant Cases</title>
        <p>Retrieval of cases that are relevant for a given problem is not trivial in our
setting. Namely, the only input into our system is a textual description of the
target (a company or a product), while our knowledge base consists of exemplary
texts. In the absence of meta-data, which would, ideally, describe the context
of the slogan and its target, we use only the textual information of the slogan
examples and the target's textual description.</p>
        <p>The retrieval process consists of two steps: (I) preprocessing of textual
representations and (II) selection, based on similarity of words. First, the text of each
slogan and the textual description of the slogan's target is transformed into a
bag of words representation from which all the stopwords are removed (we have
used the nltk library5 for this purpose ) and all the characters are transformed
to lower case. Then, the items in the case-base are selected for adaptation, based
on the matching of their words with the words in the target's description. If an
item contains a word that appears also in the description of the target, it gets
added to the collection of relevant cases. If it matches the target text in n words,
it gets added n-times. We can describe this with the following equation:
n = jWs \ Wtj;
(1)
where the number of copies of an item in the collection of relevant cases (n)
is expressed as the cardinality of the intersection among the words from the
slogan (Ws) and the words from the target's description (Wt). If the intersection
is empty, the particular item does not get added to the collection of relevant
cases.</p>
        <p>This way, the slogans with more words that appear also in the target's text
have more instances in the collection of selected cases and consequently more of
their (diverse) transformations represented in the nal results.</p>
        <sec id="sec-4-1-1">
          <title>5 http://www.nltk.org/</title>
          <p>4.2</p>
        </sec>
      </sec>
      <sec id="sec-4-2">
        <title>Transformation</title>
        <p>The selected items are transformed by insertion of words from the target's
description. For each selected case-base item we exchange each of its words with
probability p. Such a word gets exchanged with a randomly selected word from
the target's description that has a matching part of speech (POS) tag while the
punctuation marks are left unchanged. This way, repeated items that appear in
the selection get transformed di erently, as the exchanged words are in general
di erent and their replacements are usually also di erent.</p>
        <p>The exchange probability parameter p controls the level of diversity of the
transformed items from the initial ones. Low values of p cause the resulting
slogans to be more similar to their initial cases, thus they are less innovative and
can be seen as imitations. High values of p on the other hand, cause the
resulting slogans to be more novel, better connected to the target domain, but also
more uncontrolled, with a higher frequency of grammatical errors and semantic
incoherencies. As we prefer the results of the latter kind, we used p = 0:75 in
our experiments.
4.3</p>
      </sec>
      <sec id="sec-4-3">
        <title>Evaluation and Re nement</title>
        <p>Due to the generation procedure, the transformed items often (depending on the
parameter p) contain grammatical and semantic errors. To assess the results in
this respect and to alleviate this problem, the outputs get evaluated and the nal
results of our approach are presented in a descending order of their evaluation
scores.</p>
        <p>For the purpose of evaluation, we represent each transformed item as a
multiset6 or a bag Bts of bi-grams. For example:
you just have to buy this to be happy.
would be represented as:
{(you, just), (just, have), (have,
(this, to), (to, be), (be, happy)}.
to), (to,
buy), (buy, this),
Likewise, we create a multiset B of all the bi-grams that appear in all the
examples in our case base and the input target text.</p>
        <p>Each transformed item is then scored according to the number of its bi-grams
from Bts that appear also in B. This way, the results that have more bi-grams
that appear in related texts (all the exemplary texts and the target's text) are
scored higher. We expect that such results are constructed in a more meaningful
way, at least locally in a word-to-word sense. However, by considering only the
number of the matching bi-grams, the evaluation would be biased towards longer,
and not necessarily more meaningful slogans. Therefore, our evaluation score S
6 Namely, we want to allow a bi-gram to appear multiple times in our collection.
is a ratio of the number of the matching bi-grams and the number of all the
bi-grams of the evaluated slogan:</p>
        <p>S = jBts \ Bj :
jBtsj
(2)</p>
        <p>The nal output of our approach are therefore the transformed selected
slogans, ordered according to S.
5</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Experiments</title>
      <p>The approach presented in Section 4 was applied to two exemplary use cases:
companies Sentinel7 and Olaii8. Sentinel provides solutions for monitoring of a
state of a boat or a eet of boats, while Olaii is providing a system for payments
and access management for events.</p>
      <p>The input textual descriptions in both use cases were very raw, as we used all
the text from their respective home pages, together with the boilerplate text such
as the menu items, disclaimers, etc. The inputs were intentionally not cleaned
in order to get an assessment of results from a very straightforward and realistic
kind of use.</p>
      <p>The rst 10 and the last 10 results for Sentinel and Olaii are shown in Tables 1
and 2, respectively. According to our qualitative assessment, the outputs with
the top ranks are clearly of higher quality than the bottom ranked ones, while
the quality of the outputs is generally too low for practical use.</p>
      <p>We have also experimented with the use of lower and higher values of the
parameter p. As its impact is not very profound and can be observed only when
one inspects a large number of outputs, we do not present these results here.
Among the badly ranked outputs, as expected, the ones obtained with lower
values of p (for example 0.50) are usually more readable and grammatically
correct and the ones obtained with high values of p (like 0.90) are worse in this
respect. Among the highly ranked outputs, lower values of p cause more results
similar to initial ones to appear among the outputs, while the quality is not
a ected much even with the use of high values of p. This is most probably due to
the evaluation and ranking procedure, which penalizes grammatically incorrect
and incoherent slogans. The more abundant erroneous outputs that are expected
to be produced with high values of p are thus prevented from appearing among
the well ranked results. Therefore, it seems that it is sensible to use large values
of p as this ensures production of less outputs that are similar to the already
existing ones, while the evaluation and ranking prevents the comparatively larger
amount of erroneous solutions to be present among the top results - the ones
that are of interest in practice.</p>
      <sec id="sec-5-1">
        <title>7 http://www.sentinel.hr/ 8 http://cashless.olaii.com/</title>
        <p>1 immediately what you need to be your best.
2 you enjoy our promises to you.
3 go * and warn the driving to you!
4 the one and only possible.
5 free enterprise with every issue.
6 simple boat to like you
7 an your security needs under one vacation.
8 you enjoy clearly when you enjoy it.
9 at the men in charge about eye.
10 battery you need from conception to reception.
338 a wholesome anchor with yet or detection.
339 a system alerts only , it clearly receives.
340 a alert is voltage holidays at us!
341 a most possible anchor need before all boat.
342 only it 're going , it enjoy activating immediately.
343 your leave , information provides reliable , be at times..
344 sensors batteries you provides losing , and going , or sentinel.
345 sensors batteries you noti es going , and going , or sentinel.
346 entering healthy batteries about one eye , over all worries.
347 gps enjoy about , and they do away be out!</p>
        <p>S
The case-based generation of slogans is an approach that uses information from
examples of solutions and aims at transforming them with regard to a target
entity context into new slogans. Our method allows setting a parameter that
controls the expected level of distortion of the original solution and adaptation
to the target entity.</p>
        <p>Our experiments indicate that the CBR-based approach can create artefacts,
which can be used as prototype solutions for further (manual or automatic)
re nement. Outputs of some experimental runs even produced good original
slogans that could be used without further modi cation, such as:
the most reliable anchor of your solution.
which appeared among top ranked outputs with p = 0:90 for the Sentinel case.
However, the experiments also show that the approach often results in
erroneous and even meaningless solutions and that in general the amount of such
noise (at the values of the distortion parameter that allow innovative slogans) is
substantial and further improvements are needed in order for the method to be
applicable in practice.</p>
        <p>A positive indication of the experimental results is the performance of the
evaluation method, which seems to be useful, according to qualitative analysis
of the result ranking. This is an encouraging result, as evaluation represents a
big challenge in the problem domains of computational creativity. However, to
strengthen this indication, which is currently supported only by the qualitative
observations by the authors, a more elaborate evaluation procedure should be
conducted with unbiased evaluators and hidden ranks. Such an evaluation is
one of our highest priorities in further work, as the method could be valuable
also in a wider context, if con rmed useful. Namely, the bi-gram ratio scoring
could be applied also to other automatic slogan generation methods, and with
appropriate adaptations, perhaps even in a wider array of similar problems.
Acknowledgments. This work was partly funded by the Slovene Research
Agency and supported through EC funding for the project ConCreTe (grant
number 611733) and project WHIM (grant number 611560) that acknowledge the
nancial support of the Future and Emerging Technologies (FET) programme
within the Seventh Framework Programme for Research of the European
Commission. The authors would also like to thank the anonymous reviewers for their
valuable comments and suggestions.</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Binsted</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bergen</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>O'Mara</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Coulson</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nijholt</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stock</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Strapparava</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ritchie</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Manurung</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pain</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          , et al.:
          <article-title>Computational humor</article-title>
          .
          <source>IEEE Intelligent Systems (2)</source>
          ,
          <volume>59</volume>
          {
          <fpage>69</fpage>
          (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Callaway</surname>
            ,
            <given-names>C.B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lester</surname>
            ,
            <given-names>J.C.</given-names>
          </string-name>
          :
          <article-title>Narrative prose generation</article-title>
          .
          <source>Arti cial Intelligence</source>
          <volume>139</volume>
          (
          <issue>2</issue>
          ),
          <volume>213</volume>
          {
          <fpage>252</fpage>
          (
          <year>2002</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Colton</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Goodwin</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Veale</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Full FACE poetry generation</article-title>
          .
          <source>In: Proceedings of the Third International Conference on Computational Creativity</source>
          . pp.
          <volume>95</volume>
          {
          <issue>102</issue>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Gervas</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Computational modelling of poetry generation</article-title>
          .
          <source>In: Arti cial Intelligence and Poetry Symposium</source>
          , AISB Convention (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Gervas</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <article-title>D az-</article-title>
          <string-name>
            <surname>Agudo</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Peinado</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hervas</surname>
          </string-name>
          , R.:
          <source>Story plot generation based on CBR. Knowledge-Based Systems 18(4)</source>
          ,
          <volume>235</volume>
          {
          <fpage>242</fpage>
          (
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Gervas</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <article-title>Lonneker-</article-title>
          <string-name>
            <surname>Rodman</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Meister</surname>
            ,
            <given-names>J.C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Peinado</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          :
          <article-title>Narrative models: Narratology meets arti cial intelligence</article-title>
          .
          <source>In: International Conference on Language Resources and Evaluation. Satellite Workshop: Toward Computational Models of Literary Analysis</source>
          . pp.
          <volume>44</volume>
          {
          <issue>51</issue>
          (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Leake</surname>
            ,
            <given-names>D.B.</given-names>
          </string-name>
          :
          <article-title>Case-Based Reasoning: Experiences, lessons and future directions</article-title>
          . MIT press (
          <year>1996</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Lenz</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>De ning knowledge layers for textual case-based reasoning</article-title>
          .
          <source>In: Advances in Case-Based Reasoning</source>
          , pp.
          <volume>298</volume>
          {
          <fpage>309</fpage>
          . Springer (
          <year>1998</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <given-names>O</given-names>
            <surname>zbal</surname>
          </string-name>
          , G.,
          <string-name>
            <surname>Pighin</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Strapparava</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          : BRAINSUP:
          <article-title>Brainstorming Support for Creative Sentence Generation</article-title>
          .
          <source>In: Proceedings of the 51st Annual Meeting of the Association for Computational Linguistics</source>
          . pp.
          <volume>1446</volume>
          {
          <fpage>1455</fpage>
          .
          <string-name>
            <surname>So</surname>
            <given-names>a</given-names>
          </string-name>
          ,
          <source>Bulgaria</source>
          (
          <year>2013</year>
          ), http://www.newdesign.aclweb.org/anthology-new/P/P13/P13-1142.pdf
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Ritchie</surname>
          </string-name>
          , G.:
          <article-title>Current directions in computational humour</article-title>
          .
          <source>Arti cial Intelligence Review</source>
          <volume>16</volume>
          (
          <issue>2</issue>
          ),
          <volume>119</volume>
          {
          <fpage>135</fpage>
          (
          <year>2001</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Stock</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Strapparava</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>The act of creating humorous acronyms</article-title>
          .
          <source>Applied Arti cial Intelligence</source>
          <volume>19</volume>
          (
          <issue>2</issue>
          ),
          <volume>137</volume>
          {
          <fpage>151</fpage>
          (
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Tomasic</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Znidarsic</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Papa</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          :
          <article-title>Implementation of a slogan generator</article-title>
          .
          <source>In: The Fifth International Conference on Computational Creativity</source>
          ,
          <string-name>
            <surname>ICCC</surname>
          </string-name>
          <year>2014</year>
          . pp.
          <volume>340</volume>
          {
          <fpage>343</fpage>
          . Ljubljana, Slovenia (
          <year>2014</year>
          ), http://kt.ijs.si/publ/iccc_2014_
          <article-title>proceedings</article-title>
          .pdf
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Weber</surname>
            ,
            <given-names>R.O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ashley</surname>
            ,
            <given-names>K.D.</given-names>
          </string-name>
          , Bruninghaus, S.:
          <article-title>Textual case-based reasoning</article-title>
          .
          <source>Knowledge Engineering Review</source>
          <volume>20</volume>
          (
          <issue>3</issue>
          ),
          <volume>255</volume>
          {
          <fpage>260</fpage>
          (
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>