How can complex graphemes be identified in German

Bibliographic Data

ID21226596
AuthorsNiklas Reinken (0000-0001-7035-4558, Carl von Ossietzky Universität Oldenburg, corresponding author)
Year2022
Volume8
Issue1
Pages321-330
Publication date2022-12-28
Open AccessYes
TypeARTICLE
VenueLinguistics Vanguard (JOURNAL)
Journal identifiersISSN: 2199-174X • E-ISSN: 2199-174X
PublisherWalter de Gruyter GmbH (PUBLISHER • DE)
DOI10.1515/lingvan-2022-0055
OpenAlexW4307456061
LanguageEN
Citations received1
References cited16

The question of whether a letter is a grapheme or not is a perennial issue in writing research. The answer depends on which criteria are used to differentiate between letters and graphemes and, ultimately, how the unit ‘grapheme’ is defined. This problem is particularly relevant to complex graphemes, i.e. sequences of letters that behave like a single grapheme in certain respects. Typical for German is the ‹ch›. This paper argues for a scalar concept of graphemes, which compares the grapheme status of each of the units under investigation. For this purpose, new criteria for the identification of complex graphemes are used, which originate from handwriting analysis. There, it is shown that complex graphemes are connected with each other disproportionately often and also have deviating letter forms disproportionately often

Biology · German · Grapheme · Handwriting · Linguistics · Natural language processing · Computer Science · Linguistic research and analysis · linguistics and terminology studies · Natural Language Processing Techniques · Philosophy · Artificial Intelligence

Tools

Open DOIOpen Access