<!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>Election of Diagnosis Codes: Words as Responsible Citizens</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Aron Henriksson</string-name>
          <email>aronhen@dsv.su.se</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Martin Hassel</string-name>
          <email>xmartin@dsv.su.se</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Computer &amp; System Sciences (DSV), Stockholm University Forum 100</institution>
          ,
          <addr-line>164 40 Kista</addr-line>
          ,
          <country country="SE">Sweden</country>
        </aff>
      </contrib-group>
      <fpage>67</fpage>
      <lpage>74</lpage>
      <abstract>
        <p>Providing computer-aided support for the assignment of diagnosis codes has been approached in numerous ways, often by exploiting free-text fields in patient records. Modeling the 'meaning' of diagnosis codes through statistical data on co-occurrences of words and assigned codes-using a method known as Random Indexing-has only recently been explored as an interesting, alternative solution. It involves words in a clinician's notes 'voting' for semantically associated diagnosis codes, the election results yielding a single list of recommendations. This approach is here applied and evaluated on a corpus of over 250,000 coded patient records. The evaluation is performed by comparing the recommended codes generated by the model with those assigned by the clinicians. Applying the tf-idf weighting scheme somewhat improves results for general models (23% recall for exact matches) but has little effect on domainspecific models (32% and 59% recall for exact matches). These results confirm the potential of Random Indexing for diagnosis code assignment support, and merits further attention.</p>
      </abstract>
      <kwd-group>
        <kwd>Diagnosis Code Assignment</kwd>
        <kwd>ICD-10</kwd>
        <kwd>Random Indexing</kwd>
        <kwd>Electronic Patient Records</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        Diagnostic coding is part of a clinician’s everyday work routine, its purpose
being to classify diseases and other health-related issues. This makes it
possible to quantify the complex operations of healthcare and thus enables effective
oversight of hospitals; it also produces statistics on a regional, national and
international level. For such statistics to be comparable, a standard such as the
10th revision of the International Classification of Diseases and Related Health
Problems (ICD-10) needs to be employed [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].
      </p>
      <p>The important yet somewhat tedious task of assigning appropriate
diagnosis codes is typically accompanied by note-taking. This information source is
often exploited in attempts to provide computer-aided coding support, given
the successful application of natural language processing to other classification
problems. Since a clinician’s assessment and other notes often overlap with the
content of the assigned diagnosis code(s), the text may be used to infer possible
codes, not automating but greatly facilitating the coding process.</p>
    </sec>
    <sec id="sec-2">
      <title>Ele2ction ofHDeinargiknsossoins,CHoadsesse:l Words as Responsible Citizens</title>
      <p>
        Computer-aided diagnostic coding support has long been an active research
area (see [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] for a review); however, the results are yet to reach a level where use
in a clinical setting is widespread. Natural language processing techniques are
applied in most previous attempts, which include rule-based systems and
statistical classifiers. Larkey and Croft [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] assign ICD-9 codes to discharge summaries
using a combination of classifiers and achieve 87.9% precision, measured as the
presence of the principal code among ten recommended codes.
      </p>
      <p>
        Pakhomov et al. [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] propose a two-step classifier, where the notion of certainty
is used to determine whether subsequent manual review is needed. A diagnostic
statement is fed to an example-based classifier and, if unsuccessful, forwarded to
a machine learning component, which generates a number of suggestions ranked
by confidence. These are subjected to manual review. Fixed fields, such as gender
information, are exploited to filter out improbable classifications. They report
micro-averaged F1-scores ranging from 58.6% to 96.7%, depending on whether
the diagnostic entries are found in the database of previously coded entries.
      </p>
      <p>
        In the Computational Medicine Center’s 2007 Medical NLP Challenge [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ],
a limited set of 45 ICD-9-CM codes were to be assigned to radiology reports,
more specifically based on the clinical history and impression fields. The
automatic systems were evaluated against a gold standard, which was created using
the majority annotation from three independent annotation sets. Many of the
best-performing contributions are heavily dependent on hand-crafted rules, with
the winning contribution achieving a micro-averaged F1-score of 89%. Farkas
and Szarvas [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] decided instead to combine predefined rules based on the
ICD9-CM coding guide with automated procedures, which effectively reduces the
development effort and yet results in a high micro-averaged F1-score of 88.9%.
The third-best system uses classifiers that perform a binary classification for
each label and achieves a micro-averaged F1-score of 87.7%. They found that
the choice of classifier was less important but that identifying negations, making
use of the structure of UMLS1 and enriching the to-be-classified documents with
hypernyms helped [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ].
      </p>
      <p>
        The possible application of the word space model to this problem has only
recently been investigated. We have previously proposed the use of Random
Indexing as an interesting alternative [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. In that study, the method is evaluated
qualitatively on a limited set of documents, yielding promising yet tentative
results. There is thus a need for those results to be consolidated by a more
quantitative evaluation, while there is also considerable scope for the method to
be developed further.
      </p>
      <p>
        The word space model is an application of the vector space model (see [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] for
a review) and attempts to capture the meaning of words through statistics on
word co-occurrences. This is based on the distributional hypothesis, which states
that words that appear in similar contexts tend to have similar properties. Thus
if words repeatedly co-occur, we can assume that they in some way refer to
similar concepts [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]. Given the successful application of word space models to
information retrieval, semantic knowledge tests (e.g. TOEFL), text
categoriza1 Unified Medical Language System
tion, text summarization, word sense disambiguation, etc., it may also prove a
viable solution for diagnostic coding support.
2
      </p>
      <sec id="sec-2-1">
        <title>Method</title>
        <p>
          Random Indexing [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ], [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ] is applied on a corpus of almost 270,000 coded patient
records to calculate co-occurrences of words in clinical notes and assigned ICD-10
codes, creating models which can be used to predict diagnosis codes for uncoded
documents. The method comprises the following steps: (1) pre-processing the
data, (2) building a number of word space models using the training data, (3)
generating suggested diagnosis codes for the documents in the test data and (4)
evaluating the results by matching the suggested codes with those assigned by
the clinicians.
        </p>
        <p>
          A subset of the Stockholm EPR corpus [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ] is used for training and evaluating
the created models. The subset contains approximately 5.5 million notes from
838 clinical units2. Documents contain notes from one clinical unit about a single
patient and are created differently depending on the definition of a patient visit :
(1) notes made on the same day, (2) notes made on consecutive days and (3)
notes made with at most one undocumented day in between. The reason for
the different partitions is to see what effect the length of the documents has on
the models: do they benefit from additional information or are they impaired
by potentially less uniform content? Documents are associated with assigned
codes; documents without any associated codes are ignored. These documents
are first pre-processed: lemmatization is done using the Granska Tagger [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ],
while punctuation, digits and stop words are removed. The pre-processed data
is subsequently partitioned into two subsets, where one is used for training (90%)
and the other is set aside for testing (10%). In the training set, the associated
ICD-10 codes are included in the input documents, whereas in the test set,
they are retained separately for evaluation. Diagnosis codes are generally not
mentioned in the free-text fields; the idea is that no such information should be
revealed to the models in the testing phase.
        </p>
        <p>We then generate a number of models by constructing a word vector for each
token (words and ICD-10 codes) encountered in the training data. The relative
directions of these word vectors in the word space are assumed to indicate
semantic similarity. The construction of the word vectors requires the context to be
defined and represented in some way. The context is often defined as a paragraph
or a window of surrounding words; however, in our case, it includes an entire
document, as there is no sequential dependency between the diagnosis code and
the words in the document. Each document, i.e. the context, is assigned a unique
and randomly generated context vector, which is a sparse, high-dimensional and
ternary vector. The dimensionality of the context vectors depends on the size
and redundancy of the data—we have set it to 1,000—with a very small number
(1-2%) of randomly distributed +1s and -1s, while the remaining elements are set
2 This research has been approved by the Regional Ethical Review Board in Stockholm
(Etikpro¨vningsna¨mnden i Stockholm), permission number 2009/1742-31/5.
Ele4ction ofHDeinargiknsossoins,CHoadsesse:l Words as Responsible Citizens
to 0. The word vectors are then built by processing the documents: every time a
word occurs in a particular context, the context vector is added to the word
vector. The usage of a word is thus represented as a vector, which is the sum of the
context vectors of the contexts in which it appears. We build a model for each
of our data sets: three general models (general elections ), which are trained on
the entire data set, and two domain-specific models (municipal elections ), which
are trained on subsets from a single type of clinic: ENT (Ear-Nose-Throat) and
rheumatology clinics respectively. The reason for creating domain-specific
models is that, by limiting the sparsity of the data and the classification problem (#
of possible ICD-10 codes), we may achieve better results. Furthermore, we build
bigram versions of some of the above models. As bigrams are more informative
than unigrams and represent a means of dealing with multiword expressions,
they may prove to be appropriate units in the construction of the models.</p>
        <p>These models are then used to produce a ranked list of a number of
recommended ICD-10 codes (e.g. 10) for each query document (i.e. excluding codes).
For each word in a document, a ranked list of semantically correlated words
is retrieved from the model. As we are interested in recommending diagnosis
codes, the results are filtered to include only such tokens. The individual lists
of all the words in the document are combined to produce a single ranked list.
This ensemble method is carried out in one of two ways: (1) by using the
ranking positions of the codes in the individual lists and (2) by using the semantic
(cosine) similarity scores of the codes in the individual lists.</p>
        <p>In this initial approach, we apply the ’one word, one vote’ system, i.e. all
words have an equal say in electing the diagnosis codes (democratic approach).
This simple yet rather naive approach is refined by implementing the tf-idf
(term frequency-inverse document frequency) weighting scheme (meritocratic
approach), effectively giving a stronger voice to prominent (tf) words that have a
high discriminatory value (idf). Tf is implicit in our method, as each instance of
a word has its own vote, while idf is retrieved from the model.</p>
        <p>The evaluation is conducted by comparing the codes that were assigned by
the clinicians with the model-generated recommendations. This matching is done
on all four possible levels of ICD-10 according to specificity (Figure 1). If a
clinically assigned code is not given at the most specific level—as is often the
case—and that same code is recommended by the model, it naturally counts as
an exact match. To gauge the quality of the results, they are compared with a
naive baseline for each model. It is created by matching the assigned codes for
each document against a list of the most frequent labels in the training set.</p>
      </sec>
      <sec id="sec-2-2">
        <title>Results</title>
        <p>The data sets have a distinct number of tokens and unique codes per visit (Table
1). While the set of codes is identical across the general data sets (12,396 labels),
these are much smaller in the domain-specific versions (1,713 and 638 labels).
The models trained and evaluated on the bigram versions of the above data sets
fail to yield an improvement over the simpler unigram models. Those models are
therefore not considered in any of the subsequent experiments. Out of the two
ensemble methods applied in the production of the final list of recommended
codes, the one whereby the cosine similarity scores are taken into account
generally performs somewhat better than the more basic variant in which the ranking
positions are used.</p>
        <p>The models are initially employed in a democratic approach, i.e. all words
have an equal vote (Table 2). In the general data sets, approximately 21% of the
assigned codes are recommended by the corresponding models. Partial matches
are more frequent, with approximately 29% matched on level 2. The results are
higher when applying the domain-specific models: 31% exact matches in ENT
and 59% in Rheumatology. Similar increases are observed when matching at the
less specific levels, with 61% and 93% partial matches respectively.</p>
        <p>The models are then applied in a meritocratic fashion, i.e. some words have a
greater say than others (Table 3). This approach leads to a small increase in the
performance of the general models (up to 3 percentage points), with little impact
on the domain-specific models, even having an adverse effect in Rheumatology.
0days general
1days general
2days general
0days ENT
0days Rheumatology</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Ele6ction ofHDeinargiknsossoins,CHoadsesse:l Words as Responsible Citizens</title>
      <p>0days general
1days general
2days general
0days ENT
0days Rheumatology
When we increase the number of generated recommendations, the results
improve to some degree (Figure 2). For recall 15, the results increase by up to 7
percentage points and, for recall 20, they increase by up to 13 percentage points.
That is, when 20 recommended codes are generated, 28% of the clinically
assigned codes are recommended by the general models, while 38% (ENT) and
69% (Rheumatology) are matched by the domain-specific models. The baseline
is beaten by the general models but not always by the domain-specific versions.
The definition of a patient visit, which potentially determines the length of the
documents and the number of assigned codes, appears to have a negligible impact
on the results. As can be seen in Table 1, the average number of tokens per visit
only increases slightly, while the average number of assigned codes is more or
less equal. The reason for this is probably that the status of inpatients is usually
monitored and documented on a near-daily basis.</p>
      <p>The domain-specific models perform significantly better than the general
models. This was expected considering the extent to which the classification
problem is thereby limited: the number of labels is reduced from 12,396 to 1,713
(ENT) and 638 (Rheumatology). The discrepancy between the two
domainspecific models, including the average number of codes per visit in ENT (2.1)
and Rheumatology (1.2), is likewise a possible reason for the latter performing
better than the former.</p>
      <p>The meritocratic approach had surprisingly little effect on the results. While
it did have a positive yet small impact on the general models, it had little—and
even a negative—impact on the domain-specific models. A qualitative analysis
of which types of words benefit from this weighting scheme would be interesting.
It is likely that a small set of keywords are highly indicative of the diagnoses
and need to be given additional weight. In a technocratic approach, this could
be achieved by seeking out words used in the ICD-10 descriptions or by looking
for SNOMED CT terms, such as diseases and body parts.</p>
      <p>
        The fact that the bigram models performed worse than the unigram models
could possibly be due to the sparsity of the data. That is, there are many more
distinct tokens and fewer instances of each. The same conclusion was reached
by Suominen et al. [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ], where bigrams and trigrams were shown to yield no
improvement in the assignment of ICD-9-CM codes.
      </p>
      <p>
        The results presented here are not directly comparable with those in
previous studies, primarily due to the tasks being of different orders of magnitude.
In comparison to the 2007 shared task [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], in which a limited set of 45 labels
were used, our classification problem comprises thousands of labels. While they
ensured that the testing data did not contain any unseen labels, ours could and
did. Moreover, the shared task was limited to assigning one or two codes,
although they were punished for failing to assign the exact the number of labels.
In contrast, we have so far only presented recall scores, measured as the presence
of clinically assigned codes in a list of 10, 15 or 20 recommendations. The same is
done in [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], although, in that case, only a single label—the principal code—was
to be assigned. In contrast to the shared task, where the data was produced by
expert coders and the best-performing systems to a large extent relied on
handcrafted rules, this study evaluates a statistically-based method on large volumes
of clinically generated data. However, building models on real, noisy data,
without relying heavily on rules that are expensive to create, is precisely what could
make this method a feasible solution for future clinical coding support.
      </p>
      <p>
        In future work, we plan to exploit fixed fields in patient records, such as age
and gender, to avoid statistically rare correlations, as was successfully done in
[
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. Furthermore, we believe negation handling may have a positive effect on
results. This could be achieved by, for instance, ignoring negated diagnoses in
the construction of the word space models. Different levels of certainty may also
be factored into the equation. Detection of negation and uncertainty was shown
in [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] to have a positive effect on the automatic assignment of diagnosis codes.
      </p>
    </sec>
    <sec id="sec-4">
      <title>Ele8ction ofHDeinargiknsossoins,CHoadsesse:l Words as Responsible Citizens</title>
      <sec id="sec-4-1">
        <title>Conclusion</title>
        <p>We have quantitatively evaluated the use of Random Indexing as a means to
provide diagnostic coding support on over 250,000 patient records. An array of
models and two ensemble methods were evaluated. A meritocratic approach
(tfidf weighting) yields little improvement over a democratic approach (one word,
one vote) in the election of appropriate diagnosis codes. Domain-specific models
produce significantly better results (at best 61% exact matches and 93% partial
matches) than general models (22% exact matches and 61% partial matches).</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1. World Health Organization:
          <article-title>International Classification of Diseases (ICD). [Internet]</article-title>
          .
          <source>Geneva: WHO; 2011 [accessed June</source>
          <year>2011</year>
          , available from: http://www.who. int/classifications/icd/en/] (
          <year>2011</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Stanfill</surname>
            ,
            <given-names>M.H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Williams</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fenton</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jenders</surname>
            ,
            <given-names>R.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hersh</surname>
            ,
            <given-names>W.R.:</given-names>
          </string-name>
          <article-title>A systematic literature review of automated clinical coding and classification systems</article-title>
          .
          <source>J Am Med Inform Assoc</source>
          ,
          <volume>17</volume>
          , pp.
          <fpage>646</fpage>
          -
          <lpage>651</lpage>
          (
          <year>2010</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Larkey</surname>
            ,
            <given-names>L.S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Croft</surname>
          </string-name>
          , W.B.:
          <article-title>Automatic Assignment of ICD9 Codes to Discharge Summaries</article-title>
          . In
          <source>PhD thesis</source>
          University of Massachusetts at Amherst, Amherst, MA (
          <year>1995</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Pakhomov</surname>
            ,
            <given-names>S.V.S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Buntrock</surname>
            ,
            <given-names>J.D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chute</surname>
            ,
            <given-names>C.G.</given-names>
          </string-name>
          :
          <article-title>Automating the Assignment of Diagnosis Codes to Patient Encounters Using Example-based and Machine Learning Techniques</article-title>
          .
          <source>J Am Med Inform Assoc</source>
          ,
          <volume>13</volume>
          , pp.
          <fpage>516</fpage>
          -
          <lpage>525</lpage>
          (
          <year>2006</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Pestian</surname>
            ,
            <given-names>J.P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Brew</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Matykiewicz</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hovermal</surname>
            ,
            <given-names>D.J.</given-names>
          </string-name>
          , Johnson, N.,
          <string-name>
            <surname>Cohen</surname>
            ,
            <given-names>K.B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Duch</surname>
            ,
            <given-names>W.: A Shared</given-names>
          </string-name>
          <string-name>
            <surname>Task</surname>
          </string-name>
          <article-title>Involving Multi-label Classification of Clinical Free Text</article-title>
          .
          <source>In Proceedings of the Workshop on BioNLP</source>
          (
          <year>2007</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Farkas</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Szarvas</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          :
          <article-title>Automatic construction of rule-based ICD-9-CM coding systems</article-title>
          .
          <source>BMC Bioinformatics</source>
          ,
          <volume>9</volume>
          (
          <issue>3</issue>
          ) (
          <year>2008</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Suominen</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ginter</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pyssalo</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Airola</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pahikkala</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Salanter</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Salakoski</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Machine Learning to Automate the Assignment of Diagnosis Codes to Free-Text Radiology Reports: A Method Description</article-title>
          .
          <source>In Proceedings of the IMCL/UAI/COLT Workshop on Machine Learning for Health-Care Applications</source>
          (
          <year>2008</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Henriksson</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hassel</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kvist</surname>
            ,
            <given-names>M.:</given-names>
          </string-name>
          <article-title>Diagnosis Code Assignment Support Using Random Indexing of Patient Records - A Qualitative Feasibility Study</article-title>
          .
          <source>In Proceedings of AIME, 13th Conference on Artificial Intelligence in Medicine</source>
          (
          <year>2011</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Turney</surname>
            ,
            <given-names>P. D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pantel</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          : From Frequency to Meaning:
          <article-title>Vector Space Models of Semantics</article-title>
          .
          <source>Journal of Artificial Intelligence Research</source>
          ,
          <volume>37</volume>
          , pp.
          <fpage>141</fpage>
          -
          <lpage>188</lpage>
          (
          <year>2010</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Harris</surname>
            ,
            <given-names>Z. S.:</given-names>
          </string-name>
          <article-title>Distributional structure</article-title>
          .
          <source>Word</source>
          ,
          <volume>10</volume>
          , pp.
          <fpage>146</fpage>
          -
          <lpage>162</lpage>
          (
          <year>1954</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Sahlgren</surname>
            ,
            <given-names>M:</given-names>
          </string-name>
          <article-title>Vector-Based Semantic Analysis: Representing Word Meanings Based on Random Labels</article-title>
          .
          <source>In Proceedings of Semantic Knowledge Acquisition and Categorization Workshop</source>
          at ESSLLI'
          <volume>01</volume>
          (
          <year>2001</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Sahlgren</surname>
            ,
            <given-names>M.:</given-names>
          </string-name>
          <article-title>The Word-Space Model: Using distributional analysis to represent syntagmatic and paradigmatic relations between words in high-dimensional vector spaces</article-title>
          . In
          <source>PhD thesis</source>
          Stockholm University, Stockholm, Sweden (
          <year>2006</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Dalianis</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hassel</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Velupillai</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          : The Stockholm EPR Corpus:
          <article-title>Characteristics and Some Initial Findings</article-title>
          .
          <source>In Proceedings of ISHIMR</source>
          <year>2009</year>
          , pp.
          <fpage>243</fpage>
          -
          <lpage>249</lpage>
          (
          <year>2009</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Knutsson</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bigert</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kann</surname>
          </string-name>
          , V.:
          <article-title>A Robust Shallow Parser for Swedish</article-title>
          .
          <source>In Proceedings of Nodalida</source>
          (
          <year>2003</year>
          ).
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>