Am 05.03.2011 19:24, schrieb Manuel Pégourié-Gonnard: > Le 05/03/2011 18:22, Stephan Hennig a écrit : >> AFAIK, LuaTeX uses a more complex trie with pre-calculated fall-back >> states. > > I wasn't aware of that, good to know.
Actually the manual (§6.4) states "First and foremost, there is no ‘compressed trie' involved in hyphenation. The algorithm still reads patgen-generated pattern files, but LuaTEX uses a finite state hash to match the patterns against the word to be hyphenated."
