Subject: [lojban] Re: valfendi algorithm

From: Pierre Abbat <[email-masked]>
Date: Thu, 23 Jan 2003 21:37:23 -0500

On Thursday 23 January 2003 20:22, Robin Lee Powell wrote:
> On Thu, Jan 23, 2003 at 06:32:18PM -0500, Pierre Abbat wrote:
li'o
> > Theorem: If two lerpoi R and S which both lack 'y' are such that for
> > all i R[i:i+1]
>
> That's the string of lerpoi in R from index i to index i+1, yes?

Yes.

> > is a valid initial consonant pair, valid consonant pair, valid lujvo
> > diphthong, fa'u
>
> Seems like .a would work there just fine.
>
> > valid fu'ivla diphthong iff S[i:i+1],
>
> I'm sorry, it stopped making sense for me there. iff what about
> S[i:i+1]?

S[i:i+1] is a valid initial consonant pair, valid consonant pair, valid lujvo 
diphthong, fa'u fu'ivla diphthong. Sorry for the ellipsis.

> > Please send me any test data you can think of. This should be Lojban
> > or not-quite-Lojban text with words run together and stress indicated,
>
> I don't personally feel up to the challenge of constructing things that
> will trip *you* up.

You might, once you try the program.

phma