paper-with-me

홈 › Papers

Markov reads Pushkin, again: A statistical journey into the poetic world of Evgenij Onegin

2026-04-22 · Angelo Maria Sabatini arxiv

This study applies symbolic time series analysis and Markov modeling to explore the phonological structure of Evgenij Onegin-as captured through a graphemic vowel/consonant (V/C) encoding-and one contemporary Italian translation. Using a binary encoding inspired by Markov's original scheme, we construct minimalist probabilistic models that capture both local V/C dependencies and large-scale sequential patterns. A compact four-state Markov chain is shown to be descriptively accurate and generative, reproducing key features of the original sequences such as autocorrelation and memory depth. All findings are exploratory in nature and aim to highlight structural regularities while suggesting hypotheses about underlying narrative dynamics. The analysis reveals a marked asymmetry between the Russian and Italian texts: the original exhibits a gradual decline in memory depth, whereas the translation maintains a more uniform profile. To further investigate this divergence, we introduce phonological probes-short symbolic patterns that link surface structure to narrative-relevant cues. Tracked across the unfolding text, these probes reveal subtle connections between graphemic form and thematic development, particularly in the Russian original. By revisiting Markov's original proposal of applying symbolic analysis to a literary text and pairing it with contemporary tools from computational statistics and data science, this study shows that even minimalist Markov models can support exploratory analysis of complex poetic material. When complemented by a coarse layer of linguistic annotation, such models provide a general framework for comparative poetics and demonstrate that stylized structural patterns remain accessible through simple representations grounded in linguistic form.

📄 PDF Abstract BibTeX arXiv:2604.20221

Code (0)

등록된 구현이 없습니다.

Tasks

Time Series Analysis

Similar Papers 제목 키워드 기반

Bayesian Classifier for Route Prediction with Markov Chains

2018-08-31 · Jonathan P. Epperlein, Julien Monteil, Ming-ming Liu, Yingqi Gu 외

We present here a general framework and a specific algorithm for predicting the destination, route, or more generally a pattern, of an ongoing journey, building on the recent work of [Y. Lassoued, J. Monteil, Y. Gu, G. R…

Prediction

Machine Translation at Booking.com: Journey and Lessons Learned

2017-07-25 · Pavel Levin, Nishikant Dhanuka, Maxim Khalilov

We describe our recently developed neural machine translation (NMT) system and benchmark it against our own statistical machine translation (SMT) system as well as two other general purpose online engines (statistical an…

Machine TranslationNMTSentenceTranslation

Hybrid topic modelling for computational close reading: Mapping narrative themes in Pushkin's Evgenij Onegin

2026-03-20 · Angelo Maria Sabatini arxiv

This study presents a hybrid topic modelling framework for computational literary analysis that integrates Latent Dirichlet Allocation (LDA) with sparse Partial Least Squares Discriminant Analysis (sPLS-DA) to model them…

Spreadsheet Probabilistic Programming

2016-06-14 · Mike Wu, Yura Perov, Frank Wood, Hongseok Yang

Spreadsheet workbook contents are simple programs. Because of this, probabilistic programming techniques can be used to perform Bayesian inversion of spreadsheet computations. What is more, existing execution engines in …

Decision MakingDecision Making Under UncertaintyProbabilistic ProgrammingVariational Inference

SIS Epidemic Model: Birth-and-Death Markov Chain Approach

2021-02-17 · A. H. Nzokem

We are interested in describing the infected size of the SIS Epidemic model using Birth-Death Markov process. The Susceptible-Infected-Susceptible (SIS) model is defined within a population of constant size $M$; the size…