activity
20062018
most citedAutomatic quality evaluation and (semi-) automatic improvement of OCR models for historical printings

20 citations · 26 across the 6 of their papers we have counts for

collaborators

6 papers

cs.FL2018

Space-Efficient Bimachine Construction Based on the Equalizer Accumulation Principle

Stefan Gerdjikov, Stoyan Mihov, Klaus U. Schulz

Algorithms for building bimachines from functional transducers found in the literature in a run of the bimachine imitate one successful path of the input transducer. Each single bi…

cs.CV2017

Profiling of OCR'ed Historical Texts Revisited

Florian Fink, Klaus-U. Schulz, Uwe Springmann

In the absence of ground truth it is not possible to automatically determine the exact spectrum and occurrences of OCR errors in an OCR'ed text. Yet, for interactive postcorrection…

cs.DL2016★ 20 cited

Automatic quality evaluation and (semi-) automatic improvement of OCR models for historical printings

U. Springmann, F. Fink, K. U. Schulz

Good OCR results for historical printings rely on the availability of recognition models trained on diplomatic transcriptions as ground truth, which is both a scarce resource and t…

cs.CL2016★ 1 cited

Corpus analysis without prior linguistic knowledge - unsupervised mining of phrases and subphrase structure

Stefan Gerdjikov, Klaus U. Schulz

When looking at the structure of natural language, "phrases" and "words" are central notions. We consider the problem of identifying such "meaningful subparts" of language of any l…

cs.CL2013★ 5 cited

Good parts first - a new algorithm for approximate search in lexica and string databases

Stefan Gerdjikov, Stoyan Mihov, Petar Mitankin +1

We present a new efficient method for approximate search in electronic lexica. Given an input string (the pattern) and a similarity threshold, the algorithm retrieves all entries o…

cs.DB2006

Conjunctive Queries over Trees

Georg Gottlob, Christoph Koch, Klaus U. Schulz

We study the complexity and expressive power of conjunctive queries over unranked labeled trees represented using a variety of structure relations such as ``child'', ``descendant''…