Klaus U Schulz

Biographic Data

ID6536575
NAMEKlaus U Schulz
GIVEN NAMESKlaus U
FAMILY NAMESchulz
SIGNATURESCHULZ K U
AFFILIATIONSCIS, University of Munich
VERIFIEDNo
TOTAL WORKS12
TOTAL CITATIONS1
WORKS AS AUTHOR12
WORKS AS EDITOR0
FIRST PUBLICATION YEAR2003
LATEST PUBLICATION YEAR2021
H-INDEX1

  • Using an Advanced Text Index Structure for Corpus Exploration in Digital Humanities

    Open AccessTobias Englmeier, Marco Büchler et al.ARTICLEDigital humanities quarterly2021

    With suitable index structures many corpus exploration tasks can be solved in an efficient way without rescanning the text repository in an online manner. In this paper we show that symmetric compacted directed acyclic word graphs (SCDAWGs) - a refinement of suffix trees - offer an ideal basis for corpus exploration, helping to answer many of the questions raised in DH research in an elegant way. From a simplified point of view, the advantages of…

  • Orthographic Errors in Web Pages

    Open AccessChristoph Ringlstetter, Klaus U Schulz et al.ARTICLEComputational Linguistics2006Cited by: 1References: 1

    Since the Web by far represents the largest public repository of natural language texts, recent experiments, methods, and tools in the area of corpus linguistics often use the Web as a corpus. For applications where high accuracy is crucial, the problem has to be faced that a non-negligible number of orthographic and grammatical errors occur in Web documents. In this article we investigate the distribution of orthographic errors of various types …

  • Fast Approximate Search in Large Dictionaries

    Open AccessStoyan Mihov, Klaus U SchulzARTICLEComputational Linguistics2004

    The need to correct garbled strings arises in many areas of natural language processing. If a dictionary is available that covers all possible input tokens, a natural set of candidates for correcting an erroneous input P is the set of all words in the dictionary for which the Levenshtein distance to Pdoes not exceed a given (small) bound k. In this article we describe methods for efficiently selecting such candidate sets. After introducing as a s…

  • Scherer, Uli

    Klaus U Schulz, Klaus Schulz et al.CHAPTERThe new Grove dictionary of music…2003

  • Koller, Hans

    Klaus U Schulz, Klaus SchulzCHAPTERThe new Grove dictionary of music…2003

  • Vienna Art Orchestra

    Klaus U Schulz, Klaus SchulzCHAPTERThe new Grove dictionary of music…2003

  • Miklin, Karlheinz

    Klaus U Schulz, Klaus Schulz et al.CHAPTERThe new Grove dictionary of music…2003

  • Bachträgl, Erich

    Klaus U Schulz, Klaus SchulzCHAPTERThe new Grove dictionary of music…2003

  • Winter, Horst

    Klaus U Schulz, Klaus SchulzCHAPTERThe new Grove dictionary of music…2003

  • Kleinschuster, Erich

    Klaus U Schulz, Klaus Schulz et al.CHAPTERThe new Grove dictionary of music…2003

  • Pauer, Fritz

    Klaus U Schulz, Klaus Schulz et al.CHAPTERThe new Grove dictionary of music…2003

  • Pirchner, Werner (jazz)

    K Schulz, Klaus U SchulzCHAPTERThe new Grove dictionary of music…2003