paper-with-me

홈 › Papers

Do readers use character information when programming return-sweep saccades?

2019-11-02 · Martin R. Vasilev, Victoria I. Adedeji, Calvin Laursen, Marcin Budka, Timothy J. Slattery

Reading saccades that occur within a single line of text are guided by the size of letters. However, readers occasionally need to make longer saccades (known as return-sweeps) that take their eyes from the end of one line of text to the beginning of the next. In this study, we tested whether return-sweep saccades are also guided by font size information and whether this guidance depends on visual acuity of the return-sweep target area. To do this, we manipulated the font size of letters (0.29 vs 0.39 deg. per character) and the length of the first line of text (16 vs 26 deg.). The larger font resulted in return-sweeps that landed further to the right of the line start and in a reduction of under-sweeps compared to the smaller font. This suggests that font size information is used when programming return-sweeps. Return-sweeps in the longer line condition landed further to the right of the line start and the proportion of under-sweeps increased compared to the short line condition. This likely reflects an increase in saccadic undershoot error with the increase in intended saccade size. Critically, there was no interaction between font size and line length. This suggests that when programming return-sweeps, the use of font size information does not depend on visual acuity at the saccade target. Instead, it appears that readers rely on global typographic properties of the text in order to maintain an optimal number of characters to the left of their first fixation on a new line.

📄 PDF Abstract BibTeX arXiv:1911.00716

Code (1)

martin-vasilev/Text_Font 공식 구현

Similar Papers 제목 키워드 기반

Machine Reading Comprehension: Generative or Extractive Reader?

2021-09-17 · ACL ARR September 2021 9 · Anonymous

While both extractive and generative readers have been successfully applied to the Question Answering (QA) task, little attention has been paid toward the comparison of these two readers. Which reader performs better? Wh…

DecoderLanguage ModelingLanguage ModellingMachine Reading Comprehension+3

Personalized Prediction of Offensive News Comments by Considering the Characteristics of Commenters

2022-12-26 · Teruki Nakahara, Taketoshi Ushiama

When reading news articles on social networking services and news sites, readers can view comments marked by other people on these articles. By reading these comments, a reader can understand the public opinion about the…

ArticlesDiversity

Dynamic Programming: Finite States

2024-01-19 · Thomas J. Sargent, John Stachurski

This book is about dynamic programming and its applications in economics, finance, and adjacent fields. It brings together recent innovations in the theory of dynamic programming and provides applications and code that c…

When You Must Forget: beyond strong persistence when forgetting in answer set programming

2017-07-17 · Ricardo Gonçalves, Matthias Knorr, João Leite, Stefan Woltran

Among the myriad of desirable properties discussed in the context of forgetting in Answer Set Programming (ASP), strong persistence naturally captures its essence. Recently, it has been shown that it is not always possib…

Open-Ended Question Answering

Unsatisfiable Cores for Constraint Programming

2013-05-08 · Nicholas Downing, Thibaut Feydy, Peter J. Stuckey

Constraint Programming (CP) solvers typically tackle optimization problems by repeatedly finding solutions to a problem while placing tighter and tighter bounds on the solution cost. This approach is somewhat naive, espe…