<!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>Quite Simple Approaches for Authorship Attribution, Intrinsic Plagiarism Detection and Sexual Predator Identification</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Anna Vartapetiance</string-name>
          <email>A.Vartapetiance@surrey.ac.uk</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Lee Gillam</string-name>
          <email>L.Gillam@surrey.ac.uk</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>University of Surrey</institution>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2012</year>
      </pub-date>
      <abstract>
        <p>Tasks such as Authorship Attribution, Intrinsic Plagiarism detection and Sexual Predator Identification are representative of attempts to deceive. In the first two, authors try to convince others that the presented work is theirs, and in the third there is an attempt to convince readers to take actions based on false beliefs or ill-perceived risks. In this paper, we discuss our approaches to these tasks in the Author Identification track at PAN2012, which represents our first proper attempt at any of them. Our initial intention was to determine whether cues of deception, documented in the literature, might be relevant to such tasks. However, it quickly became apparent that such cues would not be readily useful, and we discuss the results achieved using some simple but relatively novel approaches: for the Traditional Authorship Attribution task, we show how a mean-variance framework using just 10 stopwords detects 42.8% and could be obtain 52.12% using fewer; for Intrinsic Plagiarism Detection, frequent words achieved 91.1% overall; and for Sexual Predator Identification, we used just a few features covering requests for personal information, with mixed results.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>The PAN activity has been around since the 2007 International Workshop on
Plagiarism Analysis, Authorship Identification, and Near-Duplicate Detection, and
has subsequently evolved to become Uncovering Plagiarism, Authorship, and Social
Software Misuse1. The first competitive PAN activity in 2009 had two parts, an
external task of checking document content against a collection, which largely
remains as the Plagiarism Detection task though with differences in approach between
2009 and 2012, and an intrinsic component apparently looking at writing style
changes within a document. This intrinsic component is now just one small part of the
Authorship Identification track (Tasks E and F), which also includes Traditional
Authorship Attribution (Task A, B, C, D, I, J) and Sexual Predator identification.
Authorship Attribution requires identifying, based on a sample of given texts, a likely</p>
    </sec>
    <sec id="sec-2">
      <title>1 Presumably the N of PAN now comes from the conjunction.</title>
      <p>author – in essence, identifying the closest match to other texts, as author names need
not be given. Intrinsic Plagiarism detection involves the separation of text fragments
from a single document where fragments are combined from two or more authors. For
Sexual Predators, the result comes from a binary classification in which the data of
interest relate to those conversations where some are attempting to deceive underage
children (mainly) to perform actions of an immoral and potentially illegal nature.</p>
      <p>In this paper, we outline the approach taken at the University of Surrey to these
quite varied tasks for PAN2012. In section 2, we discuss why current deception
detection cues seem to be unsuited for these tasks, which leads us to develop our own
approaches. Sections 3, 4 and 5 focus on each of the individual tasks and the results
obtained using relatively few features in most cases. Section 6 concludes the paper
with considerations for future work.
2</p>
      <sec id="sec-2-1">
        <title>Authorship Identification as Deception Detection?</title>
        <p>
          In Vartapetiance and Gillam [1], we discussed why current systems and approaches
for deception detection might not be effective in a variety of deceptive situations, one
reason being a lack of common data sets upon which to experiment. However, as far
as we can tell such approaches had not been explored systematically for PAN. We can
readily consider attempts at plagiarism (or copyright infringement) to be deceptive
acts, and certainly Sexual Predation would appear to be an attempt to deceive. Hence,
the treatment of deception would seem to be relevant to Authorship Identification and
vice versa. However, most of the cues for deception (e.g. in DePaulo et al. [2]) are
based on non-verbal behaviour (visual and vocal), so are immediately not fit for such
purposes. There are then different sets of verbal cues defined by various research
groups, though most are covered by three major categories: (
          <xref ref-type="bibr" rid="ref1">1</xref>
          ) Overall Impression (
          <xref ref-type="bibr" rid="ref2">2</xref>
          )
Quantitative cues and (
          <xref ref-type="bibr" rid="ref3">3</xref>
          ) Qualitative cues. Overall impression covers human
judgement – does somebody think it is truthful? – with all its subjective responses,
restricting us to Quantitative, including word counts and average words per sentence,
and Qualitative, that considers features such as self-references and occurrences of
negative words. But such kinds of cues appear to be used in yet other measures, for
example the Quantitative elements used in readability measures and the Quantitative
elements used to determine sentiment polarity. Indeed, some researchers have used
readability as an indication of deception in financial reporting, but unreadable text is
not necessarily an indication of deceiving so it is important to understand what is
being measured and how [3].
        </p>
        <p>
          Consider, for example, Pennebaker’s work, which has been widely used (e.g.
[46]), it is suggested that deceptive text will have (
          <xref ref-type="bibr" rid="ref1">1</xref>
          ) fewer self-references (
          <xref ref-type="bibr" rid="ref2">2</xref>
          ) more
negative words (
          <xref ref-type="bibr" rid="ref3">3</xref>
          ) more exclusive words and (
          <xref ref-type="bibr" rid="ref4">4</xref>
          ) fewer motion/action verbs.
Pennebaker introduces the Linguistic Inquiry and Word Count (LIWC) system which
it is claimed can detect deception based on the same cues [6]. But note that the
requirement for detecting deception is contrastive – more or fewer of something.
LIWC can offer information about how much of what kinds of words are contained,
but something needs to be available against which to make such a contrast. There is
also an issue with the point of reference – are such items to be measured for each
document, for each paragraph, for each senteice, or for each sub-clause? How can we
have a consistent contrast when we have technical documents, which we expect to
have few self-references, reviews of bad products, which we expect to have negative
words, and so on? Absent answers to such questions, we explored what might be
possible with the online version of LIWC2:
1. Traditional Authorship Attribution: Measures are mainly qualitative and
likely to be context (topic) specific, but there are too few full-text samples to
derive useful per-author ranges and readily select an author. Using the data for
training text and 12Atest01, the identifiable Author B has used 0.1%
selfreferences, but Author B’s samples have values of 9.23% and 11.11%, which
would suggest that author A with 0.64% is the closest match. For the various
training texts, explorations of such features did not begin to suggest a
workable methodology.
2. Intrinsic Plagiarism: For task E, since the number of authors is unknown, not
only would we need to ascertain where more or fewer was relevant, we would
also have to determine how many such distinctions to make. Such an ad hoc
approach is unlikely to generalise well.
3. Sexual Predators: The conversational nature of the task between the predator
(deceiver) and the prey (children) requires an initial separation, but in a
number of the conversations there is some indication of the desires of the
predator but a difference in intention. Indeed, some predators are certainly not
being at all deceptive about what they would like to do, and are happy to use
quite a number of self references, social words, and indicate positive emotions.
        </p>
        <p>Following various apparently unsuccessful attempts to make use of such cues, we
considered whether such kinds of deception may not be suited to detection using these
cues, and looked instead at what we might obtain first from simple features across the
data.
3</p>
      </sec>
      <sec id="sec-2-2">
        <title>Authorship Attribution: tasks A, B, C, D, I, J</title>
        <p>Much literature discusses the use of numerous NLP techniques that operate over
bags of words, N-grams, and parts of speech (POS), with varying degrees of success.
In many cases, stopwords are either an integral part of the analysis, without
consideration for how much they drive the analysis, or are dropped from processing.
Prior research in this task does not appear to have addressed whether authors’ writing
styles and preferred topics lead to distinctive positional preferences for stopwords.</p>
        <p>Church &amp; Hanks [7] describe a mean-variance framework for detecting strong
associations between co-occurring words and being able to distinguish amongst
patterns using this. Their examples are of fixed phrases such as “bread and butter”,
which demonstrate a clear preference over “butter and bread”. As an indicator of
style, we explored grammatical preference using a mean-variance framework with
just 10 stopwords.</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>2 Available at: http://www.liwc.net/tryonline.php</title>
      <p>4.1</p>
      <sec id="sec-3-1">
        <title>AA, Closed dataset</title>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>The approach taken for the closed dataset was:</title>
      <p>Step 1 Select the 10 most frequent words from the Oxford English Dictionary:
the, be, to, of, and, a, in, that, have, I
Step 2 Generate regular expressions for all pairs of these words, e.g. the+have,
have+the, and use a specific size of window N (here, 5).</p>
      <p>Step 3 Extract concordances containing the regular expressions for all author texts
Step 4 Calculate per-author frequency, mean and variance information for the pairs.
Step 5 Calculate the frequency, mean and variance for the test data (per document)
in the same way.</p>
      <p>Step 6 Select the author with closest match values</p>
      <p>An example of the values derived for three authors is shown below in Table 1,
against text 12Atest01. The selected author is, in essence, decided on by the number
of votes cast by matches to frequency, mean and variance as shown in Table 2.</p>
      <p>For the open dataset, to account for data not belonging to any of the authors in the
training set, we used a simple confidence measure: if the count difference between the
1st and 2nd highest values is less than 5, it is reported that there is no author. Table 3
shows an example where matches have been made to different authors but with
insufficient confidence (difference = 3).</p>
      <p>
        Results from PAN2012 show that this method achieves 41%, flagging 28 out of 71
documents correctly. In post-competition analysis, we investigated effects of
changing the gaps size (5, 10 and 25), changing the confidence (
        <xref ref-type="bibr" rid="ref2 ref3 ref5">2, 3, 5, 10</xref>
        ) and
looking at subsets of the 10*10 stopword combinations (four directional subsets of
5*5, denoted as pairs of S1, S2). Table 4 shows results those comparable to or better
than our competition result. Of particular interest is that:
 Judicious use of the 5*5 performs better, with the same threshold of 5 (case 3 and
4).
 Patterns starting with S2 did not help detection
 For open datasets, lower threshold seems to work better
 Best results would have been achieved with S1*S1 for closed and S1*S2 for open
data sets; improving the results by almost 10%
      </p>
      <sec id="sec-4-1">
        <title>Intrinsic Plagiarism Detection: task E and F</title>
        <p>
          Depending on the approach, Intrinsic Plagiarism Detection might be categorized as
Authorship Attribution - it can be related to identifying parts of a text least likely to
have been produced by the current author. However, there are various differences: for
Authorship Attribution, (
          <xref ref-type="bibr" rid="ref1">1</xref>
          ) texts are usually longer, (
          <xref ref-type="bibr" rid="ref2">2</xref>
          ) there are training samples (
          <xref ref-type="bibr" rid="ref3">3</xref>
          )
two long texts are usually compared (
          <xref ref-type="bibr" rid="ref4">4</xref>
          ) the boundaries for comparison are known (
          <xref ref-type="bibr" rid="ref5">5</xref>
          )
decisions are usually for an individual. But this is not necessarily true for Intrinsic
Plagiarism which is often (
          <xref ref-type="bibr" rid="ref1">1</xref>
          ) in short sections (
          <xref ref-type="bibr" rid="ref2">2</xref>
          ) only internally comparable (
          <xref ref-type="bibr" rid="ref3">3</xref>
          ) with
unknown boundaries (
          <xref ref-type="bibr" rid="ref4">4</xref>
          ) with unknown number of plagiarised sections (
          <xref ref-type="bibr" rid="ref5">5</xref>
          ) with many
possible decisions. For these reasons, the approach outlined above would not usefully
flag the plagiarized content – here, paragraphs. Instead, we looked to a new approach,
starting with Task F as it was mentioned that task E might have more than 2 authors.
5.2
        </p>
        <sec id="sec-4-1-1">
          <title>Intrinsic Plagiarism, task F</title>
        </sec>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>The approach taken for Task F was:</title>
      <p>Step 1 Select the 50 most frequent words from the file, after removing stopwords.
Step 2 Determine frequency by paragraph for these 50 words
Step 3 Select (sequences of) paragraphs with fewer similarities (e.g. &lt; 10)</p>
      <p>If there is more than one sequence:
Step 3a Select the longest sequences of paragraphs which do not share the most
frequent word, and have the lowest average frequency for top 5 of these 50 words</p>
      <p>Table 5 shows paragraphs flagged by total frequency below 10. These sequences’
average frequency for the top 5 shows that the [P4, P5, P6] sequence is least relevant
to the file.</p>
      <p>For 12Ftest02, steps 1-3 identify P01, P04 and [P06, P07, P08]. Calculating with
the 5 most frequent words suggested [P06, P07, P08] to be the sequence. However, all
similarly shared the most frequent words suggesting that they are all related to the
topic. We allocated “no author” to that file, even though it was not suggested in the
competition that the dataset could have open answers.</p>
      <p>P04 P07 P08 P12 P13 P15 P17 P21 P29
A2
NA NA NA NA NA NA NA NA NA</p>
      <p>3 1 1 1 1 1 1 1 1
NA NA NA NA NA NA NA NA NA
NA NA NA NA NA NA NA NA NA
NA NA NA NA NA NA NA NA NA
A2 A2 A2 A2 A2 A2 A2 A2 A2</p>
      <p>The approach to Task F would not distinguish as readily. We adapted this for task
E as follows:
Step 1 As task F
Step 2 As task F
Step 3 Extract the nouns from the 50 most frequent words (excluding stopwords)
Step 4 For the highest frequency noun, create a cluster and remove from
consideration all other nouns enclosed by this – i.e. occurring in the same paragraphs.
Repeat this step to produce new clusters from the remaining nouns.</p>
      <p>Where paragraphs are not allocated to a cluster:
 If the number of consecutive unallocated paragraphs is greater than 5, these form
a new cluster.
 For others: (a) paragraphs between two in the same cluster are allocated to that
cluster; (b) paragraphs between different clusters are allocated to the subsequent
cluster.</p>
      <p>A sample of the process and the results from one of the test sets in presented in
Table 6, with errors highlighted with gray.</p>
      <p>To validate our reasoning behind not using the Task F approach, we used the 5
most frequent words (from task F) and used Step 4 of task E to cluster them into
groups. Interestingly, for 12Etest01 this only mis-classified P19 as Author 2, but we
have mis-classified 2 for our final submission. However, such a gain would have
come at the cost of losses elsewhere.</p>
      <p>Competition results show these approaches gave 100% (Task F) and 82.2% (Task
E) accuracy, a simple average of which would make us 2nd in just this task (91.1%
against 94.2%). We are now looking further at what might have improved methods to
improved performance in Task E without introducing complexity.</p>
      <p>Just like other sub-tasks in this paper, Sexual Predator actions carry a level of
deception which may or may not lie in the text but with the actions followed. Since
we have never attempted the analysis of such a corpus or topic previously, we have
taken relatively straightforward approach, and with reference to the training corpus
this appears to offer good performance (up to f1=0.66), but for which we would have
concern over the rate of false negatives as we discuss later.</p>
      <sec id="sec-5-1">
        <title>Process of Sexual Predators Identification</title>
        <p></p>
        <p>As it was the first time we have attempted such a task, we randomly took 10
predators IDs from the training set to set about manually discovering patterns. We
found obvious similarities, and classified these as described below (examples are
shown below in Table 7):</p>
        <p>Address: asking for the address of the house or somewhere close to drive to in
other to meet up. Mostly, it’s the predator who asks the question about the child’s
address and it was rare for children to ask whether the predator would need/like their
address. This alone detects 58 out of 142 in the training data, appearing more than
once, and 28 times it appears twice or more with very high precision (85%).</p>
        <p>Parents: another strong feature. Questions about parents are usually because of:
 Secrecy


</p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>Making sure children are alone while chatting Making sure the chat history will be deleted later Saying nothing to their parents</title>
      <sec id="sec-6-1">
        <title>Seclusion</title>
        <p>
</p>
      </sec>
    </sec>
    <sec id="sec-7">
      <title>To determine whether parents are around</title>
      <p>To ascertain how long they would be gone for</p>
      <p>This feature detects 84 out of 142, when appearing once or more, and 49 when
appearing twice or more. Combining “address” and “parents” would detect 105 and
74 respectively.</p>
      <p>Age: Some predators might lie about their age but most seem quite open about
their age. They would usually highlight the fact that they are older, wishing the child
were older, and this is mainly to retain the secrecy.</p>
      <p>Intention: Interestingly, not many of these chats have direct references to their
sexual intentions. They usually focus on the concept of meeting up and having fun
time, watching TV, listen to music and have some alcohol. In some cases there may
be mentions of what they would like to do – these are mostly limited to cuddles and
kisses and so sexual activities are more apparent.</p>
      <p>We tested all of the above mentioned categories individually, varying the number
of occurrences, and in various combinations, with the PAN2012 training data. Our
analysis of these results is shown in Table 8.</p>
      <p>For the competition, we used the combination of all four categories that occurred
twice or more, as this offered the optimal f1 score on training data (precision=0.7,
recall=0.62 and F1=0.66).</p>
      <p>However, it can easily be argued that for real detection the false negatives would
be of particular concern. Let us consider an application that might filter out possible
predatory conversations. What characteristics would a parent rather have: stringent
filtering of suspicious behaviour but with a high false positive rate so that some
genuine conversations are dropped, or conversations with real predators that may
remain and appear acceptable? The competition webpage suggests that the decision
on efforts put on investigation are the dominion of the system “to optimize the time of
a police agent towards the "right" suspect rather than "all" the possible suspects”. This
presents a disturbing view of such a system, and we would strongly contend that the
system should produce results ranked according to confidence, but resourcing
judgements should be left to the conscience of human beings who are fully aware of
the consequences of such missed results. Recall, then, should be a higher priority –
F2, not F0.5 – even if this would reduce our placing in this task.</p>
      <p>To see if we could have improved our results, post submission but before results,
we also tested the combination of best f1 scores of all categories on the training
dataset. The result for “one occurrence” across all 4 classes increased from 0.42 to
0.58 because Parent was already based on two occurrences, but the two and three
occurrence scores decrease respectively to 0.6 and 0.48. Currently we are looking at
other ways to increase the detection rate while keeping the simplicity of the method.
We have already found a few words that can improve the detection, especially in case
of sexual comments related to “intentions”.</p>
      <p>Checking the ground truth of second section raised some questions for us based on
the number of lines selected and the content. For example, lines such as:
0fe0367fc3735101fbf7aa3df1cb9f4e
6bf9b33a9f4ae1df54cb89831eac1be2
94c71d9e905c390d310f3f315f9c7b19
94c71d9e905c390d310f3f315f9c7b19
37 what grade u in
5 :)
41 i promise
45 age
7</p>
      <sec id="sec-7-1">
        <title>Conclusion</title>
        <p>We attempted, for the first time, the Author Identification track at PAN2012,
participating in all three tasks of Authorship Attribution, Intrinsic Plagiarism
detection and Sexual Predator Identification. We attempted to use fairly simple
approaches in each case to determine the extent to which these might be effective, and
believe there is some degree of novelty presented in each approach. It was surprising,
for example, that just 5 stopwords with a mean-variance framework might be able to
produce reasonable performance in Authorship Attribution, given that it is essentially
a stylometric approach.</p>
        <p>Our initial intention was to determine how the supposed cues of deception might
be useful against benchmark data collections, but we have seen little indication of
relevance to these kinds of deception. What we have learnt from participating in these
tasks can now be applied back to reported deception experiments elsewhere to see
whether deception is indicated by features which are not usually in the set selected by
the researchers – positive evidence being so much easier to discern.</p>
        <p>Our best results appear to have been obtained against Intrinsic Plagiarism, which
was very much an 11th hour effort. However, plenty of room for improvement remains
against the other tasks, and the generalisability of our approaches can now be
evaluated across previous PAN datasets also.</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Vartapetiance</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gillam</surname>
          </string-name>
          , L.:
          <article-title>“I don't know where he's not”: Does Deception Research yet offer a basis for Deception Detectives?:</article-title>
          <source>Proceedings of the Workshop on Computational Approaches</source>
          to Deception Detection, pp.
          <fpage>3</fpage>
          -
          <lpage>14</lpage>
          , Avignon, France (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>DePaulo</surname>
            ,
            <given-names>B.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lindsay</surname>
            ,
            <given-names>J.J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Malone</surname>
            ,
            <given-names>B.E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Muhlenbruck</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Charlton</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cooper</surname>
          </string-name>
          , H.:
          <article-title>Cues to Deception: Psychological Bulletin</article-title>
          , vol.
          <volume>129</volume>
          (
          <issue>1</issue>
          ), pp.
          <fpage>74</fpage>
          -
          <lpage>118</lpage>
          (
          <year>2003</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Moffitt</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Burns</surname>
            ,
            <given-names>M.B.</given-names>
          </string-name>
          :
          <article-title>What Does That Mean? Investigating Obfuscation and Readability Cues as Indicators of Deception in Fraudulent Financial Reports:</article-title>
          <source>Fifteenth Americas Conference on Information Systems</source>
          , San Francisco (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Little</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Skillicorn</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <source>Detecting Deception in Testimony: Proceeding of IEEE International Conference of Intelligence and Security Informatics (ISI</source>
          <year>2008</year>
          ), pp.
          <fpage>13</fpage>
          -
          <lpage>18</lpage>
          , Taipei, Taiwan (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Gupta</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Skillicorn</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Improving a Textual Deception Detection Model:</article-title>
          <source>Proceedings of the 2006 Conference of the Center for Advanced Studies on Collaborative Research</source>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>4</lpage>
          , Toronto, Canada (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Newman</surname>
            ,
            <given-names>M.L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pennebaker</surname>
            ,
            <given-names>J.W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Berry</surname>
            ,
            <given-names>D.S</given-names>
          </string-name>
          , Richards,
          <string-name>
            <surname>J.M.</surname>
          </string-name>
          : Lying Words:
          <article-title>Predicting Deception from Linguistic Styles: Personality and Social Psychology Bulletin</article-title>
          , vol.
          <volume>29</volume>
          (
          <issue>5</issue>
          ), pp.
          <fpage>665</fpage>
          -
          <lpage>675</lpage>
          (
          <year>2003</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Church</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hanks</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          : Word Association Norms,
          <source>Mutual Information and Lexicography: Computational Linguistics</source>
          , vol.
          <volume>16</volume>
          (
          <issue>1</issue>
          ), pp.
          <fpage>22</fpage>
          -
          <lpage>29</lpage>
          (
          <year>1991</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>