From 6cf17e00666275978573aae4fdac175dc7d7ab1a Mon Sep 17 00:00:00 2001 From: Kinneyzhang Date: Sat, 24 Jan 2026 22:46:48 +0800 Subject: [PATCH] update knuth-plass paper link --- readme.md | 4 ++-- readme_zh.md | 4 ++-- 2 files changed, 4 insertions(+), 4 deletions(-) diff --git a/readme.md b/readme.md index 3a2a160..c1e9a28 100644 --- a/readme.md +++ b/readme.md @@ -12,7 +12,7 @@ Emacs-kp implements the Knuth-Plass optimal line breaking algorithm with full su ### The Knuth-Plass Algorithm -The algorithm is based on the seminal 1981 paper ["Breaking Paragraphs into Lines"](http://www.eprg.org/G53DOC/pdfs/knuth-plass-breaking.pdf) by Donald Knuth and Michael Plass. Unlike greedy line-breaking (used by most text editors), K-P considers **all possible breakpoints** simultaneously to find the globally optimal solution. +The algorithm is based on the seminal 1981 paper ["Breaking Paragraphs into Lines"](https://gwern.net/doc/design/typography/tex/1981-knuth.pdf) by Donald Knuth and Michael Plass. Unlike greedy line-breaking (used by most text editors), K-P considers **all possible breakpoints** simultaneously to find the globally optimal solution. #### Core Concepts @@ -167,6 +167,6 @@ Clear all paragraph caches. ## Credits -- Core algorithm: ["Breaking Paragraphs into Lines"](http://www.eprg.org/G53DOC/pdfs/knuth-plass-breaking.pdf) by Donald E. Knuth and Michael F. Plass (1981) +- Core algorithm: ["Breaking Paragraphs into Lines"](https://gwern.net/doc/design/typography/tex/1981-knuth.pdf) by Donald E. Knuth and Michael F. Plass (1981) - Hyphenation: Adapted from [Pyphen](https://github.com/Kozea/Pyphen), using Liang's algorithm - Dictionaries: [Hunspell hyphenation patterns](https://github.com/Kozea/Pyphen) diff --git a/readme_zh.md b/readme_zh.md index 3bc7e78..a1ef712 100644 --- a/readme_zh.md +++ b/readme_zh.md @@ -10,7 +10,7 @@ Emacs-kp 实现了 Knuth-Plass 最优断行算法，并扩展支持 CJK（中日 ### Knuth-Plass 算法 -本算法基于 Donald Knuth 和 Michael Plass 于 1981 年发表的经典论文 ["Breaking Paragraphs into Lines"](http://www.eprg.org/G53DOC/pdfs/knuth-plass-breaking.pdf)。与大多数文本编辑器使用的贪心断行不同，K-P 算法**同时考虑所有可能的断点**，寻找全局最优解。 +本算法基于 Donald Knuth 和 Michael Plass 于 1981 年发表的经典论文 ["Breaking Paragraphs into Lines"](https://gwern.net/doc/design/typography/tex/1981-knuth.pdf)。与大多数文本编辑器使用的贪心断行不同，K-P 算法**同时考虑所有可能的断点**，寻找全局最优解。 #### 核心概念 @@ -165,6 +165,6 @@ Emacs-kp 为 CJK 文本扩展了原算法： ## 致谢 -- 核心算法：Donald E. Knuth 和 Michael F. Plass 的论文 ["Breaking Paragraphs into Lines"](http://www.eprg.org/G53DOC/pdfs/knuth-plass-breaking.pdf)（1981） +- 核心算法：Donald E. Knuth 和 Michael F. Plass 的论文 ["Breaking Paragraphs into Lines"](https://gwern.net/doc/design/typography/tex/1981-knuth.pdf)（1981） - 断词算法：改编自 [Pyphen](https://github.com/Kozea/Pyphen)，使用 Liang 算法 - 词典：[Hunspell 断词模式](https://github.com/Kozea/Pyphen)