WikiDiscuss

WikiDiscuss


PEG Morphology Algorithm

posts: 14214

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.

-Robin