On 03/06/2011 12:52 AM, Stephan Hennig wrote:
schrieb Philipp Stephani:
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."
Which, once more, is a rather terse description. I guess, the "finite
state" (automaton) part refers to a trie with pre-calculated fall-back
transitions.
Almost. It refers to a hash with pre-calculated fall-back transitions
(both hash and trie are words for actual data structures).
Best wishes,
Taco
