<!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>FlawFinder: A Modular System for Predicting Quality Flaws in Wikipedia</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>z Ubiquitous Knowledge Processing Lab</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Computer Science Technische Universita ̈t Darmstadt</institution>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Oliver Ferschke</institution>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2012</year>
      </pub-date>
      <abstract>
        <p>With over 23 million articles in 285 languages, Wikipedia is the largest free knowledge base on the web. Due to its open nature, everybody is allowed to access and edit the contents of this huge encyclopedia. As a downside of this open access policy, quality assessment of the content becomes a critical issue and is hardly manageable without computational assistance. In this paper, we present FlawFinder, a modular system for automatically predicting quality flaws in unseen Wikipedia articles. It competed in the inaugural edition of the Quality Flaw Prediction Task at the PAN Challenge 2012 and achieved the best precision of all systems and the second place in terms of recall and F1-score.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>http://www.ukp.tu-darmstadt.de</p>
    </sec>
    <sec id="sec-2">
      <title>1 Introduction</title>
      <p>
        On July 13th, 2012, the English Wikipedia reached its four millionth article1. Since the
launch in 2001, the growing community around the free online encyclopedia has
produced a knowledge base that is unprecedented in its size and coverage, which is not
least due to the policy that anyone can edit its content. In contrast to Wikipedia’s
unsuccessful predecessor, Nupedia, which allowed only experts to contribute in order to
maintain a high quality standard, Wikipedia’s open policy was the main engine of the
project’s success. However, as a downside of this approach, there is no traditional
editorial board that ensures the information and text quality of the articles. Hence, quality
assurance is reduced to the many eyes principle, hoping that many editors with equal
rights monitor each other and thus produce a high quality output. While this approach
might work on a global level – the overall quality of Wikipedia has found to be on par
with the quality of major printed encyclopedias [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] – the quality of individual articles
on different levels of maturity cannot be ensured this way. Since Wikipedia is work in
progress, there needs to be a way to determine the flaws of any given article in order
to provide readers with an estimation of the article’s quality level and give authors a
Flaw Description
Advert The article appears to be written like an advertisement and should be rewritten from
a neutral point of view.
      </p>
      <p>Empty section The article has at least one section that is empty.</p>
      <p>No footnotes The article includes a list of references, related reading or external links, but its
sources remain unclear because it lacks inline citations.</p>
      <p>Notability The article does not meet the general notability guideline.</p>
      <p>Original research The article may contain original research and should be improved by verifying the
claims made and adding references.</p>
      <p>Orphan The article is an orphan, as no other articles link to it.</p>
      <p>Primary sources The article relies on references to primary sources or sources affiliated with the
subject and does not contain sufficient citations from reliable and independent sources.</p>
      <p>Refimprove The article needs additional citations for verification.</p>
      <p>Unreferenced The article does not cite any references or sources.</p>
      <p>Wikify The article needs to be wikified, i.e. internal and external links should be added.</p>
      <p>Untagged Article without any cleanup templates.</p>
      <p>Training
1 109
guide leading them to the most pressing problems in the encyclopedia. In this paper,
we present FlawFinder, a modular system for automatically predicting quality flaws in
unseen Wikipedia articles. It competed in the inaugural edition of the Quality Flaw
Prediction Task at the PAN Challenge 2012 and achieved the best precision of all systems
and the second place in terms of recall and F1-score.
2</p>
    </sec>
    <sec id="sec-3">
      <title>Task Definition</title>
      <p>
        As an integral part of Wikipedia’s quality assurance process, authors and articles
maintainers use cleanup templates to mark articles that do not meet Wikipedia’s quality
requirements. Adding such a template posts an info message to the article in order to
make readers aware of the existing problems. The article is furthermore added to the
respective cleanup category in order to foster article maintenance. Anderka et al. [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]
provide a comprehensive breakdown of the cleanup templates in the English Wikipedia.
In this task of the PAN Challenge, cleanup templates are understood as indicators for
quality flaws. Given a sample of articles that have been tagged with a cleanup template
t thus marking it with a quality flaw f , it has to be decided whether or not an unseen
article suffers from f . The task targets the prediction of ten important quality flaws for
which the organizers provide a training and a test corpus. The training corpus consists
of 154,116 articles extracted from the English Wikipedia snapshot from January 4th,
20122 which are labeled with the respective quality flaws. The test corpus contains a
balanced number of flawed and untagged articles and has a total size of 19,019
documents. Table 1 shows the flaw definitions as they are stated on the template information
pages and lists the numbers of articles for each flaw in the training and the test corpus.
      </p>
      <sec id="sec-3-1">
        <title>2 http://dumps.wikimedia.org/enwiki/20120104</title>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Related Work</title>
      <p>Quality assessment is a complex issue, since information quality (IQ) is a
multidimensional concept that cannot be captured by a single, universal model. Many IQ models
have been developed to fit the individual needs of different types of data, applications
and users. Successful quality assurance is a particularly challenging issue in open,
collaborative environments, since regulatory authorities are less pronounced than in
conventional work environments and the concept of quality that the individual collaborators
have differs greatly across the community.</p>
      <p>
        From an information scientific perspective, Stvilia et al. [
        <xref ref-type="bibr" rid="ref22">22</xref>
        ] developed a
framework for information quality assessment and measurement that is supposed to serve
as a guide for developing information quality measurement models for many different
settings. The authors systematically identified 22 information quality dimensions in the
categories intrinsic quality, relational and contextual quality, and reputational quality.
They furthermore provide metrics for automatically or semi-automatically measuring
the quality along nine of the 22 dimensions. In later work [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ], the authors analyzed
the organization of information quality assurance work in Wikipedia by analyzing 60
discussion pages in order to identify the types of IQ problems that are most discussed
by the community along with related causal factors. Building on this, Wu et al. [
        <xref ref-type="bibr" rid="ref26">26</xref>
        ]
developed a framework for automatic quality assessment based on a set of 28 metrics.
      </p>
      <p>
        Yaari et al. [
        <xref ref-type="bibr" rid="ref27">27</xref>
        ] performed a user study asking 64 people to assess the quality of five
articles from the Hebrew Wikipedia in order to find the criteria which assist users in
determining that an article is of high or low quality. Hereby, the authors rely both on the
article page and the article revision history. They found 21 criteria, which they divide
into measurable criteria, such as article length or number of edits, and non-measurable
criteria, such as coverage or writing style. They furthermore analyze the
discriminativeness of each criterion for articles rated as high quality and articles of low quality.
      </p>
      <p>
        A growing body of work addresses automatic quality assessment in Wikipedia.
The majority of these works targets the prediction of community created quality
labels that identify good articles (GA) and featured articles (FA) (i.e. very good articles)
[
        <xref ref-type="bibr" rid="ref16 ref17 ref24">24,17,16</xref>
        ]. In contrast to other labels, which can be assigned by any user, articles have
to be nominated and reviewed in order to obtain GA or FA status. In other works, the
WikiProjects article quality grading scheme3 has been used as an additional set of gold
standard labels [
        <xref ref-type="bibr" rid="ref13 ref14 ref15 ref21 ref5">15,21,5,14,13</xref>
        ].
      </p>
      <p>The major problem with approaches using these community created quality labels
as a gold standard for quality assessment is the small fraction of articles that are marked
with these quality tags. As of August 2012, only 0:089% of all articles in the English
Wikipedia are marked as featured and 0:39% are marked as good. In turn, the
WikiProject quality classification only applies to selected topics and has different assessment
criteria depending on the individual WikiProject4.</p>
      <p>
        In order to shed light on the quality and problems of articles not tagged with quality
labels, Anderka et al. thus tackle the task from a different direction and use cleanup
templates as indicators for quality flaws. In [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], they provide a breakdown of quality
3 http://en.wikipedia.org/wiki/WP:ASSESS\#Grades
4 http://en.wikipedia.org/wiki/WP:PROJ
flaws in the English Wikipedia, while they evaluate their effectiveness for quality
assurance in [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] by analyzing the evolution of quality flaw markers over time. Finally, in [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ],
the authors automatically identify quality flaws by predicting the cleanup templates in
unseen articles, which is also the goal of the Quality Flaw Detection task in the PAN
challenge.
4
      </p>
    </sec>
    <sec id="sec-5">
      <title>System Architecture</title>
      <p>
        FlawFinder has been implemented as a modular and highly flexible system based on
the Unstructured Information Management Architecture (UIMA) [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. UIMA enables
applications to be decomposed into reusable components which can be freely arranged
into processing pipelines. We use Natural Language Processing components from the
open-source NLP toolkit DKPro5, which provides solutions for many recurring tasks
like tokenization or sentence splitting and offers UIMA integration for state-of-the-art
NLP components such as the Stanford CoreNLP library. As a runtime environment,
FlawFinder uses the DKPro Lab [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], a lightweight framework that allows to combine
independent NLP pipelines into one integrated and highly configurable system.
      </p>
      <p>FlawFinder consists of five components, a corpus reader, a preprocessor, a feature
extraction unit, a module for training and classification, and a report writer.</p>
      <p>
        Rather than reading the provided training data directly, the corpus reader accesses
the articles from our own Wikipedia database, since it offers a wider range of meta data
such as the article link structure and information about the article revision history. The
database has been created from the same Wikipedia data dump as the provided
training corpus and the cleanup templates which are supposed to be predicted are removed.
Access to the data is achieved using JWPL [
        <xref ref-type="bibr" rid="ref28">28</xref>
        ], a database driven open-source API
for accessing Wikipedia, and the Wikipedia Revision Toolkit [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ], a package that
provides easy access to the article revision history. The corpus reader identifies the relevant
articles using the page ids that are provided in the training corpus.
      </p>
      <p>
        The preprocessor module uses DKPro components for sentence splitting,
tokenization, stop word annotation and named entity recognition. Other DKPro components can
easily be added to the pipeline. For parsing the MediaWiki markup of the Wikipedia
articles, we use the SWEBLE MediaWiki parser [
        <xref ref-type="bibr" rid="ref6 ref7">6,7</xref>
        ], which produces an object model
of the article structure.
      </p>
      <p>
        The feature extraction component has been implemented using ClearTK [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ], a
UIMA-based framework for developing statistical NLP components. It offers interfaces
for creating feature extractors that can be used independently from the utilized
machine learning algorithm. This enables to create a highly configurable feature extraction
pipeline that does not restrict the downstream components for training and
classification.
5
      </p>
    </sec>
    <sec id="sec-6">
      <title>Features</title>
      <p>With our feature set, we aim at modeling the aspects of the article that are most likely to
indicate the presence or absence of a quality flaw. Overall, we extract 31 feature types</p>
      <sec id="sec-6-1">
        <title>5 http://code.google.com/p/dkpro-core-asl/</title>
        <p>which can be subdivided into seven categories described in this section. A systematic
overview can be found in Table 2.</p>
        <p>Structural Features are supposed to capture basic structural properties and surface
features of the Wikipedia articles. We use the SWEBLE parser for parsing the Wiki
markup and create a Wikitext Object Model (WOM) representation of the article. From
this WOM, we extract all article sections along with their headers. We use the number
of sections, the mean length of the section texts and the number of empty sections as
features. Furthermore, we extract a plain text representation without Wiki markup from
the WOM and calculate the ratio of markup to plain text as a fourth structural feature.
Reference Features capture aspects regarding the use of citations in the article. There
are basically two types of references, footnote style references and bibliography style
references. Footnote style references are marked with &lt;ref&gt; . . . &lt;nref&gt; tags directly
within the text and are automatically listed at the bottom of the page6. Bibliography
style references are manually listed at the end of the article, usually in the References
section. They can either be created as manually formatted list items or can be marked
with cite or citation tags for automatic reference formatting. First, we check
whether manually created bibliography items exist in the References section and how
many elements it contains. Then we count the number of all inline references in the
article and determine their average number per sentence. Finally, we determine the
ratio of the number of all references to the length of the article. Analogously to lists of
references, it is possible to define lists of explanatory notes using the ffnotelistgg
template. It is usually placed in the Notes section and gathers all occurrences of
explanatory notes which are defined within the text with efn templates. We extract this
information in the same way as the references.</p>
        <p>Network Features reflect the connections of an article within the whole network of
Wikipedia articles and to external resources. Since the number of inbound links (i.e. the
number of times other articles link to a given article) cannot be determined by parsing
the articles in the provided corpora alone, we use the respective information from our
JWPL Wikipedia database. When creating a new Wikipedia database from a Wikipedia
data dump, JWPL automatically parses the articles using the JWPL Wikitext parser and
stores the link information in the database. For each article, we determine the number of
wiki-internal inbound links, wiki-internal outbound links and links to resources outside
of Wikipedia.</p>
        <p>
          Named Entity Features capture the number of named entities in the article. We use
the Stanford Named Entity Recognizer [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ] using the 3-class model with distributional
similarity features7 for tagging all entities of the types Person, Organization and
Location. We use both the overall named entity counts and the average number of named
entities per sentence as features.
6 Depending on the setup of the page, the references might appear in different sections such as
        </p>
        <p>
          References, Notes or Citations.
7 http://nlp.stanford.edu/software/CRF-NER.shtml
Revision-based Features are based on meta data derived from the article revision
history. We use the Wikipedia Revision Toolkit [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ] to determine the number of revisions
for each article. Furthermore, we count the number of unique users that edited the page
in the past. Since this number also includes anonymous users, which might be counted
several times due to changing IP addresses, we additionally determine the number of
unique registered users. Finally, we capture the age of the article in days.
Lexical Features are extracted from the plain article text that we obtain from the
WOM. Any Wiki markup is removed with the exception of internal and external links.
All links are replaced with a generic EXPLICITLINK label. Furthermore, we perform
stopword filtering using the stopword list from the snowball stemmer8, which we
augmented with punctuation marks. We extract all token-unigram, bigrams and trigrams
from each article and disregard any ngrams with a frequency lower than 5 across the
corpus. This cutoff value was determined empirically during the parameter optimization
run. We found that a value of 5 was optimal for all flaws.
        </p>
        <p>
          Other Features include character counts, token counts and sentence counts per article.
Furthermore, we measure the discussion activity by means of counting the number of
individual discussion topics on the Talk page associated with the article. According
to Ferschke et al. [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ], we regard each titled section on the Talk page as an individual
topic. We refrain from using lexical features from Talk pages, since the Talk page could
explicitly discuss the cleanup tags that are supposed to be predicted and would thus lead
to biased results.
6
        </p>
      </sec>
    </sec>
    <sec id="sec-7">
      <title>Classification Approach</title>
      <p>We regard the problem of quality flaw prediction as a binary classification task. For
each flaw, we create a training set that contains a balanced number of positive and
negative instances. We use the untagged articles provided in the training corpus as negative
instances and select a random subset of the same size as the set of flawed articles.</p>
      <p>
        We use two machine learning algorithms from the Mallet machine learning toolkit
[
        <xref ref-type="bibr" rid="ref18">18</xref>
        ], a Naive Bayes classifier and C4.5 decision trees. For efficiently training the Naive
Bayes classifier, we perform unsupervised discretization of numeric features using equal
interval binning as suggested in [
        <xref ref-type="bibr" rid="ref25">25</xref>
        ], since the algorithm does not cope well with real
valued features and the Mallet toolkit is not able to perform feature discretization
automatically. The decision trees were trained using adaptive boosting with 100 rounds and
were limited to the depth of five due to memory restrictions.
7
      </p>
    </sec>
    <sec id="sec-8">
      <title>Evaluation</title>
      <p>We experimentally derived the best configuration for each flaw in a parameter
optimization run, which consists of several training iterations on the same reduced training
8 http://snowball.tartarus.org/algorithms/english/stop.txt
dvert
A</p>
      <p>ptySection
Em
otability
N</p>
      <p>esearch
lR
rigina
O
rove
p
efim
R
referenced
n
U
oFootnotes
N</p>
      <p>rces
arySou
rim
P
.006
Section. For other flaws, the feature ranking is more interesting. For Original Research,</p>
      <p>OriginalResearch
NB
250
nreferenced
U
C45
1000
for instance, the best ranked feature is the discussion activity. This suggests that the
discussion content might also be informative for identifying this flaw and that the Talk
pages should be further exploited for feature extraction. For the flaw Advert, the most
discriminative non-lexical features are links pointing to external resources. Taking into
account the context of these external links could further improve the classification
performance. It has to be noted that the utility scores cannot be directly compared across
flaws. They are only significant as indicators for the ranking within a given flaw.
Lexical features are most effective for the flaws Advert, Notability and Original Research,
while the other flaws only show little performance gain when adding ngrams to the
feature sets. This is to be expected, since structural flaws such as Empty Section or Wikify
are not expressed by the vocabulary but by the article structure and the markup.
We carried out a detailed error analysis for each flaw in order to identify the main
types of errors made by the classifier. The numbers of false positive and false negative
instances according to the evaluation on the training set can be seen in Table 3.
(a) (a) Training Set
(b) (b) Test Set</p>
      <p>The 71 false positives for Advert mostly contain articles about institutions such
as universities or government bodies. The descriptions of these institutions resemble
the descriptions of companies. However, for companies the same way of writing is
more often regarded as advert-style by Wikipedia users than for public institutions. The
94 false negatives are short articles with an average length of 690 tokens. Many of
them do not exceed 250 tokens. These articles do not contain enough text to be reliably
classified, since the Advert flaw largely relies on lexical features.</p>
      <p>The 200 false positives for the Notability flaw contain a large number of pages about
individual persons, organizations, books or movies. Even Wikipedia users have
difficulties to judge whether a specific subject qualifies for being included in the encyclopedia.
Without world knowledge about the article topic, a reliable judgment cannot be carried
out. Furthermore, the notability criteria in Wikipedia are highly disputed in the
community and are not interpreted consistently by all users9. For a large fraction of the 63 false
negatives, the Notability template has been removed in newer revisions without a major
change of the content (for example in the article on the Bigfoot Trail10 or the Hong
Kong Gold Coast11). This suggests that the template has been incorrectly assigned to
the training article by the Wikipedia users.</p>
      <p>Many of the 158 false positives for the flaw Unreferenced did actually have no
references at all or just contained an external links section. This suggests that the
classifier correctly identified the problem, but the templates were missing in the article.
The 51 false negatives are subject to the same problem. In this case, the Unreferenced
9 http://en.wikipedia.org/wiki/Deletionism_and_inclusionism_in_</p>
      <p>Wikipedia
10 http://en.wikipedia.org/w/index.php?title=Bigfoot_Trail&amp;diff=
502614831&amp;oldid=407680228
11 http://en.wikipedia.org/w/index.php?title=Hong_Kong_Gold_</p>
      <p>Coast&amp;diff=502889724&amp;oldid=461337252
template has been used for marking articles that suffer from the Refimprove flaw. For
example, in the corpus version of the article “Robert Hartmann”, the used template was
Unreferenced but it has been changed to the correct Refimprove template in a
later version12. Similar confusion can be observed in the misclassified instances of the
other flaws related to references and citations, such as Original Research, No Footnotes,
and Primary Sources. This suggests that the templates should be better defined and
consolidated into fewer categories. Other false negative instances for Unreferenced are due
to the inline usage of the templates. According to the flaw definition, the template
applies to articles that do not have any references. However, when used inline in the form
ffUnreferencedjsectiongg, it only refers to the section it appears in, while the
rest of the article may cite references13. In order to account for this, each section has to
be classified separately instead of the article as a whole.</p>
      <p>According to the instructions provided by the challenge organizers, the Orphan
template is to be assigned to any article that “has fewer than three incoming links”.
Therefore, we use the feature inlinks &lt; 3, which proved to be the most discriminative
one for this flaw. However, the template description in Wikipedia states that articles
tagged as Orphan have “zero incoming links from other articles”14. This discrepancy
accounts for most of the false negatives, which have one or two incoming links from
other articles. Removing the above mentioned feature and using the inlink counts alone
can solve this issue.</p>
      <p>The false positives for the flaw Wikify mainly consist of short articles. Wikification
is not an issue commonly addressed in short articles, and it becomes more important as
the article grows. The network and surface features used by the classifier consequently
do not work well with short articles.</p>
      <p>No regularities could be found for the misclassifications of the flaw Empty section.
It is likely that the main reason for misclassification are parsing errors. We found that
sections containing mainly structured elements such as tables, infoboxes or expanded
templates are particularly hard to cope with.
8</p>
    </sec>
    <sec id="sec-9">
      <title>Discussion</title>
      <p>
        The work by Anderka et al. [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], in which the authors analyze the evolution of cleanup
templates, is a step towards better understanding collaboratively created cleanup tags
and how they are utilized by the community. However, the reliability of these labels
still remains to be evaluated. Future work has to address the issue of annotation quality
in a controlled annotation study reporting the agreement of the annotators with the
community created gold standard. The results of this study will reveal the upper bound for
an automatic classification task. Only then will it be possible to draw sound conclusions
from analyses based on this data and to put classification results into perspective.
12 http://en.wikipedia.org/w/index.php?title=Robert_
      </p>
      <p>Hartmann&amp;diff=474150162&amp;oldid=466987161
13 for example in http://en.wikipedia.org/w/index.php?title=White_</p>
      <p>Oleander_%28film%29&amp;oldid=463206537
14 http://en.wikipedia.org/wiki/Wikipedia:Orphan#Criteria</p>
      <p>
        In this work, we chose a binary classification approach for predicting quality flaw
labels. While binary classification is supported by many mature algorithms for which
high-performance implementations are readily at hand, it poses the problem of selecting
discriminative negative instances. This issue has been critically discussed by Anderka
et al. [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. Even though we found the classification performance to be good when using
a random sample of untagged articles as negative instances, a more sophisticated
selection technique might improve the results even more. Since no articles are available that
are explicitly tagged as not suffering from a certain flaw, the removal of a flaw marker
might indicate that a specific article revision does no longer suffer from the same flaw.
Consequently, article revisions that have just lost a specific flaw marker might serve as
more discriminative negative instances for training a binary classifier for the flaw.
      </p>
    </sec>
    <sec id="sec-10">
      <title>Acknowledgments</title>
      <p>We thank Artem Vovk and Michael Kutschke for implementing and testing parts of
the software. This work has been supported by the Volkswagen Foundation as part
of the Lichtenberg-Professorship Program under grant No. I/82806, and by the
Hessian research excellence program “Landes-Offensive zur Entwicklung
Wissenschaftlich-o¨ konomischer Exzellenz” (LOEWE) as part of the research center “Digital
Humanities”</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Anderka</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stein</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>A Breakdown of Quality Flaws in Wikipedia</article-title>
          . In: 2nd Joint WICOW/AIRWeb Workshop on Web Quality. pp.
          <fpage>11</fpage>
          -
          <lpage>18</lpage>
          . Lyon, France (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Anderka</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stein</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Busse</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>On the Evolution of Quality Flaws and the Effectiveness of Cleanup Tags in the English Wikipedia</article-title>
          .
          <source>In: Wikipedia Academy</source>
          <year>2012</year>
          . Berlin, Germany (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Anderka</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stein</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lipka</surname>
          </string-name>
          , N.:
          <article-title>Predicting Quality Flaws in User-generated Content: The Case of Wikipedia</article-title>
          .
          <source>In: 35th International ACM Conference on Research and Development in Information Retrieval (SIGIR 12)</source>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4. de Castilho,
          <string-name>
            <given-names>R.E.</given-names>
            ,
            <surname>Gurevych</surname>
          </string-name>
          ,
          <string-name>
            <surname>I.</surname>
          </string-name>
          :
          <article-title>A Lightweight Framework for Reproducible Parameter Sweeping in Information Retrieval</article-title>
          .
          <source>In: Proceedings of the Workshop on Data Infrastructures for Supporting Information Retrieval Evaluation</source>
          . pp.
          <fpage>7</fpage>
          -
          <lpage>10</lpage>
          . Glasgow, UK (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Dalip</surname>
            ,
            <given-names>D.H.</given-names>
          </string-name>
          , Gonc¸alves,
          <string-name>
            <given-names>M.A.</given-names>
            ,
            <surname>Cristo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            ,
            <surname>Calado</surname>
          </string-name>
          ,
          <string-name>
            <surname>P.</surname>
          </string-name>
          :
          <article-title>Automatic Quality Assessment of Content Created Collaboratively by Web Communities</article-title>
          .
          <source>In: Proceedings of the Joint International Conference on Digital Libraries</source>
          . pp.
          <fpage>295</fpage>
          -
          <lpage>304</lpage>
          . Austin, TX, USA (Jun
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Dohrn</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Riehle</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Design and implementation of the Sweble Wikitext parser</article-title>
          .
          <source>In: Proceedings of the 7th International Symposium on Wikis and Open Collaboration</source>
          . pp.
          <fpage>72</fpage>
          -
          <lpage>81</lpage>
          . Mountain View, CA, USA (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Dohrn</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Riehle</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Wom: An object model for wikitext</article-title>
          .
          <source>Tech. rep.</source>
          , University of Erlangen, Erlangen, Germany (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Ferrucci</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lally</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>UIMA: An Architectural Approach to Unstructured Information Processing in the Corporate Research Environment</article-title>
          .
          <source>Natural Language Engineering</source>
          <volume>10</volume>
          (
          <issue>3-4</issue>
          ),
          <fpage>327</fpage>
          -
          <lpage>348</lpage>
          (
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Ferschke</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gurevych</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chebotar</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          :
          <article-title>Behind the Article: Recognizing Dialog Acts in Wikipedia Talk Pages</article-title>
          .
          <source>In: Proceedings of the 13th Conference of the European Chapter of the Association for Computational Linguistics</source>
          . pp.
          <fpage>777</fpage>
          -
          <lpage>786</lpage>
          . Avignon, France (
          <year>Apr 2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Ferschke</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zesch</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gurevych</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          :
          <article-title>Wikipedia Revision Toolkit: Efficiently Accessing Wikipedia's Edit History</article-title>
          . In:
          <article-title>Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies</article-title>
          .
          <source>System Demonstrations</source>
          . pp.
          <fpage>97</fpage>
          -
          <lpage>102</lpage>
          . Portland,
          <string-name>
            <surname>OR</surname>
          </string-name>
          , USA (Jun
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Finkel</surname>
            ,
            <given-names>J.R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Grenager</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Manning</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Incorporating non-local information into information extraction systems by Gibbs sampling</article-title>
          .
          <source>In: Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics</source>
          . pp.
          <fpage>363</fpage>
          -
          <lpage>370</lpage>
          . Association for Computational Linguistics, Morristown, NJ, USA (Jun
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Giles</surname>
          </string-name>
          , J.:
          <article-title>Internet encyclopaedias go head to head</article-title>
          .
          <source>Nature</source>
          <volume>438</volume>
          (
          <issue>7070</issue>
          ),
          <volume>900</volume>
          (
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Han</surname>
            ,
            <given-names>J</given-names>
          </string-name>
          .,
          <string-name>
            <surname>Fu</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Web Article Quality Assessment in Multi-dimensional Space</article-title>
          .
          <source>In: Proceedings of the 12th International Conference on Web-age Information Management</source>
          , pp.
          <fpage>214</fpage>
          -
          <lpage>225</lpage>
          . Lecture Notes in Computer Science, Wuhan, China (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Han</surname>
            ,
            <given-names>J</given-names>
          </string-name>
          .,
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jiang</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Probabilistic Quality Assessment Based on Articles Revision History</article-title>
          .
          <source>In: Proceedings of the 22nd International Conference on Database and Expert Systems Applications</source>
          . pp.
          <fpage>574</fpage>
          -
          <lpage>588</lpage>
          . Toulouse, France (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Hu</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lim</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sun</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lauw</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vuong</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>Measuring article quality in wikipedia: models and evaluation</article-title>
          .
          <source>In: Proceedings of the 16th ACM Conference on Information and Knowledge Management</source>
          . pp.
          <fpage>243</fpage>
          -
          <lpage>252</lpage>
          . CIKM '
          <volume>07</volume>
          , Lisbon, Portugal (
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Javanmardi</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lopes</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Statistical measure of quality in Wikipedia</article-title>
          .
          <source>In: Proceedings of the First Workshop on Social Media Analytics - SOMA '10</source>
          . pp.
          <fpage>132</fpage>
          -
          <lpage>138</lpage>
          . Washington DC, DC, USA (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Lipka</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stein</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>Identifying featured articles in wikipedia</article-title>
          .
          <source>In: Proceedings of the 19th International Conference on World Wide Web</source>
          . p.
          <fpage>1147</fpage>
          .
          <string-name>
            <surname>Raleigh</surname>
            ,
            <given-names>NC</given-names>
          </string-name>
          , USA (Apr
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>McCallum</surname>
            ,
            <given-names>A.K.</given-names>
          </string-name>
          :
          <article-title>MALLET: A Machine Learning for Language Toolkit (</article-title>
          <year>2002</year>
          ), http://mallet.cs.umass.edu
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19. Mitchell, T.:
          <article-title>Machine Learning. McGraw-Hill Education (ISE Editions), 1st edn</article-title>
          . (
          <year>1997</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>Ogren</surname>
            ,
            <given-names>P.V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wetzler</surname>
            ,
            <given-names>P.G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bethard</surname>
            ,
            <given-names>S.:</given-names>
          </string-name>
          <article-title>ClearTK: A UIMA toolkit for statistical natural language processing</article-title>
          .
          <source>In: Towards Enhanced Interoperability for Large HLT Systems: UIMA for NLP workshop at Language Resources and Evaluation Conference (LREC)</source>
          (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <surname>Rassbach</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pincock</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mingus</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>Exploring the Feasibility of Automatically Rating Online Article Quality</article-title>
          .
          <source>Proceedings of the 9th Joint Conference on Digital Libraries</source>
          (
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          22.
          <string-name>
            <surname>Stvilia</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gasser</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Twidale</surname>
            ,
            <given-names>M.B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Smith</surname>
            ,
            <given-names>L.C.</given-names>
          </string-name>
          :
          <article-title>A Framework for Information Quality Assessment</article-title>
          .
          <source>Journal of the American Society for Information Science</source>
          <volume>58</volume>
          (
          <issue>12</issue>
          ),
          <fpage>1720</fpage>
          -
          <lpage>1733</lpage>
          (
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          23.
          <string-name>
            <surname>Stvilia</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Twidale</surname>
            ,
            <given-names>M.B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Smith</surname>
            ,
            <given-names>L.C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gasser</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>Information Quality Work Organization in Wikipedia</article-title>
          .
          <source>Journal of the American Society for Information Science and Technology</source>
          <volume>59</volume>
          (
          <issue>6</issue>
          ),
          <fpage>983</fpage>
          -
          <lpage>1001</lpage>
          (
          <year>Apr 2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          24.
          <string-name>
            <surname>Wilkinson</surname>
            ,
            <given-names>D.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Huberman</surname>
            ,
            <given-names>B.A.</given-names>
          </string-name>
          :
          <article-title>Cooperation and Quality in Wikipedia</article-title>
          .
          <source>In: Proceedings of the 2007 International Symposium on Wikis</source>
          . pp.
          <fpage>157</fpage>
          -
          <lpage>164</lpage>
          . Montreal, Canada (
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          25.
          <string-name>
            <surname>Witten</surname>
            ,
            <given-names>I.H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Frank</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hall</surname>
            ,
            <given-names>M.A.</given-names>
          </string-name>
          :
          <article-title>Data mining : Practical Machine Learning Tools and Techniques</article-title>
          . Morgan Kaufmann, Burlington, MA (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          26.
          <string-name>
            <surname>Wu</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhu</surname>
            ,
            <given-names>Q.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhao</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zheng</surname>
          </string-name>
          , H.:
          <article-title>Mining the Factors Affecting the Quality of Wikipedia Articles</article-title>
          .
          <source>In: Proceedings of the 2010 International Conference of Information Science and Management Engineering</source>
          . pp.
          <fpage>343</fpage>
          -
          <lpage>346</lpage>
          (
          <year>Aug 2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          27.
          <string-name>
            <surname>Yaari</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Baruchson-Arbib</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bar-Ilan</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          :
          <article-title>Information quality assessment of community generated content: A user study of Wikipedia</article-title>
          .
          <source>Journal of Information Science</source>
          <volume>37</volume>
          (
          <issue>5</issue>
          ),
          <fpage>487</fpage>
          -
          <lpage>498</lpage>
          (
          <year>Aug 2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          28.
          <string-name>
            <surname>Zesch</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          , Mu¨ ller,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Gurevych</surname>
          </string-name>
          ,
          <string-name>
            <surname>I.</surname>
          </string-name>
          :
          <article-title>Extracting Lexical Semantic Knowledge from Wikipedia and Wiktionary</article-title>
          .
          <source>In: Proceedings of the 6th International Conference on Language Resources and Evaluation</source>
          . Marrakech,
          <string-name>
            <surname>Morocco</surname>
          </string-name>
          (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>