Hyphenation algorithm

A hyphenation algorithm is a set of rules (especially one codified for implementation in a computer program) that decides at which points a word can be broken over two lines with a hyphen. For example, a hyphenation algorithm might decide that impeachment can be broken as impeach-ment or im-peachment, but not, say, as impe-achment.

One of the reasons for the complexity of the rules of word-breaking is that different "dialects" of English tend to differ on the rule: American English tends to work on sound, while British English tends to look to the origins of the word and then to sound. There are also a large number of exceptions, which further complicates matters.

Some rules of thumb can be found in the reference "On Hyphenation – Anarchy of Pedantry". Among algorithmic approaches to hyphenation, the one implemented in the TeX typesetting system is widely used. It is thoroughly documented in the first two volumes of Computers and Typesetting and in Frank Liang's dissertation.[1] Contrary to the belief that TeX relies on a large dictionary of exceptions, the point of Liang's work was to get the algorithm as accurate as he practically could and keep any exception dictionary small. In TeX's original hyphenation patterns for US English, the exception list contains fourteen words.[2]

Hyphenation in TeX

Ports of the TeX hyphenation algorithm are available as libraries for several programming languages, including Perl, Ruby, Haskell, Python, and PostScript, and TeX itself can be made to show hyphens in the log by using the \showhyphens command.

(The result of \showhyphens looks as if it could be used for associating lyrics with musical notes, but that's a different problem. It might be better approximated by building a new dictionary from a word list populated from existing lyrics, and running TeX with \lefthyphenmin=1 and \righthyphenmin=1.)

In LaTeX hyphenation correction can be added by user using:

\hyphenation{words}

The \hyphenation command declares allowed hyphenation points, where words is a list of words, separated by spaces, in which each hyphenation point is indicated by a - character. For example

\hyphenation{fortran er-go-no-mic}

declares that in the current job "fortran" should not be hyphenated, and that if "ergonomic" must be hyphenated, it will be at one of the indicated points.[3]

However, there are several limitations. For example, the stock \hyphenation command only accepts ASCII letters (by default), so it cannot be used to correct hyphenation for words with non-ASCII characters (e.g. ä, ö, ü, é, è, à, ç, etc.) which are very common in almost all languages except English. Simple workarounds exist, however.[4]

References

  1. ↑ Liang, Franklin Mark. "Word Hy-phen-a-tion by Com-pu-ter". PhD dissertation, Stanford University Department of Computer Science. Report number STAN-CS-83-977, August 1983.
  2. ↑ "The Plain TeX hyphenation tables". Retrieved June 23, 2009.
  3. ↑ \hyphenation on Hypertext Help with LaTeX
  4. ↑ TeX FAQ: Accented words aren’t hyphenated, ibid How does hyphenation work in TeX? and references therein

External links