Pagination: It's what you say, not how long it takes to say it

Joshua M. Hailpern, Niranjan Damera Venkata, Marina Danilevsky

Abstract

Pagination—the process of determining where to break an article across pages in a multi-article layout—is a common layout challenge for most commercially printed newspapers and magazines. To date, no one has created an algorithm that determines a minimal pagination break point based on the content of the article. Existing approaches for automatic multi-article layout focus exclusively on maximizing content and optimizing aesthetic presentation. However, disregarding semantic information can lead to overly aggressive cutting or superfluous content. This work presents a new approach using statistical language models to predict minimal break points based on semantic content. Comparing four novel approaches against four baselines, results show that a semantic-based approach strongly outperforms standard methods.

Introduction: The Content-Agnostic Problem

In digital and print media, "pagination" involves breaking long articles so a teaser appears on a primary page while the rest is continued elsewhere. While professional editors balance aesthetics with information density manually, automated layout engines are typically "content-agnostic." They prioritize spatial efficiency or visual spacing, often relying on arbitrary rules like "show the first two sentences" or "show the first 20%."

The authors argue that these "dumb" rules fail to account for the complexity of the content. A two-sentence break might suffice for a weather update but leave a political analysis unintelligible. The goal is to define a "Lower Bound Break Point"—the minimum amount of text required for a reader to grasp the core story before the narrative delves into fine details.

Methodology: Semantic-Based Approaches

The researchers developed two primary semantic approaches to identify this lower bound:

1. Keyword Novelty

This method assumes a reader needs exposure to a specific threshold of "key concepts." Using Singular Value Decomposition (SVD) on a sentence-word matrix, the algorithm identifies central nouns. By plotting the cumulative weight of new keywords as the reader progresses, the system identifies an inflection point where the rate of new information begins to level off.

Cumulative keyword novelty in World News articles, illustrating the inflection point logic.

2. Statistical Language Modeling (SLM)

This approach treats the full article (or a related corpus) as an "ideal" distribution of information. Using Dirichlet Prior Smoothing, the model compares the "seen" text to this ideal distribution using KL-Divergence. The algorithm identifies "jumps" in the data—sentences that significantly reduce the information gap between the snippet and the full story.

KL Divergence and Standard Deviation across various news categories, showing the 'jumps' in information density used by the SLM approach.

Both methods were tested in Article mode (comparing a snippet to its own full text) and Corpus mode (comparing a snippet to a broader collection of 100 related articles).

Results and Insights

The study utilized a "Master Dataset" of over 184,000 articles from Google News across seven categories. Human evaluators rated snippets on a 7-point scale (1 = Missing Information, 4 = Balanced, 7 = Excess Text).

  • SLM Corpus Superiority: The SLM Corpus model was the most effective, with a mean score of 4.18, the closest to the "Balanced" ideal. By comparing an article to a broader topic, the algorithm successfully distinguished central themes from author-specific "fluff."
  • Baseline Failure: Industry-standard baselines like "First Sentence" (1.78) and "First Two Sentences" (2.47) were rated as significantly too short, often leaving readers confused.
  • Keyword Novelty Over-inclusion: While better than baselines, the SVD-based Keyword Novelty approaches tended to be too generous, with scores between 5.5 and 5.8, including more text than strictly necessary for a minimal break.
  • Subjectivity of "Best": A secondary study found that humans rarely agree on a single "best" break point (only 6.7% consensus). This reinforces the need for a semantic "floor" rather than a single target point.

Conclusion

This research demonstrates that content-aware logic is essential for high-quality automated publishing. While layout engines traditionally prioritize "form" (aesthetics), "function" (comprehension) must serve as the primary constraint. Future work involves integrating these semantic lower bounds into active layout engines and measuring quality through real-world engagement metrics like click-through rates.

Summary updated

Abstract

Pagination - the process of determining where to break an article across pages in a multi-article layout is a common layout challenge for most commercially printed newspapers and magazines. To date, no one has created an algorithm that determines a minimal pagination break point based on the content of the article. Existing approaches for automatic multi-article layout focus exclusively on maximizing content (number of articles) and optimizing aesthetic presentation (e.g., spacing between articles). However, disregarding the semantic information within the article can lead to overly aggressive cutting, thereby eliminating key content and potentially confusing the reader, or setting too generous of a break point, thereby leaving in superfluous content and making automatic layout more difficult. This is one of the remaining challenges on the path from manual layouts to fully automated processes that still ensure article content quality. In this work, we present a new approach to calculating a document minimal break point for the task of pagination. Our approach uses a statistical language model to predict minimal break points based on the semantic content of an article. We then compare 4 novel candidate approaches, and 4 baselines (currently in use by layout algorithms). Results from this experiment show that one of our approaches strongly outperforms the baselines and alternatives. Results from a second study suggest that humans are not able to agree on a single "best" break point. Therefore, this work shows that a semantic-based lower bound break point prediction is necessary for ideal automated document synthesis within a real-world context.
BibTeX
@inproceedings{hailpern2014pagination,
  author = {Joshua M. Hailpern and Niranjan Damera Venkata and Marina Danilevsky},
  title = {{Pagination: It's what you say, not how long it takes to say it}},
  booktitle = {ACM Symposium on Document Engineering},
  year = {2014},
  url = {https://openreview.net/forum?id=gklDu4OBiz_},
}
Figure