<!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>Towards Computationally Creating Multi-answer Queries for the Remote Associates Test</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Ana-Maria Olteteanu</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Kunkanit Yoopoo</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Cognitive Systems, Bremen Spatial Cognition Center, Universitat Bremen</institution>
          ,
          <country country="DE">Germany</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Faculty of Information and Communication Technology, Mahidol University</institution>
          ,
          <country country="TH">Thailand</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>The Remote Associates Test is a creativity test used to assess human participants'ability for association. Small normative datasets of queries exist for this test; however, such datasets do not deal with the issue of potential multiple answers to the same test query. In this work we create a large dataset of queries to which multiple answers are possible. The computational work to create such a dataset is presented, together with the metrics relating to this dataset. The applications of this tool for the investigation and modeling of the creative processes of association in human cognition are also discussed.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>
        Imagine that, as a cognitive psychologist, you would want to investigate an aspect
of the creativity and creative problem solving process in humans. Or that you
would attempt to computationally model such a process. Various forms of tests
exist to measure creativity and creative problem solving performance in human
participants [
        <xref ref-type="bibr" rid="ref3 ref4 ref5 ref6">4, 6, 3, 5</xref>
        ]. However, some of these tests are old and do not provide
normative data. Furthermore, such tests do not provide an ability to control for
and parametrize their variables. Much more insight in the creative process could
be obtained if cognitive psychologists and computational modelers would have
access to large datasets of test items, the variables of which they could control.
Furthermore, despite of measuring creativity, some such tests only allow for one
\correct" answer, ignoring the fact that multiple answers might be possible, and
thus being unable to explore how the cognitive process functions in the context
of multiple solutions.
      </p>
      <p>
        This paper starts from the premise that the investigation and testing of
creative performance can bene t from the help of computational methods in
establishing (i) new ways of assessing creative problem solving; (ii) better controlled
parametrized stimuli sets for existing creativity and creative problem solving
tasks and (iii) allowing and accounting for multiple possible solutions. The
current work focuses on the last two: using computational methods to establish a
set of controlled parametrized stimuli sets for a classical creativity test { the
Remote Associates Test [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. Speci cally, we focus on computationally building and
extracting a set of Remote Associates Test queries for which multiple answers
are possible.
      </p>
      <p>The rest of the paper is organized as follows: the Remote Associates Test is
brie y described in section 2, together with previous work on a computational
solver for this test. An approach in creating stimuli subsets for multi-answer
queries is described in section 3. The obtained dataset and the multi-answer
query metrics are described in section 4. In closing, the applications of this work
in cognitive psychology are discussed and future work is proposed.
2</p>
    </sec>
    <sec id="sec-2">
      <title>The Remote Associates Test, comRAT-C and comRAT-G</title>
      <p>
        The Remote Associates Test [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] (RAT) is a creativity test often used in the
literature [
        <xref ref-type="bibr" rid="ref1 ref2">2, 1</xref>
        ]. In this test, three word queries are given to participants, like the
query Cottage, Swiss, Cake. The participants are asked to come up with a
fourth word, which is connected to each of the query words. A potential answer in
this case would be Cheese. According to its creators, the RAT aims to measure
creativity as the ability to make associations.
      </p>
      <p>
        In previous work, [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] implemented a computational solver of the RAT called
comRAT-C. This solver used language data (bigrams) from the Corpus of
Contemporary American English, and a type of knowledge organization which
supports the solving process [
        <xref ref-type="bibr" rid="ref11 ref8">8, 11</xref>
        ]. The solving of a RAT query can be visually
represented as depicted in Figure 1. The initially given query words trigger word
associates that have been previously encountered in conjunction with the query
words. The query words shown in green in Figure 1 trigger the associates shown
in blue. For example, the word Cake triggers the words Flour and Layer,
because the cognitive agent has previously encountered expressions like Cake
Flour and Layer Cake.
      </p>
      <p>Amongst the associates that are activated by each of the query words, some
overlaps might happen. For example Chocolate is such an overlap, triggered by
associates of the query words Swiss and Cake. The activation process started
by presenting the query words will converge on such overlaps. A convergence of
the associates of all three initial query words can result in an answer { like for
example Cheese in Fig. 1.</p>
      <p>
        Besides solving the RAT computationally and correlating with human
performance data, comRAT-C [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] has shown that multiple possible answers may
exist for RAT queries, by sometimes providing di erent answers than the unique
answer considered \correct" in the normative data. For example, for the query
Change, Circuit, Cake, the answer considered correct in the normative data
was Short, while comRAT-C provided the equally plausible answer Design.
For the query High, District and House, the answer considered correct in
normative data was School, but comRAT-C provided other answers as well,
like State, Court, etc.
      </p>
      <p>However, no dataset of queries with multiple answers was yet available. A
researcher administering the RAT thus has no access to knowing whether her
queries might potentially have di erent correct answers than the ones she is
expecting. She might thus judge an answer as \wrong" just because this is not the
answer expected as correct by the normative data. Meanwhile, this answer might
be not wrong, but plausible, and di erent from the recognized correct answer.
In comRAT-C computational terms, the participant might have just found a
di erent convergence term, because of their knowledge base being structured or
weighted slightly di erently than that of other participants. As no account of
multiple answers exists in the literature, however, this participant might end
up with lower creativity scores because her answers do not match the \correct"
answers, and this would a ect the results of the empirical investigation.</p>
      <p>Such plausible but di erent answers could also be used to investigate the
process of solving this task at a deeper level. For example, why would one
answer be preferred by a participant over another potential answer? Is this a
function of that particular participant's set of associations strengths in their
memory/knowledge base? Or would certain associations be generally preferred
over others? How would the parameters of such associations need to be
modi ed in order to change the preferred answer? Manipulating various setups of
queries with multiple answers could shed more light into the process of remote
association. However, no hypothesis testing for queries with multiple answers is
possible until a dataset for such queries is created.
3</p>
    </sec>
    <sec id="sec-3">
      <title>Creating a Set of Multi-answer Queries</title>
      <p>
        A set of 17 million RAT queries was created by reverse engineering the
comRATC solving process with comRAT-G [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]. In short, this system considers each
word as a potential answer, and uses its knowledge and knowledge organization
to combinatorially generate queries which converge in that word as an answer.
      </p>
      <p>Though very rich, this dataset is too large to explore manually, and requires
the application of computational methods for extracting valuable subsets and
their metrics. In this work, we focus on the RAT queries which allow for multiple
answers, and apply computational methods for nding all the multi-answer query
sets, cleaning up this data computationally and building a multi-answer query
dataset. We extract metrics regarding this dataset, as to prepare it for evaluation
with human participants and distribution to the research community.</p>
      <p>First, all multiple answer subsets are extracted. This step involved searching
for query subsets of the form
(w1; w2; w3; ans1);
(w1; w2; w3; ans2);</p>
      <p>: : :
(w1; w2; w3; ansx);
where wk; k 2 f1; 2; 3g, stand for the various query words, and ansx for the
various potential answers. As shown in table 1, the application of this step has
as result ordered subsets of queries which have multiple answers. For example,
query Access, Back, Side is shown with both its answers Panel and Road.</p>
      <p>To o er the possibility of parametrising queries, the dataset we build also
provides the following information for each query:
{ the frequency of each of the query words { f r(w1); f r(w2); f r(w3);
{ the frequency of the answer word, which might help di erentiate between
di erent answers to the same query { f r(wans);
{ the frequency of the query words and answer words together as an expression
f r(w1; wans); f r(w2; wans); f r(w3; wans);
{ the conditional probability for achieving each of the answers, given the query
words (P [wansjw1]), (P [wansjw2]) and (P [wansjw3]);
{ the probability of nding a particular answer if all query words are equally
weighted.</p>
      <p>All parameters are calculated based on the frequencies provided with the
Corpus of Contemporary American English bigram dataset.</p>
      <p>In the second step, we build a dataset in which each query with multiple
answers is uniquely represented, together with the number of answers we found
for that query, and the following metrics:
(i) lowest, highest and mean conditional probability of the di erent answers to
the query, if each of the query words equally in uenced the answer;
(ii) lowest, highest and mean conditional probability given each of the query
words, across the di erent answers and
(iii) lowest, highest and mean frequency of the query words.</p>
      <p>The dataset and metrics thus constructed look as depicted in Table 2. These
metrics are provided in order to help cognitive psychologists or other users decide
which query subsets to use, and thus tailor the subset to their research question
or problem.</p>
    </sec>
    <sec id="sec-4">
      <title>Results - metrics of the dataset</title>
      <p>A dataset of 1206622 queries with multiple answers was obtained in step one.
Out of these, 403341 queries were unique, as observed after agglomerating the
data in step 2. The mean number of answers for the entire dataset was 2:27
(SD = 0:77).</p>
      <p>Most of the queries obtained were two answer queries (332974), while a few
sets of queries had between 17-30 answers (6 queries). The metrics pertaining to
the number of queries are shown split in nine bands based on their number of
answers in Table 3.
5</p>
    </sec>
    <sec id="sec-5">
      <title>Discussion and Future work</title>
      <p>This paper brie y presented our initial e orts in computationally constructing
a set of queries with multiple answers for the Remote Associates Test.</p>
      <p>One of the challenges of creating this dataset related to the presence of
plurals in multiple query answers. Our task was to search for subsets of the form
(w1; w2; w3; ans1); (w1; w2; w3; ans2); [: : :]; (w1; w2; w3; ansx). However, subsets of
queries with two answers were encountered where the two queries and answers
were of the form (w1; w2; w3; ans1); (w1; w2; w3; pl(ans1)), where pl(ans1) is the
plural of the other answer. For example, we encountered the query Draft,
Membership, Punch with both answers Card and Cards. We used a set of
plural rules for English to nd such queries. We then compressed plural and
singular forms of queries in one data item, maintaining the singular form and
calculating the mean of the probability and frequency metrics.</p>
      <p>As we have now created a dataset of multiple answer queries, the next steps
are as follows:
{ to evalute the dataset with human participants;
{ to create a set of normative data { expressing accuracy, answer times and
preferred answers for a subset of multi-answer queries;
{ to use the dataset (and support the use of the dataset) in various cognitive
science applications.</p>
      <p>The dataset can be evaluated with human participants by checking (i) whether
participants consider multiple answers to be indeed viable answers and (ii)
whether empirical relations hold between the propensity of people to choose
a particular answer and the probability, frequency or other factors associated
with the various answers. As part of future work we also intend to show
participants multiple possible answers and have them choose the one they nd to be
the most \appropriate", in conditions in which the answer choices are similar or
di erent in probability/frequency or other factors. This will help us investigate
whether such factors have an impact in perceived appropriatenes of answers, and
whether similarity or di erence in a particular factor in uences the di culty of
the choice, a ecting response times.</p>
      <p>The creation of a normative dataset for multi-answer queries requires
gathering data from human participants regarding response times, and the number
of times the various answers are given. Whether human answers in the case of
such queries cover all the potential multiple answers, or a very small subset of
them, and for which queries and answers this manifests is also an interesting
future empirical question.</p>
      <p>Various applications of the use of such a dataset exist for cognitive
psychologists. This tool and dataset can be used to design experiments that can capture
which answers are preferred in various multi-answer conditions { for example
in cases in which the frequency, probability, beginning letter, or other
parameters are varied. This dataset can thus be used as a means to establish and
falsify various theoretical hypotheses about the creative process and the process
of association.</p>
      <p>After evaluating this dataset with human participants, we intend to provide
it for scienti c use via an online interface.</p>
    </sec>
    <sec id="sec-6">
      <title>Acknowledgements</title>
      <p>Ana-Maria Olteteanu acknowledges the support of the German Research
Foundation (DFG) for the Creative Cognitive Systems Project OL 518/1-1 (CreaCogs).</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Bourke</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shaw</surname>
          </string-name>
          , H.:
          <article-title>Spontaneous lucid dreaming frequency and waking insight</article-title>
          .
          <source>Dreaming</source>
          <volume>24</volume>
          (
          <issue>2</issue>
          ),
          <volume>152</volume>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Cunningham</surname>
            ,
            <given-names>J.B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>MacGregor</surname>
            ,
            <given-names>J.N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gibb</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Haar</surname>
          </string-name>
          , J.:
          <article-title>Categories of insight and their correlates: An exploration of relationships among classic-type insight problems, rebus puzzles, remote associates and esoteric analogies</article-title>
          .
          <source>The Journal of Creative Behavior</source>
          <volume>43</volume>
          (
          <issue>4</issue>
          ),
          <volume>262</volume>
          {
          <fpage>280</fpage>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Duncker</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <article-title>On problem solving</article-title>
          .
          <source>Psychological Monographs</source>
          <volume>58</volume>
          (
          <issue>5</issue>
          ,
          <string-name>
            <given-names>Whole</given-names>
            <surname>No</surname>
          </string-name>
          .
          <volume>270</volume>
          ) (
          <year>1945</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Guilford</surname>
            ,
            <given-names>J.P.:</given-names>
          </string-name>
          <article-title>The nature of human intelligence</article-title>
          .
          <source>McGraw-Hill</source>
          , New York (
          <year>1967</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Kim</surname>
            ,
            <given-names>K.H.</given-names>
          </string-name>
          :
          <article-title>Can we trust creativity tests? a review of the torrance tests of creative thinking (ttct)</article-title>
          .
          <source>Creativity research journal 18(1)</source>
          ,
          <volume>3</volume>
          {
          <fpage>14</fpage>
          (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Maier</surname>
            ,
            <given-names>N.R.</given-names>
          </string-name>
          :
          <article-title>Reasoning in humans. II. The solution of a problem and its appearance in consciousness</article-title>
          .
          <source>Journal of Comparative Psychology</source>
          <volume>12</volume>
          (
          <issue>2</issue>
          ),
          <volume>181</volume>
          (
          <year>1931</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Mednick</surname>
            ,
            <given-names>S.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mednick</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Remote associates test: Examiner's manual</article-title>
          . Houghton Mi in (
          <year>1971</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Olteteanu</surname>
            ,
            <given-names>A.M.:</given-names>
          </string-name>
          <article-title>Publications of the Institute of Cognitive Science</article-title>
          , vol.
          <volume>01</volume>
          -
          <fpage>2014</fpage>
          ,
          <article-title>chap. Two general classes in creative problem-solving? An account based on the cognitive processes involved in the problem structure - representation structure relationship</article-title>
          .
          <source>Institute of Cognitive Science</source>
          , Osnabruck (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Olteteanu</surname>
            ,
            <given-names>A.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Falomir</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          :
          <string-name>
            <surname>comRAT-C:</surname>
          </string-name>
          <article-title>A computational compound remote associate test solver based on language data and its comparison to human performance</article-title>
          .
          <source>Pattern Recognition Letters</source>
          <volume>67</volume>
          ,
          <issue>81</issue>
          {
          <fpage>90</fpage>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Olteteanu</surname>
            ,
            <given-names>A.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schultheis</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dyer</surname>
            ,
            <given-names>J.B.</given-names>
          </string-name>
          :
          <article-title>Constructing a repository of compound Remote Associates Test items in American English with comRAT-G</article-title>
          . Behavior Research Methods, Instruments, &amp;
          <string-name>
            <surname>Computers</surname>
          </string-name>
          (accepted)
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Olteteanu</surname>
            ,
            <given-names>A.M.:</given-names>
          </string-name>
          <article-title>From simple machines to Eureka in four not-so-easy steps.Towards creative visuospatial intelligence</article-title>
          . In: Muller, V. (ed.)
          <source>Fundamental Issues of Arti cial Intelligence</source>
          ,
          <source>Synthese Library</source>
          , vol.
          <volume>376</volume>
          , pp.
          <volume>159</volume>
          {
          <fpage>180</fpage>
          . Springer (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>