>> > > I wish I could calculate the theoretical limits to settle that > >
>> question. All I know is the difficulty which I have experienced > > in
>> creating a sorting algorythm for the language. There are five > >
>> levels of dependencies with up to 35 members in each dependency. > >
>> Of course the real language does not have all combinations but > > the
>> variations are enough that a simple dictionary lookup does > > not seem
>> practical.
Norbert> I do not know anything about the theoretical limit of glyph
Norbert> numbers in Khmer, but I know a count in Alain Daniel's dictionary
Norbert> showed that it contains about 2400 Khmer glyphs - just to show
Norbert> the range involved.
According to Yannis Haralambous' paper on Khmer typesetting, there can
theoretically be 535060 consonantal clusters, but Alain Daniel's dictionary
contains 2821 different consonantal clusters out of 25000 entries. He also
includes a paper listing all the consonantal clusters in "complexes.ps" at the
ftp site below.
ftp://ftp.ens.fr/pub/tex/yannis/khmer/khmerpaper.ps.gz
ftp://ftp.ens.fr/pub/tex/yannis/khmer/complexes.ps
-----------------------------------------------------------------------------
mleisher@crl.nmsu.edu
Mark Leisher "A designer knows he has achieved perfection
Computing Research Lab not when there is nothing left to add, but
New Mexico State University when there is nothing left to take away."
Box 30001, Dept. 3CRL -- Antoine de Saint-Exup'ery
Las Cruces, NM 88003
This archive was generated by hypermail 2.1.2 : Tue Jul 10 2001 - 17:20:33 EDT