WikiDiscuss

WikiDiscuss


PEG Morphology Algorithm

On Tuesday 21 December 2004 20:46, Robin Lee Powell wrote:
> On Tue, Dec 21, 2004 at 08:36:31PM -0500, Pierre Abbat wrote:
> > The problem with doing it in PEG is that it appears to be
> > impossible to check that a string matches two different PEs with
> > the same number of characters matched for both. That's why every
> > selma'o PE ends with checking for a space or consonant, even
> > though "cmavo" already checked for that.
>
> 1. I have no idea what that has to do with the rest of the
> conversation.
>
> 2. So what? It works quite well, you'll notice.

In cmavo, yes. But when you consider lujvo and fu'ivla, especially lujvo with
fu'ivla rafsi in them, you have to check whether the y-hyphens are necessary
and whether something can be decomposed into rafsi with or without a
consonant at the front removed, and the end of the brivla is marked, not by
something simple such as a consonant, but by the stress, with an unstressed
syllable (or two, if there's a 'y' present) after the stressed one.

phma
--
Now I need a magnifier to find my eyeglasses!
-Les Perles de la médecine