MétaCan
Menu
Back to cohort
Record W2119136420 · doi:10.1080/01449290110069400

Optimizing the reading of electronic text using rapid serial visual presentation

2001· article· en· W2119136420 on OpenAlexafffund
Monica S. Castelhano, Paul Muter

Bibliographic record

VenueBehaviour and Information Technology · 2001
Typearticle
Languageen
FieldSocial Sciences
TopicMultimedia Communication and Technology
Canadian institutionsUniversity of Toronto
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsPunctuationRapid serial visual presentationSentenceComputer scienceReading (process)PreferencePresentation (obstetrics)Word (group theory)Focus (optics)Speech recognitionArtificial intelligencePsychologyLinguisticsCognitionNeuroscienceMedicineMathematics

Abstract

fetched live from OpenAlex

The focus on communications technology in recent years has led to the question of how to best display electronic text onto small-screened devices. Past studies have shown that the compact method of rapid serial visual presentation (RSVP) is efficient but not well liked. Two experiments were conducted to explore ways of improving the preference for and feasibility of RSVP. In experiment 1, the effects of a completion meter, punctuation pauses, and variable word duration were studied. Although the sentence-by-sentence and normal page formats were still superior, post-experiment ratings indicated that punctuation pauses improved user preference for RSVP, and its preference increased in general with practice. In experiment 2, a modified RSVP condition included a completion meter, punctuation pauses, interruption pauses and pauses at clause boundaries. This condition was significantly preferred to a normal RSVP condition. The present enhancements may increase the feasibility of using RSVP with small displays.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.002
metaresearch head score (Gemma)0.012
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Observational · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.004
Threshold uncertainty score0.013

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.012
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.001
Science and technology studies0.0000.000
Scholarly communication0.0010.002
Open science0.0010.000
Research integrity0.0010.000
Insufficient payload (model declined to judge)0.0040.001

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.021
GPT teacher head0.333
Teacher spread0.312 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designObservational
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations68
Published2001
Admission routes2
Has abstractyes

Explore more

Same venueBehaviour and Information TechnologySame topicMultimedia Communication and TechnologyFrench-language works237,207