WikiDiscuss

WikiDiscuss


PEG Morphology Algorithm

posts: 14214

On Tue, Dec 21, 2004 at 06:12:38PM -0800, Clark & Janiece Nelson
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.
>
> Actually, that's the problem with doing it *in a single PEG
> grammar*, which is what I'm suggesting that we not do.

It's not a problem in *either* case. Pierre is stuck on it because
he, apparently, can't think in terms of string-wise decomposition
rather than algorithmics. I've got 6600 lines of comparison output
between his parser and the PEG one, and I see no evidence that this
"problem" is a problem.

-Robin