<!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>Open Source Tesseract in Re-OCR of Finnish Fraktur from 19th and Early 20th Century Newspapers and Journals - Collected Notes on Quality Improvement</article-title>
      </title-group>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>The National Library of Finland</institution>
          ,
          <addr-line>DH projects Saimaankatu 6, 50 100 Mikkeli</addr-line>
          ,
          <country country="FI">Finland</country>
        </aff>
      </contrib-group>
      <fpage>0000</fpage>
      <lpage>0003</lpage>
      <abstract>
        <p>This paper presents work that has been carried out in the National Library of Finland to improve optical character recognition (OCR) quality of a Finnish historical newspaper and journal collection 1771-1910. Work and results reported in the paper are based on a 500 000 word ground truth (GT) sample of the Finnish language part of the whole collection. The sample has three different parallel parts: a manually corrected ground truth version, original OCR with ABBYY FineReader v. 7 or v. 8, and an ABBYY FineReader v. 11 reOCRed version. Based on this sample and its page image originals we have developed a re-OCRing process using the open source software package Tesseract1 v. 3.04.01. Our methods in the re-OCR include image preprocessing techniques, usage of morphological analyzers and a set of weighting rules for resulting candidate words. Besides results based on the GT sample we present also results of re-OCR for a 29 year period of one newspaper of our collection, Uusi Suometar. The paper describes the results of our re-OCR process including the latest results. We also state some of the main lessons learned during the development work.</p>
      </abstract>
      <kwd-group>
        <kwd>OCR</kwd>
        <kwd>historical newspapers</kwd>
        <kwd>Tesseract</kwd>
        <kwd>Finnish</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        The National Library of Finland has digitized historical newspapers and journals
published in Finland between 1771 and 1929 and provides them online [
        <xref ref-type="bibr" rid="ref1 ref2">1-2</xref>
        ]. The last
decade of the open collection, 1920–1929, was released in early 2018. The collection
contains approximately 7.45 million freely available pages primarily in Finnish and
Swedish. The total amount of pages on the web is over 14.5 million, and about half of
them are in restricted use due to copyright restrictions. The National Library’s Digital
Collections are offered via the digi.kansalliskirjasto.fi web service, also known as
Digi. An open data package of the collection’s newspapers and journals from period
1771 to 1910 has been released in early 2017 [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ].
1 https://github.com/tesseract-ocr
      </p>
      <p>
        When originally non-digital materials, e.g. old newspapers and books, are
digitized, the process involves first scanning of the documents which results in image files.
Out of the image files one needs to sort out texts and possible non-textual data, such
as photographs and other pictorial representations. Texts are recognized from the
scanned pages with Optical Character Recognition (OCR) software. OCRing for
modern prints and font types is considered a resolved problem, that usually yields
high quality results, but results of historical document OCRing are still far from that
[
        <xref ref-type="bibr" rid="ref3">3</xref>
        ].
      </p>
      <p>
        Newspapers of the 19th and early 20th century were mostly printed in the Gothic
(Fraktur, blackletter) typeface in Europe. Fraktur is used heavily in our data, although
also Antiqua is common and both fonts can be used in same publication in different
parts. It is well known that the Fraktur typeface is especially difficult to recognize for
OCR software. Other aspects that affect the quality of OCR recognition are the
following [
        <xref ref-type="bibr" rid="ref3 ref4 ref5">3–5</xref>
        ]:
●
●
●
●
●
●
quality of the original source and microfilm
scanning resolution and file format
layout of the page
OCR engine training
unknown fonts
etc.
      </p>
      <p>
        Due to these difficulties scanned and OCRed document collections have a varying
amount of errors in their content. A quite typical example is The 19th Century
Newspaper Project of the British Library [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]: based on a 1% double keyed sample of the
whole collection Tanner et al. report that 78% of the words in the collection are
correct. This quality is not good, but quite common to many comparable collections. The
amount of errors depends heavily on the period and printing form of the original data.
Older newspapers and magazines are more difficult for OCR; newspapers from the
early 20th century are easier (cf. for example data of Niklas [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ], that consists of a 200
year period of The Times of London from 1785 to 1985). There is no exact measure
of the amount of errors that makes OCRed material useful or less useful for some
purpose and the use purposes and research tasks of the users of digitized material vary
hugely [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. A linguist who is interested in the forms of words needs as errorless data
as possible; a historian who interprets texts on a broader level may be satisfied with
text data that has more errors. Anyhow, very high error rate of texts may cause serious
discomfort and squeamishness for researchers as e.g. article of Jarlbrink and Snickars
about quality of one OCRed Swedish newspaper, Aftonbladet 1830–1862, shows [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ].
      </p>
      <p>
        Ways to improve quality of OCRed texts are few, if total rescanning is out of
question, as it usually is due to labor costs. Improvement can be achieved with three
principal methods: manual correction with different aids (e.g. editing software), re-OCRing
or algorithmic post-correction [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. These methods can also be mixed. We don’t believe
that manual correction e.g. with crowd sourcing is suitable for a large collection of a
small language with small population: there just is not enough people to perform
crowdsourcing. Also post correction’s capabilities are limited: errors of one to two
characters can be corrected, but errors in historical OCR data do not limit to these. It
seems that harder errors are still beyond performance of post correction algorithms
[
        <xref ref-type="bibr" rid="ref10 ref11">10-11</xref>
        ].
272
      </p>
      <p>Due to amount of data we have chosen re-OCRing with Tesseract v. 3.04.01 as
our main method for improving the quality of our collection. In the rest of the paper
we describe the results we have achieved so far and discuss lessons learned. In section
two we describe our initial results, in section three improvements made in the re-OCR
process and in section four the latest re-OCR results. Section five concludes the paper
with some lessons that we have learned during the process.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Results – Part I</title>
      <p>
        Our re-OCR process has been described thoroughly in [
        <xref ref-type="bibr" rid="ref12 ref13">12–13</xref>
        ]. As its main parts are
unchanged, we describe it only briefly here. The re-OCRing process consists of four
parts: 1) image preprocessing of page images using five different techniques: this
yields better quality images for the OCR, 2) Tesseract OCR 3.04.01, 3) choosing of the
best candidate from Tesseract’s output and old ABBYY FineReader data and 4)
transformation of Tesseract’s output to ALTO format. We have developed a new Finnish
Fraktur model for Tesseract using an existing German Fraktur model as a starting
point.
      </p>
      <p>
        We have evaluated the results of the re-OCR along the development process with
different measures using our ground truth data of about 500 000 words [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]. This
parallel data consists of proof read version of the data, current ABBYY FineReader
OCR v.7/8, Tesseract 3.04.01 OCR and ABBYY FineReader v.11 OCR.
2.1
      </p>
      <sec id="sec-2-1">
        <title>Precision and Recall</title>
        <p>
          Measurement of OCR improvement does not have any real standard measure, and for
this reason we have used several measures to be able to evaluate improvement of the
process. Precision and recall are standard measures used in information retrieval, and
they can also be applied to analysis of re-OCR results [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ]. When we applied recall,
precision and F-score to the data, we got recall of 0.72, precision of 0.73 and F-score
of 0.73. Combined optimal OCR results of Tesseract and ABBYY FineReader v. 11
would give recall of 0.81, precision of 0.95, and F-score of 0.88. The latter figures
show that possibility of using several OCR engines would benefit re-OCRing, as has
been stated in research literature [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ]. Unfortunately we do not have access to several
new OCR engines in our final re-OCR.
        </p>
        <p>Precision, recall and their combination, F-score, are useful figures, but it also
benefits to take a closer look at the numbers behind the scores. As we analyzed the
output of the P/R analysis further we noticed the following. Number of erroneous
words in the data of was 126 758 and errorless 345 145. Re-OCR corrected 90 877 of
errors (true positives, 71.7% of errors) and left 35 881 uncorrected (false negatives,
28.3% of errors). The OCR process also produced 32 953 new errors to the data (false
positives). In general it seems, that the recall of the re-OCR with regards to erroneous
words is satisfactory, but precision is low, as the process produces quite a lot of new
errors. This harms the overall result. On the other hand, many of the errors were only
errors in punctuation: if these were discarded, the results were slightly better.
Although every character counts for algorithms that perform evaluation, not every
difference in character is of equal importance for human understanding of the output
results. Assuming that form Porvoo would be the right result, the three versions
Bor273
woo/Porwo/Worwoo that are two characters away from it are not on equal status of
intelligibility: the last one would probably be the hardest to understand even in
context.
2.2</p>
      </sec>
      <sec id="sec-2-2">
        <title>Character Error and Word Error Rate</title>
        <p>
          Two other commonly used evaluation measures for OCR output are character error
rate, CER, and word error rate, WER [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ]. CER is defined as
and it employs the total number n of characters and the minimal number of character
insertions i, substitutions s and deletions d required to transform the reference text
into the OCR output.
        </p>
        <p>
          Word error rate WER is defined as
where nw is the total number of words in reference text, iw is the minimal number of
insertions, sw is number of substitutions and dw number of deletions on word level to
obtain the reference text. Smaller WER and CER values mean better quality. Our
initial CER and WER results for the OCR process are shown in Table 1. These results
have been analyzed with the OCR evaluation tool2 described in Carrasco [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ]. As can
be seen from the figures, CER and WER values of the re-OCR are clearly better than
those of the current OCR. Especially clear the difference is in word error rate which
drops to about a half.
2 http://impact.dlsi.ua.es/ocrevaluation/. A similar software is PRImA Research’s Text
Evaluation tool that is available from http://www.primaresearch.org/tools/PerformanceEvaluation.
        </p>
        <p>
          Evaluation of OCR results can be done experimentally either with or without
ground truth. After initial development and evaluation of the re-OCR process with the
GT data, we started testing of the re-OCR process with realistic newspaper data, i.e.
without GT to avoid overfitting of the data by using GT only in evaluation. We chose
for testing Uusi Suometar, newspaper which appeared in 1869–1918 and has 86 068
pages. Table 2. shows results of a 10 years’ re-OCR of Uusi Suometar with our first
re-OCR process. We show here results of morphological recognition with
(His)Omorfi that has been enhanced to process better historical Finnish. These results
give merely an estimation of improvement in the word quality [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ].
Year
1869
1870
1871
1872
1873
1874
1875
1876
1877
1878
1879
ALL
        </p>
        <p>Words
658 685
655 772
909 555
930 493
889 725
920 307
1 070 806
1 223 455
1 815 635
2 135 411
2 238 412
13 448 256</p>
      </sec>
      <sec id="sec-2-3">
        <title>Current OCR</title>
        <p>69.6%
66.9%
73%
76%
75.4%
72.9%
71.5%
72.8%
73.9%
72%
74.7%
73%</p>
        <p>Re-OCR is improving the recognition rates considerably and consistently.
Minimum improvement is 11.9% units, maximum 18% units. In average the improvement
is 13.5% units.</p>
        <p>As can be seen, all our initial results show clear improvement in the quality of the
OCR. The improvement could be characterized as noticeable, but not perhaps good
enough.
2.3</p>
      </sec>
      <sec id="sec-2-4">
        <title>Examination of the data: false and true positives</title>
        <p>In a closer look part of the false positives of the re-OCR are due to recurring trouble
with quote marking or division of the word on two lines when the word ends with a
hyphen. The re-OCR misses a quote or two in the result word or it produces the
HTML code &amp;quote; instead of quote itself. Many words are also wrongly divided on
the line. The same applies to false negatives, too. Number of all wrong word divisions
in the data of false and true positives together is about 10 000, which makes the error
type one of the most common. Also missing punctuation or extra punctuation causes
errors.</p>
        <p>When true positives are examined, one can see that about 54% of the errors
corrected are one character corrections and about 89% are 1–3 character corrections.
But re-OCR corrects also truly hard errors. Even errors with Levenshtein distance3
(LD) over 10 are corrected, a few examples being the following word pairs of edit
distance of 11 in Table 3.</p>
        <p>Another example of corrected hard errors are 2 376 words that have
Levenshtein edit distance of five. When the error count is this high, words are becoming
unintelligible. Some examples of corrections with five errors are shown in Table 4.</p>
        <p>The bigger the error count is, the harder the error would be to correct for post
correction software, and here lies the strength of re-OCR at its best. Reynaert (2016),
e.g., states that his post correction system of Dutch, TICCL, corrects best errors of LD
1-2. It can be run with LD 3, “but this has a high processing cost and most probably
results in lower precision.” Error correction for LD 4 and higher values he considers
too ambitious for the time being. This is also one of the conclusions in Choudhury et
al. (2007).4</p>
        <p>Number of corrected words with edit distances of 1–10 in true positives of
our re-OCR process can be seen in Table 5.
3 Levenshtein distance is a string metric for measuring the difference between two sequences.</p>
        <p>Informally, the Levenshtein distance between two words is the minimum number of
singlecharacter edits (insertions, deletions or substitutions) required to change one word into the
other. It is named after Vladimir Levenshtein, who considered this distance in 1965.
https://en.wikipedia.org/wiki/Levenshtein_distance
4 “It is impossible to correct very noisy texts, where the nature of the noise is random and
words are distorted by a large edit distance (say 3 or more).”</p>
      </sec>
      <sec id="sec-2-5">
        <title>Edit distance</title>
        <p>LD 1
LD 2
LD 3
LD 4
LD 5
LD 6
LD 7
LD 8
LD 9
LD 10</p>
        <p>Overall, the sum of character errors in the data decreased from old OCR’s 293 364
to 220 254 in Tesseract OCR, which is about a 25% decrease. Tesseract produces
significantly more errorless words than the old OCR (403 069 vs. 345 145), but it
produces also more character errors per erroneous word. Old OCR has about 2.32
errors per erroneous word, Tesseract OCR 3.2. This can be seen as a mixed blessing:
erroneous words are encountered more seldom in Tesseract’s output, but they may be
harder to read and understand when they occur.
3</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Improvements for the re-OCR Process</title>
      <p>
        The results we achieved with our initial re-OCR process were at least promising.
They showed clear improvement of the quality in the GT collection and also out of it
with realistic newspaper data shown in Table 2. Slightly better OCR results were
achieved by Drobac et al. [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ] with Ocropy machine learning OCR system using
character accuracy rate (CAR) as measure. Post-correction results of Silfverberg et al.
[
        <xref ref-type="bibr" rid="ref18">18</xref>
        ], however, were worse than our re-OCR results.5
      </p>
      <p>The main drawback of our re-OCR system is that it is relatively slow. Image
processing and combining of images takes time, if it is performed to every page image as
it is currently done. Execution time of the word level system was initially about 6 750
word tokens per hour when using a CPU with 8 cores in a standard Linux
environment. With increase of cores to 28 the speed improved to 29 628 word tokens per
hour. The speed of the process was still not very satisfying.
5 Silfverberg et al. have evaluated algorithmic post correction results of hfst-ospell software
with part of the historical data, 40 000 word pairs. They have used correction rate as their
measure, and their best result is 35.09 ± 2.08 (confidence value). Correction rate of our initial
re-OCR process data is 0.47, clearly better than post-correction results of Silfverberg et al. Our
result is also achieved with almost a twelvefold amount of word pairs.</p>
      <p>We have been able to improve the processing speed of re-OCR considerably
during the latest modifications. We have especially improved the string replacements
performed during the process, as they took almost as much time as the image
processing. String replacements take now only a fraction of the time they took earlier, but
image processing cannot be sped up easily. The new processing takes about half of
the time it used to take with the GT data. We are now able to process about 201 800
word tokens an hour in a 28 core system.</p>
      <p>We improved also the process for the word candidate selection after re-OCR. We
have been using two morphological analyzers (Omorfi6 and Voikko7), character
trigrams and other character level data to be able to weight the suggestions given by the
OCR process. We checked especially the trigram list and removed the least frequent
ones from it.
4</p>
    </sec>
    <sec id="sec-4">
      <title>Results – Part II</title>
      <p>After improvements made to the re-OCR process we have been able to achieve also
better results. The latest results are shown in Tables 6 and 7. Table 6 shows precision,
recall and correction rate results and Table 7 shows results of CER, WER and CAR
analyses using the ground truth data.
6 https://github.com/jiemakel/omorfi
7 https://voikko.puimula.org/
CER
WER
CAR</p>
      <p>
        Results in Table 6 and 7 show that the re-OCR process has improved clearly
from the initial performance shown in Section 2. Precision of the process has
improved considerably, and although recall is still slightly low, F-score is now 0.83
(earlier 0.73). CER and WER have improved also clearly. Our CAR is now also
slightly better than Drobac’s best value without post correction (ours 97.6 vs.
Drobac’s 97.3 [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ].
      </p>
      <p>Recognition results of the latest re-OCR of Uusi Suometar are shown in Figure 1.
The data consists of years 1869–1898 of the newspaper with about 115 930 415
words and 33 000 pages.</p>
      <p>Improvement of word recognizability
100,00%
90,00%
80,00%
70,00%
60,00%
50,00%
40,00%
30,00%
20,00%
10,00%
0,00%
Current OCR</p>
      <p>Re-OCR
8 These figures differ slightly from figures of current OCR in Table 1 due to the fact that the
improved re-OCR process finds now more matching word pairs in the image data.</p>
      <p>Re-OCR is improving the quality of the newspaper clearly and consistently and the
overall results are slightly better than in Table 2. The average improvement for the
whole period of 30 years is 15.3% units. The largest improvement is 20.5% units, and
smallest 12% units.
5</p>
    </sec>
    <sec id="sec-5">
      <title>Conclusion</title>
      <p>We have described in this paper results of a re-OCR process for a historical Finnish
newspaper and journal collection. The developed re-OCR process consists of
combination of five different image pre-processing techniques, a new Finnish Fraktur model
for Tesseract 3.04.01 OCR enhanced with morphological recognition and character
level rules to weight the resulting candidate words. Out of the results we create new
OCRed data in METS and ALTO XML format that can be used in our docWorks
document presentation system.</p>
      <p>
        We have shown that the re-OCRing process yields clearly better results than
commercial OCR engine ABBYY FineReader v. 7/8, which is our current OCR
engine. We have also shown that a 29 year time span of newspaper Uusi Suometar (33
000 pages and ca. 115.9 million words) gets significantly and consistently improved
word recognition rates for Tesseract output in comparison to current OCR. We have
also shown that our results are either equal or slightly better than results of a machine
learning OCR system Ocropy in Drobac et al. [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ]. Our results outperform clearly
post correction results of Silfverberg et al. [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ].
      </p>
      <p>
        Let us now turn to lessons learned during the re-OCR process so far. Our
development cycle for a new re-OCR process has been relatively long and taken more time
than we were able to estimate in advance. We started the process by first creating the
GT collection for Finnish [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]. The end result of the process was a ca. 525 000 word
collection of different quality OCR data with ground truth. The size of the collection
could be larger, but with regards to limited means it seems sufficient. In comparison
to GT data used in OCR or post correction literature, it fares also well, being a
midsized collection. The GT collection has been the cornerstone of our quality
improvement process: effects of the changes in the re-OCR process have been measured with
it.
      </p>
      <p>The second time consuming part in the process was creation of a new Fraktur font
model for Finnish. Even if the font was based on an existing German font model, it
needed lots of manual effort in picking letter images from different newspapers and
finding suitable Fraktur fonts for creating synthesized texts. This was, however,
crucial for the process, and could not be bypassed.</p>
      <p>A third lesson in our process was choice of the actual OCR engine. Most of the
OCR engines that are used in research papers are different versions of latest machine
learning algorithms. They may show nice results in the narrowly chosen evaluation
data, but the software are usually not really production quality products that could be
used in an industrial OCR process that processes 1–2 million page images in a year.
Thus our slightly conservative choice of open source Tesseract that has been around
for more than 20 years is justifiable.</p>
      <p>Another, slightly unforeseen problem have been modifications needed to the
existing ALTO XML output of the whole process. As ALTO XML9 is a standard approved
9 https://www.loc.gov/standards/alto/
by the ALTO board, changes to it are not made easily. An easy way to circumvent
this is to use two different ALTOs in the database of docWorks: one conforming to
the existing standard and another one that includes the necessary changes after
reOCR. We have chosen this route by including some of the word candidates of the
reOCR in the database as variants.</p>
      <p>We shall continue the re-OCR process by re-OCRing first the whole history of
Uusi Suometar. Its 86 000 pages should give us enough experience so that after that
we can move over to re-OCRing the whole Finnish collection. As there are hundreds
of publications to be re-OCRed, usage data of the collections are informative in
planning of the re-OCR: the most used newspapers and journals need to be re-OCRed
first.</p>
      <p>We have also created a Swedish language GT collection to be able to start
reOCRing our Swedish language part of the collection. The size of the Swedish GT
collection will be about 250 K of words from Swedish language newspapers and
journals published in Finland in 1771–1775 and 1798–1919. We should be able to start
quickly re-OCR trials with the Swedish data with our so far developed re-OCR
process. There should be no need for new font model generation for Swedish Fraktur, as
such a font is already available.</p>
      <p>
        OCR errors in the digitized newspapers and journals may have several harmful
effects for users of the data. One of the most important effects of poor OCR quality –
besides worse readability and comprehensibility – is worse on-line searchability of the
documents in the collections [
        <xref ref-type="bibr" rid="ref19 ref20">19–20</xref>
        ]. Although information retrieval is quite robust
even with corrupted data IR works best with longer documents and long queries,
especially when the data is of bad quality. Empirical results of Järvelin et al. [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ] with a
Finnish historical newspaper search collection, for example, show that even
impractically heavy usage of fuzzy matching in order to circumvent effects of OCR errors will
help only to a limited degree in search of a low quality OCRed newspaper collection,
when short queries and their query expansions are used.
      </p>
      <p>
        Weaker searchability of the OCRed collections is one dimension of poor OCR
quality. Other effects of poor OCR quality may show in the more detailed processing
of the documents, such as sentence boundary detection, tokenization and
part-ofspeech-tagging, which are important in higher-level natural language processing tasks
[
        <xref ref-type="bibr" rid="ref22">22</xref>
        ]. Part of the problems may be local, but part will cumulate in the whole pipeline
of natural language processing causing errors. Thus quality of the OCRed texts is the
cornerstone for any kind of further usage of the material and improvements in OCR
quality are welcome. And last but not least, user dissatisfaction with the quality of the
OCR, as testified e.g. in Jarlbrink and Snickars [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ], is of great importance. Digitized
historical newspaper and journal collections are meant for users, both researchers and
lay person. If they are not satisfied with the quality of the content, improvements need
to be made.
      </p>
      <sec id="sec-5-1">
        <title>Acknowledgment</title>
        <p>This work is funded by the European Regional Development Fund and the program
Leverage from the EU 2014-2020.</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Kettunen</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pääkkönen</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Measuring Lexical Quality of a Historical Finnish Newspaper Collection - Analysis of Garbled OCR Data with Basic Language Technology Tools</article-title>
          and Means,
          <source>” Proc. of the Tenth International Conference on Language Resources and Evaluation (LREC</source>
          <year>2016</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Pääkkönen</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kervinen</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nivala</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kettunen</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mäkelä</surname>
            ,
            <given-names>E.: Exporting</given-names>
          </string-name>
          <string-name>
            <surname>Finnish Digitized Historical Newspaper Contents for Offline Use. D-Lib</surname>
            <given-names>Magazine</given-names>
          </string-name>
          ,
          <source>July/August</source>
          (
          <year>2016</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Piotrowski</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <source>Natural Language Processing for Historical Texts. Synthesis Lectures on Human Language Technologies</source>
          , Morgan &amp; Claypool Publishers (
          <year>2012</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Holley</surname>
          </string-name>
          , R.:
          <article-title>How good can it get? Analysing and Improving OCR Accuracy in Large Scale Historic Newspaper Digitisation Programs</article-title>
          .
          <string-name>
            <surname>D-Lib</surname>
            <given-names>Magazine</given-names>
          </string-name>
          ,
          <volume>15</volume>
          (
          <issue>3</issue>
          /4) (
          <year>2009</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Doermann</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tombre</surname>
            ,
            <given-names>K</given-names>
          </string-name>
          . (Eds.):
          <source>Handbook of Document Image Processing and Recognition</source>
          . Springer (
          <year>2014</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Tanner</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Muñoz</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ros</surname>
            ,
            <given-names>P.H.</given-names>
          </string-name>
          :
          <article-title>Measuring Mass Text Digitization Quality and Usefulness. Lessons Learned from Assessing the OCR Accuracy of the British Library's 19th Century Online Newspaper Archive</article-title>
          .
          <string-name>
            <surname>D-Lib</surname>
            <given-names>Magazine</given-names>
          </string-name>
          , (
          <volume>15</volume>
          /8) (
          <year>2009</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Niklas</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <article-title>Unsupervised Post-Correction of OCR Errors</article-title>
          .
          <source>Diploma Thesis</source>
          , Leibniz Universität, Hannover. www.l3s.de/~tahmasebi/Diplomarbeit_Niklas.pdf (
          <year>2010</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Traub</surname>
            ,
            <given-names>M. C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ossenbruggen</surname>
            ,
            <given-names>J. van</given-names>
          </string-name>
          , Hardman,
          <string-name>
            <surname>L.</surname>
          </string-name>
          :
          <article-title>Impact Analysis of OCR Quality on Research Tasks in Digital Archives</article-title>
          . In: Kapidakis,
          <string-name>
            <given-names>S.</given-names>
            ,
            <surname>Mazurek</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Werla</surname>
          </string-name>
          , M. (eds.),
          <source>Research and Advanced Technology for Libraries. Lecture Notes in Computer Science</source>
          , vol.
          <volume>9316</volume>
          , pp.
          <fpage>252</fpage>
          -
          <lpage>263</lpage>
          (
          <year>2015</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Jarlbrink</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Snickars</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Cultural heritage as digital noise: nineteenth century newspapers in the digital archive</article-title>
          .
          <source>Journal of Documentation</source>
          , https://doi.org/10.1108/JD-09-2016-
          <volume>0106</volume>
          (
          <year>2017</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Reynaert</surname>
            ,
            <given-names>M.:</given-names>
          </string-name>
          <article-title>OCR Post-Correction Evaluation of Early Dutch Books Online - Revisited</article-title>
          .
          <source>In Proceedings of LREC</source>
          , pp.
          <fpage>967</fpage>
          -
          <lpage>974</lpage>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Choudhury</surname>
            ,
            <given-names>M.</given-names>
            Thomas, M.
          </string-name>
          ,
          <string-name>
            <surname>Mukherjee</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Basu</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ganguly</surname>
          </string-name>
          , N.:
          <article-title>How difficult is it to develop a perfect spell-checker? A cross-linguistic analysis through complex network approach</article-title>
          . In Proceedings of the second workshop on TextGraphs:
          <article-title>Graph-based algorithms for natural language processing</article-title>
          , pp.
          <fpage>81</fpage>
          -
          <lpage>88</lpage>
          , (
          <year>2007</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Koistinen</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kettunen</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kervinen</surname>
          </string-name>
          , J.:
          <article-title>How to Improve Optical Character Recognition of Historical Finnish Newspapers Using Open Source Tesseract OCR Engine</article-title>
          .
          <source>Proc. of LTC</source>
          <year>2017</year>
          , Nov.
          <year>2017</year>
          , pp.
          <fpage>279</fpage>
          -
          <lpage>283</lpage>
          (
          <year>2017</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Koistinen</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kettunen</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pääkkönen</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Improving Optical Character Recognition of Finnish Historical Newspapers with a Combination of Fraktur &amp; Antiqua Models and Image Preprocessing</article-title>
          .
          <source>Proc. of the 21st Nordic Conference on Computational Linguistics</source>
          , NoDaLiDa, May
          <year>2017</year>
          , pp.
          <fpage>277</fpage>
          -
          <lpage>283</lpage>
          (
          <year>2017</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Kettunen</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kervinen</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Koistinen</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Creating and using ground truth OCR sample data for Finnish historical newspapers and journals</article-title>
          .
          <source>In DHN2018, Proceedings of the Digital Humanities in the Nordic Countries 3rd Conference</source>
          ,
          <volume>162</volume>
          -
          <fpage>169</fpage>
          . http://ceur-ws.org/Vol2084/ (
          <year>2018</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Volk</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Furrer</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sennrich</surname>
          </string-name>
          , R.:
          <article-title>Strategies for reducing and correcting OCR errors</article-title>
          . In C. Sporleder, A. van den Bosch,
          <article-title>and</article-title>
          K. Zervanou, Eds.
          <source>Language Technology for Cultural Heritage</source>
          ,
          <year>2011</year>
          ,
          <fpage>3</fpage>
          -
          <lpage>22</lpage>
          (
          <year>2011</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Carrasco</surname>
            ,
            <given-names>R.C.</given-names>
          </string-name>
          :
          <article-title>An open-source OCR evaluation tool</article-title>
          .
          <source>In: Proceeding DATeCH '14 Proceedings of the First International Conference on Digital Access to Textual Cultural Heritage</source>
          ,
          <fpage>179</fpage>
          -
          <lpage>184</lpage>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Drobac</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kauppinen</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lindén</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <article-title>OCR and post-correction of historical Finnish texts</article-title>
          . In: Tiedemann,
          <string-name>
            <surname>J</surname>
          </string-name>
          . (ed.)
          <source>Proceedings of the 21st Nordic Conference on Computational Linguistics, NoDaLiDa</source>
          ,
          <fpage>22</fpage>
          -
          <lpage>24</lpage>
          May
          <year>2017</year>
          , Gothenburg, Sweden,
          <fpage>70</fpage>
          -
          <lpage>76</lpage>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Silfverberg</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kauppinen</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Linden</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <string-name>
            <surname>Data-Driven Spelling Correction Using Weighted Finite-State Method</surname>
          </string-name>
          .
          <source>In: Proceedings of the ACL Workshop on Statistical NLP and Weighted Automata</source>
          ,
          <fpage>51</fpage>
          -
          <lpage>59</lpage>
          , https://aclweb.org/anthology/W/W16/W16-2406.pdf (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Taghva</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Borsack</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Condit</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Evaluation of Model-Based Retrieval Effectiveness with OCR Text</article-title>
          .
          <source>ACM Transactions on Information Systems</source>
          ,
          <volume>14</volume>
          (
          <issue>1</issue>
          ),
          <fpage>64</fpage>
          -
          <lpage>93</lpage>
          (
          <year>1996</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>Kantor</surname>
            ,
            <given-names>P. B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Voorhees</surname>
            ,
            <given-names>E. M.:</given-names>
          </string-name>
          <article-title>The TREC-5 Confusion Track: Comparing Retrieval Methods for Scanned Texts</article-title>
          .
          <source>Information Retrieval</source>
          ,
          <volume>2</volume>
          ,
          <fpage>165</fpage>
          -
          <lpage>176</lpage>
          (
          <year>2000</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <surname>Järvelin</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Keskustalo</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sormunen</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Saastamoinen</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Kettunen</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <article-title>Information retrieval from historical newspaper collections in highly inflectional languages: A query expansion approach</article-title>
          .
          <source>Journal of the Association for Information Science and Technology</source>
          <volume>67</volume>
          (
          <issue>12</issue>
          ),
          <fpage>2928</fpage>
          -
          <lpage>2946</lpage>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          22.
          <string-name>
            <surname>Lopresti</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Optical character recognition errors and their effects on natural language processing</article-title>
          .
          <source>International Journal on Document Analysis and Recognition</source>
          ,
          <volume>12</volume>
          :
          <fpage>141</fpage>
          -
          <lpage>151</lpage>
          (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>