Bruno Mascret schrieb:
Hi Michael,
The patterns are regex indicating where a substring can be cut.
Only odd numbers (1 and 3) are valid hyphens.
If a regex matches a region of the word, this region is replaced with
the pattern.
At the end, for each position, only the max number is kept, and if
this number is odd then it gives an hyphen.
I see. A clever algorithm. And it all depends on the quality of the
patterns.
For more explanations, you may read this article in English (only the
first part concerns Liang algorythm):
http://www.tug.org/TUGboat/Articles/tb27-1/tb86nemeth.pdf
Interesting. Thanks!
--
Michael Ludwig
--~------------------------------------------------------------------
XSL-List info and archive: http://www.mulberrytech.com/xsl/xsl-list
To unsubscribe, go to: http://lists.mulberrytech.com/xsl-list/
or e-mail: <mailto:xsl-list-unsubscribe(_at_)lists(_dot_)mulberrytech(_dot_)com>
--~--