OSCR

Neural tracking of prosodic and statistical rhythms jointly supports artificial language learning.

Code ↔ Paper

21 matches between paragraphs of the paper and lines of its authors' code, computed by the harvester (lexical-v1). Click a colored paragraph or line to see its counterpart.

15 blocks of code here have a permanent identifier (oscr:b:…), listed with the matches below: citable for good, with a page of its own. Select a match and press Cite to copy it. What a block identifier is.

The 21 matches
  1. [1] § STAR★Methods › Quantification and statistical analysis › Time-domain analyses ↔ S05_01_01_compute_erf.m, lines 156 to 197 · score 0.89 · full width half, 170–250 ms, 300–500 ms, peak latencies, 170 ms, FWHM · block oscr:b:N4G5ETEX6P4AZ-D · Report a mismatch
  2. [2] § STAR★Methods › Quantification and statistical analysis › Data preprocessing ↔ S02_01_02_preprocessing.m, lines 147 to 214 · score 0.86 · SQUID jumps, 2–15 Hz, artifact detection, cutoff, ICA, EOG · block oscr:b:0T1Z2C55SVC4H-2 · Report a mismatch
  3. [3] § STAR★Methods › Method details › Stimuli ↔ S00_03_01_lexicons.py, lines 8 to 24 · score 0.85 · native German speakers, phonological feature, German corpus, lowest, phonemic, bigram · block oscr:b:KDZAMTWPM46JM-S · Report a mismatch
  4. [4] § STAR★Methods › Method details › Stimuli ↔ S00_02_01_prosody.py, lines 34 to 38 · score 0.84 · Bo kennt Sue, die sehr stinkt, prosodically marked, weak, sentence, prosody · block oscr:b:XG4MGKJPCQXSJ-X · Report a mismatch
  5. [5] § STAR★Methods › Quantification and statistical analysis › Source analyses ↔ S07_01_01_sourceanalysis.m, lines 183 to 255 · score 0.80 · covariance matrix, 150–1000 ms, common filter, recognition phase, 150 ms, part words · block oscr:b:YKTCPJTQ9DY9V-7 · Report a mismatch
  6. [6] § STAR★Methods › Method details › Procedure ↔ S01_00_00_neuraltrack.m, lines 78 to 170 · score 0.76 · 1.5–2 s, 1–1.5 s, mini block, jittered, breaks, phase · block oscr:b:AXSJKYG6PQ2SE-7 · Report a mismatch
  7. [7] § STAR★Methods › Method details › Stimuli ↔ S00_03_01_lexicons.py, lines 8 to 24 · score 0.75 · Levenshtein distance, phonotactic constraint, artificial lexicons, phonemic, part word, transitioned · block oscr:b:KDZAMTWPM46JM-S · Report a mismatch
  8. [8] § STAR★Methods › Method details › Stimuli ↔ S00_01_01_syllables.py, lines 8 to 17 · score 0.70 · binary matrix, phonological feature, German corpus, consonant, vowel, phoneme · block oscr:b:F1A3XF9QXGBNW-F · Report a mismatch
  9. [9] § STAR★Methods › Method details › Stimuli ↔ S00_01_01_syllables.py, lines 8 to 17 · score 0.67 · consonant vowel, long vowels, German corpus, phonological, phoneme, uniformize · block oscr:b:F1A3XF9QXGBNW-F · Report a mismatch
  10. [10] § STAR★Methods › Quantification and statistical analysis › Data preprocessing ↔ S02_01_02_preprocessing.m, lines 54 to 100 · score 0.66 · 0.1–30 Hz, detrended, demeaned, FieldTrip, MaxFilterTM, preprocessing · block oscr:b:1VBQ3CCNHK86J-R · Report a mismatch
  11. [11] § STAR★Methods › Quantification and statistical analysis › Data preprocessing ↔ S02_01_03_cleaning.m, lines 227 to 270 · score 0.66 · independent component, rejected trials, std, ICA, artifacts, preprocessing · block oscr:b:3AED837TKMVDC-O · Report a mismatch
  12. [12] § Results › M200 and M400 fields are sensitive to violations of PR or TP patterns ↔ S05_01_01_compute_erf.m, lines 156 to 197 · score 0.64 · 170–250 ms, 300–500 ms, 170 ms, FWHM, M200, M400 · block oscr:b:N4G5ETEX6P4AZ-D · Report a mismatch
  13. [13] § STAR★Methods › Method details › Procedure ↔ S00_05_01_stimset.m, lines 118 to 162 · score 0.62 · balanced Latin square, counterbalanced, mini, prosody, blocks, lexicon · block oscr:b:4ZAE67GAMY1Q5-U · Report a mismatch
  14. [14] § STAR★Methods › Quantification and statistical analysis › Frequency-domain analyses ↔ S03_01_02_analyze_pow.m, lines 34 to 87 · score 0.59 · baseline power, neighboring frequencies, ratio, channels, block · block oscr:b:3A3BNNWHQ0H43-G · Report a mismatch
  15. [15] § Results ↔ S07_01_01_sourceanalysis.m, lines 183 to 255 · score 0.58 · inter trial phase, recognition phase, coherence, ITPC, ERF, pseudowords · block oscr:b:YKTCPJTQ9DY9V-7 · Report a mismatch
  16. [16] § Results ↔ S05_01_01_compute_erf.m, lines 1 to 53 · score 0.56 · event related field, recognition phase, ERF, M200, M400, MEG · block oscr:b:P8HJB8E0306S3-9 · Report a mismatch
  17. [17] § Results › PR and TP patterns are both needed for learning pseudowords ↔ S08_01_02_lme_behavior.R, lines 144 to 210 · score 0.54 · behavioral accuracy, history, PR, TP · block oscr:b:VGVGSHVJARY70-W · Report a mismatch
  18. [18] § STAR★Methods › Quantification and statistical analysis › Frequency-domain analyses ↔ S04_01_01_compute_itc.m, lines 42 to 128 · score 0.54 · artifact free trials, wavelet, Fourier, channels, chunk · block oscr:b:QSRB1N23Y4QK8-B · Report a mismatch
  19. [19] § STAR★Methods › Quantification and statistical analysis › Source analyses ↔ S05_01_01_compute_erf.m, lines 55 to 130 · score 0.52 · 150–1000 ms, 150 ms, pre, part words, ERF, latencies · block oscr:b:H50NDGR1PX1K3-M · Report a mismatch
  20. [20] § STAR★Methods › Quantification and statistical analysis › Behavioral analyses ↔ S00_05_01_stimset.m, lines 118 to 162 · score 0.52 · balanced Latin square, stimuli, PR, TP · block oscr:b:4ZAE67GAMY1Q5-U · Report a mismatch
  21. [21] § Results › PR and TP patterns modulate neural tracking of syllables and chunks ↔ S03_01_02_analyze_pow.m, lines 34 to 87 · score 0.51 · baseline power, neighboring frequencies, ratio · block oscr:b:3A3BNNWHQ0H43-G · Report a mismatch

Paper

Loaded from Europe PMC by your browser; OSCR does not store it: doi.org · Europe PMC

The paper is loaded when this pane is shown.

The authors' code

MATLAB · 234 lines · 8.8 KB · no license · 4 matches

  1. %% Setup
  2. % Clear the workspace
  3. clearvars
  4. close all
  5. clc
  6. % Set paths
  7. project_dir = '/data/pt_02740/neuraltrack';
  8. expdata_dir = [project_dir filesep 'data'];
  9. results_dir = [project_dir filesep 'results'];
  10. figures_dir = [project_dir filesep 'figures' filesep 'evoked'];
  11. ft_defaults
  12. % Set parameters
  13. testID = {'Main effect PR';
  14. 'Main effect TP'}; % Labels of effects of interest
  15. condID = {'PR- TP-';
  16. 'PR- TP+';
  17. 'PR+ TP-';
  18. 'PR+ TP+'}; % Labels of conditions in the exposure phase
  19. typeID = {'Pseudowords';
  20. 'Part-words'}; % Labels of "word" types in the recognition phase
  21. ERFsID = {'M200';
  22. 'M400'}; % Labels of event-related fields (ERFs) of interest
  23. timeID = linspace(-150, 1000, 1151); % Time array for analyses of ERFs
  24. nStart = 40; % Start number of participants
  25. nSubjs = 32; % Total number of participants
  26. nBlock = 8; % Total number of blocks
  27. fSampl = 1000; % MEG sampling frequency
  28. nConds = length(condID); % Number of conditions
  29. nTypes = length(typeID); % Number of word type
  30. nPeaks = length(ERFsID); % Number of ERFs
  31. nTimes = length(timeID); % Epoch length
  32. % Set filenames
  33. subject_num = cellstr(string((1:nSubjs) + nStart));
  34. subject_lst = strcat('nt', subject_num, 'a');
  35. trldata_lst = strcat(repmat(subject_lst, nBlock, 1)', ...
  36. repmat(cellstr(string(1:nBlock)), nSubjs, 1), ...
  37. repmat({'_trl.mat'}, [nSubjs nBlock]));
  38. predata_lst = strcat(repmat(subject_lst, nBlock, 1)', ...
  39. repmat(cellstr(string(1:nBlock)), nSubjs, 1), ...
  40. repmat({'_dat.mat'}, [nSubjs nBlock]));
  41. erfdata_lst = strcat(repmat(subject_lst, nBlock, 1)', ...
  42. repmat(cellstr(string(1:nBlock)), nSubjs, 1), ...
  43. repmat({'_erf.mat'}, [nSubjs nBlock]));
  44. avgdata_lst = strcat(repmat(subject_lst, nBlock, 1)', ...
  45. repmat(cellstr(string(1:nBlock)), nSubjs, 1), ...
  46. repmat({'_avg.mat'}, [nSubjs nBlock]));
  47. rawdata_lst = strcat(repmat(subject_lst, nBlock, 1)', ...
  48. repmat(cellstr(string(1:nBlock)), nSubjs, 1), ...
  49. repmat({'_raw.mat'}, [nSubjs nBlock]));
  50. %% Compute timelock analysis
  51. % Initialize
  52. AVG = cell(nSubjs, nConds, nTypes);
  53. % Loop through subjects
  54. for i_subj = 1:nSubjs
  55. % Define directories
  56. expdata_sub = [expdata_dir filesep subject_lst{i_subj}];
  57. expdata_pre = [expdata_sub filesep '02_preproc'];
  58. expdata_erf = [expdata_sub filesep '05_evoked'];
  59. if ~isfolder(expdata_erf)
  60. mkdir(expdata_erf)
  61. end
  62. % Loop through blocks
  63. for i_blck = 2:2:nBlock
  64. % Load data
  65. expdata_art = fullfile(expdata_pre, artdata_lst{i_subj, i_blck});
  66. expdata_dat = fullfile(expdata_pre, predata_lst{i_subj, i_blck});
  67. load(expdata_art, 'art')
  68. load(expdata_dat, 'dat')
  69. % Reject trials with visual artifacts
  70. cfg = art.xxx.cfg;
  71. data = ft_rejectartifact(cfg, dat);
  72. % Split trials by condition
  73. i_trig = data.trialinfo(:, 1);
  74. i_cond = floor(i_trig(1)/20);
  75. idxs_A = i_trig - i_cond * 20 < 5; % pseudowords
  76. idxs_B = i_trig - i_cond * 20 > 5; % part-words
  77. trlAll = 1:length(data.trial);
  78. trls_A = trlAll(idxs_A);
  79. trls_B = trlAll(idxs_B);
  80. trlCnd = {trls_A, trls_B};
  81. % Filtering and baseline correction
  82. cfg = [];
  83. cfg.baselinewindow = [-0.15 0];
  84. cfg.demean = 'yes';
  85. cfg.hpfreq = 1;
  86. cfg.hpfilter = 'yes';
  87. cfg.hpfilttype = 'firws';
  88. data = ft_preprocessing(cfg, data);
  89. erf = data;
  90. % Compute average over trials (AVG)
  91. cfg = [];
  92. cfg.trials = trlCnd{1};
  93. cfg.latency = [-0.15 1];
  94. avg{1} = ft_timelockanalysis(cfg, data);
  95. cfg.trials = trlCnd{2};
  96. avg{2} = ft_timelockanalysis(cfg, data);
  97. % Compute RAW difference of AVG over trials
  98. cfg = [];
  99. cfg.parameter = 'avg';
  100. cfg.operation = 'x2-x1';
  101. raw = ft_math(cfg, avg{1}, avg{2});
  102. % Store ERF avg by condition
  103. AVG{i_subj, i_cond, 1} = avg{1};
  104. AVG{i_subj, i_cond, 2} = avg{2};
  105. % Save data
  106. erfdata_erf = fullfile(expdata_erf, erfdata_lst{i_subj, i_blck});
  107. erfdata_avg = fullfile(expdata_erf, avgdata_lst{i_subj, i_blck});
  108. erfdata_raw = fullfile(expdata_erf, rawdata_lst{i_subj, i_blck});
  109. save(erfdata_erf, 'erf');
  110. save(erfdata_avg, 'avg');
  111. save(erfdata_raw, 'raw');
  112. end
  113. end
  114. %% Compute grand averages
  115. % Compute grand average ERF by condition
  116. Grand_Avg_ERF = cell(nConds, nTypes);
  117. for i_type = 1:nTypes
  118. for i_cond = 1:nConds
  119. Grand_Avg_ERF{i_cond, i_type} = ft_timelockgrandaverage([], AVG{:, i_cond, i_type});
  120. end
  121. end
  122. % Compute grand average ERF and RMS across channels
  123. Grand_AVG_ERF_across_channels = zeros(nConds, nTypes, nTimes);
  124. Grand_AVG_RMS_across_channels = zeros(nConds, nTypes, nTimes);
  125. for i_type = 1:nTypes
  126. for i_cond = 1:nConds
  127. Grand_AVG_ERF_across_channels(i_cond, i_type, :) = mean(Grand_Avg_ERF{i_cond, i_type}.avg);
  128. Grand_AVG_RMS_across_channels(i_cond, i_type, :) = rms(Grand_Avg_ERF{i_cond, i_type}.avg);
  129. end
  130. end
  131. % Compute grand average ERF and RMS across participants and word types
  132. GRAND_AVG_ERF = squeeze(mean(Grand_AVG_ERF_across_channels, [1 2]));
  133. GRAND_AVG_RMS = squeeze(mean(Grand_AVG_RMS_across_channels, [1 2]));
  134. %% Extract peak latencies
  135. % Windows of interest
  136. M200 = [0.170 0.250];
  137. M400 = [0.300 0.500];
  138. ERFs = [M200; M400];
  139. TOIs = zeros(nPeaks, 2);
  140. Peak = zeros(size(ERFs, 1), 1);
  141. % Loop through ERFs
  142. for i_peak = 1:nPeaks
  143. % Extract time boundaries for the current component
  144. l_bound = find(timeID == ERFs(i_peak, 1) * fSampl);
  145. r_bound = find(timeID == ERFs(i_peak, 2) * fSampl);
  146. % Restrict timecourse to time of interest
  147. rms_erf = GRAND_AVG_RMS(l_bound:r_bound);
  148. % Find maximum amplitude in the time window
  149. [m, ix] = max(rms_erf);
  150. peakLat = ix + l_bound;
  151. % Compute full width half max (FWHM) around the peak
  152. l_flank = fliplr(GRAND_AVG_RMS(1 : peakLat - 1)');
  153. r_flank = GRAND_AVG_RMS(peakLat + 1: end);
  154. l_nadir = find(diff(l_flank) > 0, 1);
  155. r_nadir = find(diff(r_flank) > 0, 1);
  156. bs_mean = mean([l_flank(l_nadir) r_flank(r_nadir)]);
  157. halfMax = m/2 + bs_mean;
  158. l_bound = find(l_flank < halfMax, 1);
  159. r_bound = find(r_flank < halfMax, 1);
  160. fwhm_ix = ((peakLat - l_bound : peakLat + r_bound) - 150) / fSampl;
  161. % Extrcat latency around the peak based on FWHM
  162. TOIs(i_peak, :) = [fwhm_ix(1) fwhm_ix(end)];
  163. Peak(i_peak) = (peakLat - 150) / 1000;
  164. end
  165. % Summarize
  166. RMS_latency = {TOIs, Peak, ERFs, ERFsID};
  167. RMS_average = GRAND_AVG_RMS;
  168. %% Save results
  169. % Save results
  170. save(fullfile(results_dir, 'RMS_latency.mat'), 'RMS_latency')
  171. save(fullfile(results_dir, 'RMS_average.mat'), 'RMS_average')
  172. %% Plot grand average rms
  173. % Open figure
  174. figure;
  175. % Plot grand average rms across all trials
  176. toi = TOIs(1, :) * 1000 - 150;
  177. lat = find(timeID >= toi(1) & timeID <= toi(2));
  178. l_bound = lat(1);
  179. r_bound = lat(end);
  180. rectangle('Position', [l_bound, 0, r_bound - l_bound, 50], ...
  181. 'FaceColor', [.9 .9 .9], 'EdgeColor', [.5 .5 .5], ...
  182. 'HandleVisibility', 'off'); hold on
  183. toi = TOIs(2, :) * 1000 - 150;
  184. lat = find(timeID >= toi(1) & timeID <= toi(2));
  185. l_bound = lat(1);
  186. r_bound = lat(end);
  187. rectangle('Position', [l_bound, 0, r_bound - l_bound, 50], ...
  188. 'FaceColor', [.9 .9 .9], 'EdgeColor', [.5 .5 .5], ...
  189. 'HandleVisibility', 'off');
  190. plot(timeID, GRAND_AVG_RMS * 1e15, 'black-', 'LineWidth', 2);
  191. title('Grand Average RMS', 'FontSize', 12, 'FontName', 'Arial', 'FontWeight', 'bold'); ylim([0 50])
  192. xlabel('Time (ms)', 'FontSize', 10, 'FontName', 'Arial', 'FontWeight', 'normal');
  193. ylabel('Magnetic field strength (fT)', 'FontSize', 10, 'FontName', 'Arial', 'FontWeight', 'normal');
  194. % Save figure
  195. fname = fullfile(figures_dir, 'grand_avg_rms.eps');
  196. exportgraphics(gcf, fname, 'ContentType', 'vector')
  197. fname = fullfile(figures_dir, 'grand_avg_rms.tiff');
  198. saveas(gcf, fname)

S05_01_01_compute_erf.m, no license · at the source

Overview

Authors: Lorenzo Titone1, Burkhard Maess2, Lars Meyer1,3,4
ORCID iDs: Lorenzo Titone
  1. Max Planck Research Group Language Cycles, Max Planck Institute for Human Cognitive and Brain Sciences, Leipzig, Germany
  2. Methods and Development Group Brain Networks, Max Planck Institute for Human Cognitive and Brain Sciences, Leipzig, Germany
  3. Department of English and Linguistics, Johannes Gutenberg University Mainz, Mainz, Germany
  4. Clinic for Phoniatrics and Pedaudiology, University Hospital Münster, Münster, Germany
Journal: iScience, volume 29, issue 7, article 116458
Dates: received 4 November 2025; accepted 2 June 2026; published online 24 June 2026
Type: Research article · Language: English
License: CC BY
Identifiers: DOI 10.1016/j.isci.2026.116458 · PMID 42389590 · PMCID PMC13320337 · OpenAlex W7165801358
Open access: gold, a free copy (OpenAlex)
Status: code verified (how the code is found and verified)
Categories: human (organism), cognitive (subfield)
Methods: Spectral & time-frequency, Statistics, Smoothing, state filtering, decompositions, Preprocessing, Evoked potentials, fMRI & imaging, Physiology & signal measures
Keywords: medical imaging, cognitive neuroscience, biocomputational method, high-performance computing in bioinformatics
Topic: Neuroscience and Music Perception (Cognitive Neuroscience, Neuroscience), according to OpenAlex
Funding: Max Planck Society; MPRG Language Cycles
Citations: not cited yet (Europe PMC); 85 references in the paper

Abstract

Neural tracking of prosodic and statistical patterns supports speech segmentation and word learning. Yet, acoustic and abstract patterns have proven difficult to dissociate empirically. Our study employs an artificial language learning paradigm generated with a method that orthogonalizes acoustic and statistical patterns in auditory stimuli. MEG recordings from 32 human adults who had been exposed to continuous syllable streams reveal distinct brain sources tracking periodic acoustic, prosodic, and statistical patterns. After encoding, M200 and M400 field responses to isolated trisyllabic chunks show that participants retained both prosodic and statistical patterns for learning pseudowords from the syllable streams. Behavioral data extend our findings, suggesting not only that integrating both acoustic and abstract patterns is critical to learning, but also that prior knowledge of the pseudowords is sufficient for recognition. The findings advance our understanding of the neural sources that encode and integrate acoustic and statistical patterns during and after language learning.

Reproduced under the paper's license (CC BY), from the paper cited above.

Repositories

Its files are read in the Code ↔ Paper reader above, with 21 matches between paragraphs and lines of code.

OSF qtrz9

License: none: the authors keep all their rights
State: the link answers, verified on 27 September 2026
Evidence: files inventoried
Languages: MATLAB (23), Python (5), R (4)
Size: 35 files, 32 scripts
Software Heritage: not checked
Found in: “Data and code availability”
Not found: README, license file, CITATION.cff, environment file, tests, continuous integration, documentation
Tools: FieldTrip (18 files), Statistics and Machine Learning Toolbox (5 files), emmeans (2 files), ggplot2 (2 files), lme4 (2 files), lmerTest (2 files), mgcv (2 files), NumPy (2 files), SciPy (2 files), tidyverse (2 files), Matplotlib (1 file), Psychtoolbox (1 file)
Availability: 1 check, the latest on 27 September 2026: the link answers (HTTP 200)
  • 27 September 2026: the link answers (HTTP 200)
32 files

milosen/alparc

License: MIT
State: the link answers, verified on 27 September 2026
Evidence: files inventoried
Commit: 8b83adc0848439bff86897eb412c1b8a693e37c5, 29 April 2026
Languages: Python (20), Jupyter (4)
Size: 51 files, 24 scripts
Software Heritage: not archived
Found in: the text, “Additional resources”
Holds: README, license file, environment (pyproject.toml, uv.lock), tests, 4 notebooks
Not found: CITATION.cff, continuous integration, documentation
Tools: NumPy (14 files), SciPy (4 files), pandas (3 files), Matplotlib (2 files), Pingouin (2 files), seaborn (2 files)
Availability: 1 check, the latest on 27 September 2026: the link answers
  • 27 September 2026: the link answers
26 files

The paper's code and data availability statement is in the Data section.

Tracing map

Proposed by the machine: these links were found in the paper and verified at the source, without human review. The map will receive a Zenodo DOI once one of the paper's authors has validated it with their ORCID.

What the map holds:

  • 2 repositories of the authors' code, each at its verified commit, with its license and how the link was found in the paper;
  • 56 scripts, each with its path and the digest of its content;
  • 21 matches between paragraphs of the paper and lines of the code (method lexical-v1);
  • neither the text of the paper nor the code itself.

Its JSON (tracing-map.json) is deposited on Zenodo with its DOI once the map is validated.

Data

Datasets cited

Data and code availability

• The original data reported in this study cannot be deposited in a public repository because of ethical restrictions. The aggregated data and summary statistics have been deposited at Zenodo and are publicly available as of the date of publication at: https://doi.org/10.5281/zenodo.17990155. • Stimuli and analysis code have been deposited at OSF and is publicly available as of the date of publication at https://doi.org/10.17605/OSF.IO/QTRZ9. • Any additional information required to reanalyze the data reported in this paper is available from the lead contact upon request.

Reproduced under the paper's license (CC BY), from the paper cited above.

Versions

The history of this record: each version stored by the harvester or made by a correction of its authors or of the maintainers of its code, and what changed in its facts. The texts of the paper (its abstract, its availability statements) are not part of it; versions that changed only those are not listed.

Version 2, 28 September 2026

  • Authors: added Lorenzo Titone (0009-0004-6442-6980); removed Lorenzo Titone

Version 1, 27 September 2026: the first record

Recorded: type, language, journal, volume, issue, pages, dates, 3 authors, 4 keywords, 2 funders, 77 references.

Cite

This paper

Titone, L., Maess, B., & Meyer, L. (2026). Neural tracking of prosodic and statistical rhythms jointly supports artificial language learning. iScience, 29(7), 116458. https://doi.org/10.1016/j.isci.2026.116458

BibTeX

@article{titone2026neural,
author = {Titone, Lorenzo and Maess, Burkhard and Meyer, Lars},
title = {{Neural tracking of prosodic and statistical rhythms jointly supports artificial language learning}},
journal = {iScience},
year = {2026},
month = jun,
volume = {29},
number = {7},
pages = {116458},
publisher = {Elsevier},
issn = {2589-0042},
doi = {10.1016/j.isci.2026.116458},
url = {https://doi.org/10.1016/j.isci.2026.116458},
pmid = {42389590},
pmcid = {PMC13320337}
}

RIS

TY - JOUR
AU - Titone, Lorenzo
AU - Maess, Burkhard
AU - Meyer, Lars
TI - Neural tracking of prosodic and statistical rhythms jointly supports artificial language learning
T2 - iScience
J2 - iScience
PY - 2026
DA - 2026/06/24
VL - 29
IS - 7
SP - 116458
SN - 2589-0042
PB - Elsevier
DO - 10.1016/j.isci.2026.116458
UR - https://doi.org/10.1016/j.isci.2026.116458
LA - en
ER -

CSL-JSON

{
"id": "10.1016/j.isci.2026.116458",
"type": "article-journal",
"title": "Neural tracking of prosodic and statistical rhythms jointly supports artificial language learning",
"container-title": "iScience",
"author": [
{
"family": "Titone",
"given": "Lorenzo"
},
{
"family": "Maess",
"given": "Burkhard"
},
{
"family": "Meyer",
"given": "Lars"
}
],
"container-title-short": "iScience",
"volume": "29",
"issue": "7",
"page": "116458",
"DOI": "10.1016/j.isci.2026.116458",
"PMID": "42389590",
"PMCID": "PMC13320337",
"ISSN": "2589-0042",
"publisher": "Elsevier",
"URL": "https://doi.org/10.1016/j.isci.2026.116458",
"language": "en",
"issued": {
"date-parts": [
[
2026,
6,
24
]
]
}
}

The tracing map gets a citation of its own once an author has validated it and it has a DOI.

Similar papers

The papers with a page that share the most with this one: the tools found in their code, their categories, datasets, cited references and authors, the rarest counting most.

[1] doi:10.1162/nol.a.249 [code]
How Low-Frequency Neural Activity Structures Language in Time.
Journal: Neurobiology of language (Cambridge, Mass.)
In common: emmeans, FieldTrip, lme4, 2 other tools, cognitive, 13 references
[2] doi:10.1002/aur.70312 [code]
Aberrant Neural Entrainment to Word-Level Speech Patterns in Fragile X Syndrome: Evidence for a Statistical Learning Deficit.
Journal: Autism research : official journal of the International Society for Autism Research
In common: Statistics and Machine Learning Toolbox, cognitive, 13 references
[3] doi:10.1038/s44271-025-00265-y [code]
Pre-stimulus beta power mediates explicit and implicit perceptual biases in distinct cortical areas.
Journal: Communications psychology
In common: Psychtoolbox, Pingouin, emmeans, 10 other tools, cognitive, 3 references
[4] doi:10.1038/s42003-025-09481-y [code]
Effects of speech periodicity and speech rate on auditory-motor coupling during speech comprehension.
Journal: Communications biology
In common: emmeans, FieldTrip, ggplot2, 2 other tools, cognitive, 9 references
[5] doi:10.1111/ejn.16581
Neural encoding of melodic expectations in music across EEG frequency bands.
Journal: The European journal of neuroscience
In common: cognitive, 9 references, author Lorenzo Titone
[6] doi:10.1093/cercor/bhac094 [code]
Expectations boost the reconstruction of auditory features from electrophysiological responses to noisy speech.
Journal: Cerebral cortex (New York, N.Y. : 1991)
In common: emmeans, FieldTrip, lme4, 2 other tools, cognitive, 9 references
[7] doi:10.1371/journal.pone.0320519 [code]
Anatomically distinct cortical tracking of music and speech by slow (1-8Hz) and fast (70-120Hz) oscillatory activity.
Journal: PloS one
In common: emmeans, FieldTrip, lmerTest, 3 other tools, cognitive, 6 references
[8] doi:10.1007/s42113-025-00237-9 [code]
What's Surprising About Surprisal.
Journal: Computational brain & behavior
In common: Pingouin, seaborn, pandas, 3 other tools, 7 references
[9] doi:10.1038/s41598-024-67153-z [code]
Structural and sequential regularities modulate phrase-rate neural tracking.
Journal: Scientific reports
In common: emmeans, FieldTrip, lmerTest, 6 other tools, cognitive, 4 references
[10] doi:10.1371/journal.pone.0305333
Chunk boundaries disrupt dependency processing in an AG: Reconciling incremental processing and discrete sampling.
Journal: PloS one
In common: cognitive, 10 references

Contribute

The authors of this paper can claim it, correct its record and validate its tracing map, and the maintainers of its code (its owner, or a public member of its organization) correct what it says of their repository; anyone signed in can ask for its removal. Every request goes to OSCR's own machine, which answers it; your account page follows them.

Sign in with ORCID to claim this paper as one of its authors, correct its record or validate its tracing map: when the paper's metadata lists your ORCID iD, you are recognized at once. Maintainers of its code: sign in with GitHub, then claim the repository on your account page.

Add the badge to the code's README

OSCR: the badge of this paper

If you are an author or a maintainer of this paper's code, you can add this badge. It says what OSCR knows of the paper (its code, its validated tracing map) and links the code to this page. Paste one of these snippets under the README's title. Keep the two marks around it, so that the badge can be replaced in place and is never added twice. OSCR changes nothing in your repository.

Markdown
<!-- oscr-badge:start -->
[![OSCR](https://openscicode.org/badge/doi/10.1016/j.isci.2026.116458.svg)](https://openscicode.org/badge/doi/10.1016/j.isci.2026.116458)
<!-- oscr-badge:end -->
reStructuredText
.. oscr-badge:start

.. image:: https://openscicode.org/badge/doi/10.1016/j.isci.2026.116458.svg
   :target: https://openscicode.org/badge/doi/10.1016/j.isci.2026.116458
   :alt: OSCR

.. oscr-badge:end
HTML
<!-- oscr-badge:start -->
<a href="https://openscicode.org/badge/doi/10.1016/j.isci.2026.116458"><img src="https://openscicode.org/badge/doi/10.1016/j.isci.2026.116458.svg" alt="OSCR"></a>
<!-- oscr-badge:end -->

On GitHub, open the README, choose Edit (the pencil), paste the snippet under the title, then "Commit changes".

If you choose to, you can have the badge kept up to date for you, with oscr badge --write from the command line or with the GitHub Action in your repository's workflows. Every other form and option (a card, AsciiDoc, LaTeX, shields.io) is on the badge page.

Request its removal

To ask OSCR to remove this record, the copies of its authors' scripts or its tracing map, use the removal request page: signed in, you say who you are, what to remove and why, then review and confirm the request. Published rules decide every request (how).

Discussion, reproductions, activity

Discussion: code errors and mismatches between the code and the paper about this paper and its code, from readers and its authors, beside the paper and its tracing map.

Report a mismatch between the code and the paper · Report a code error (signed in)

Reproductions: reports from readers who ran the authors' code and did not get the paper's result, what they ran, with which environment, commit and data.

Report a reproduction failure (signed in)

Versions of its code: the releases of its code tied to a version of this paper (the preprint, the accepted manuscript, the version of record…), each with the tracing map versioned with it.

Activity: what happens around this paper: new versions of its record, its map's validation, discussions and reproductions. It opens with sign-in.