Integer-based nomenclature for the ecosystem of lexically repetitive expressions in complete works of William Shakespeare

  • Repetition of morphological or lexical units is an established technique able to reinforce the impact of one's argument upon the audience. Rhetoric tradition has canonized dozens of repetition-involving schemas as figures of speech. Our article shows a way how hitherto ignored repetition-involving schemata can be identified. It shows that certain classes of repetitive figures can be represented in terms of specific sequences of integer numbers and vice versa, how specific sets of integer numbers can be translated into sets of regexes able to match repetition-involving expressions. A "Shakespeare number" S is simply defined as an integer with at least one repeated digit in which no digit bigger than X can occur if ever a digit X had not yet occurred in S's decimal representation. Hence, 121 is a Shakespeare number, while 123 or 211 are not. A set of "entangled numbers" is subsequently defined as a subset of "Shakespeare numbers" with an additional property that all digits which occur in them are repeated at least twice in the decimalRepetition of morphological or lexical units is an established technique able to reinforce the impact of one's argument upon the audience. Rhetoric tradition has canonized dozens of repetition-involving schemas as figures of speech. Our article shows a way how hitherto ignored repetition-involving schemata can be identified. It shows that certain classes of repetitive figures can be represented in terms of specific sequences of integer numbers and vice versa, how specific sets of integer numbers can be translated into sets of regexes able to match repetition-involving expressions. A "Shakespeare number" S is simply defined as an integer with at least one repeated digit in which no digit bigger than X can occur if ever a digit X had not yet occurred in S's decimal representation. Hence, 121 is a Shakespeare number, while 123 or 211 are not. A set of "entangled numbers" is subsequently defined as a subset of "Shakespeare numbers" with an additional property that all digits which occur in them are repeated at least twice in the decimal representation of the number. Thus, a 1212 is an entangled number while 1211 is not. A complete set E of entangled numbers of maximal length of 10 digits is subsequently generated and every member of E is translated into a regex. Each regex is subsequently exposed to all utterances in all works of William Shakespeare, allowing us to pinpoint 3367 instances of 172 distinct E-schemata. This nomenclature may allow scholars to lead a discussion about schemata which have escaped the attention of classical interpretators.zeige mehrzeige weniger

Volltext Dateien herunterladen

  • This fulltext is an unabridged version of the article "Extraction of lexical repetitive expressions from complete works of william shakespeare" presented at 14th International Conference on Statistical Analysis of Textual Data (JADT2018) at Sapienza University, Rome.

Metadaten exportieren

Metadaten
Verfasserangaben:Prof. Daniel Devatman HromadaORCiD
URN:urn:nbn:de:kobv:b170-13313
DOI:https://doi.org/10.25624/kuenste-1331
Übergeordnetes Werk (Englisch):On language and numbers
Dokumentart:Konferenzveröffentlichung
Sprache:Englisch
Datum der Veröffentlichung (online):07.10.2020
Datum der Erstveröffentlichung:17.11.2020
Veröffentlichende Institution:Universität der Künste Berlin
Datum der Freischaltung:17.11.2020
Freies Schlagwort / Tag:William Shakespeare; back-references; integers; regular expressions; repetition; repetitive figures of speech; stylometry
GND-Schlagwort:Shakespeare, WilliamGND; WortwiederholungGND
Seitenzahl:16
Fakultäten und Einrichtungen:Fakultät Gestaltung
DDC-Klassifikation:7 Künste und Unterhaltung / 70 Künste / 700 Künste; Bildende und angewandte Kunst
Lizenz (Deutsch):Creative Commons - CC BY-NC-SA - Namensnennung - Nicht kommerziell - Weitergabe unter gleichen Bedingungen 4.0 International
Verstanden ✔
Diese Webseite verwendet technisch erforderliche Session-Cookies. Durch die weitere Nutzung der Webseite stimmen Sie diesem zu. Unsere Datenschutzerklärung finden Sie hier.