PEG Morphology Algorithm
>> All brivla have the following properties:
>> 1) always end in a vowel;
>> 2) always contain a consonant pair in the first five letters, where "y"
>> and
>> apostrophe are not counted as letters for this purpose;
>> 3) always are stressed on the next-to-last (penultimate) syllable; this
>> implies that they have two or more syllables.
>>
>> I always assumed this to be definitive, rather than descriptive:
>
> That is true (I changed 2 slightly to "its second consonant is always
> part of a cluster", but the point is the same). Those are properties
> that all brivla have, but not everything with those properties is
> a brivla.
I think I see. The above is the definition of "brivla-form" (not "brivla").
A word that matches "brivla-form" may be a gismu, lujvo, fu'ivla, or
invalid. The are some simple validity tests that can be applied to a
brivla-form that do not require characterization, but full validation can't
be done without characterization.
But I still don't see why a word-partitioning parser, which has to deal with
more word-forms and therefore needs additional complexity, couldn't use the
simple brivla-form definition, and thereby reduce point-complexity.
Clark