From lojban+bncCK7Yk5CUCxDlkp3zBBoEIElOaA@googlegroups.com Wed Sep 07 03:37:36 2011 Received: from mail-qy0-f189.google.com ([209.85.216.189]) by chain.digitalkingdom.org with esmtp (Exim 4.72) (envelope-from ) id 1R1FVd-0005VM-BX; Wed, 07 Sep 2011 03:37:36 -0700 Received: by qyk33 with SMTP id 33sf5986288qyk.16 for ; Wed, 07 Sep 2011 03:37:26 -0700 (PDT) DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=googlegroups.com; s=beta; h=x-beenthere:received-spf:mime-version:in-reply-to:message-id:date :subject:from:to:x-original-sender:x-original-authentication-results :reply-to:precedence:mailing-list:list-id:x-google-group-id :list-post:list-help:list-archive:sender:list-subscribe :list-unsubscribe:content-type; bh=uog1q+loKPf6beAlwZ+5fmQAKLLOHX+OP+kQdMNLS3A=; b=pbQPkNS+t+cAdZu/RuvJoJ2YSVWKpQTFii7SvgI++ivSULoljfLP3MN8HGQO+GRTfC m6q3SyfUqojKqFLQR7FovsdPzHPvvdUmEQL+VvNyFyzCtvbCy/AcAt3f4RS6DuGM5Pzj tQNOrFEOamNNwNZrnEUBzlJ2isEJk0mlMyNCM= Received: by 10.229.64.197 with SMTP id f5mr553422qci.46.1315391845203; Wed, 07 Sep 2011 03:37:25 -0700 (PDT) X-BeenThere: lojban@googlegroups.com Received: by 10.224.44.197 with SMTP id b5ls2733368qaf.2.gmail; Wed, 07 Sep 2011 03:37:24 -0700 (PDT) Received: by 10.224.33.211 with SMTP id i19mr3812430qad.22.1315391844471; Wed, 07 Sep 2011 03:37:24 -0700 (PDT) Received: by 10.224.33.211 with SMTP id i19mr3812429qad.22.1315391844462; Wed, 07 Sep 2011 03:37:24 -0700 (PDT) Received: from mail-qw0-f72.google.com (mail-qw0-f72.google.com [209.85.216.72]) by gmr-mx.google.com with ESMTPS id r3si8820510qcz.3.2011.09.07.03.37.24 (version=TLSv1/SSLv3 cipher=OTHER); Wed, 07 Sep 2011 03:37:24 -0700 (PDT) Received-SPF: pass (google.com: domain of rdentato@gmail.com designates 209.85.216.72 as permitted sender) client-ip=209.85.216.72; Received: by qwa26 with SMTP id 26so79372qwa.3 for ; Wed, 07 Sep 2011 03:37:24 -0700 (PDT) MIME-Version: 1.0 Received: by 10.101.131.27 with SMTP id i27mr5135522ann.35.1315391844219; Wed, 07 Sep 2011 03:37:24 -0700 (PDT) In-Reply-To: <4E6744CE.5000203@lojban.org> Message-ID: <0016e6d3878a9d815804ac578789@google.com> Date: Wed, 07 Sep 2011 10:37:24 +0000 Subject: Re: Re: [lojban] tosmabru test From: rdentato@gmail.com To: lojban@googlegroups.com X-Original-Sender: rdentato@gmail.com X-Original-Authentication-Results: gmr-mx.google.com; spf=pass (google.com: domain of rdentato@gmail.com designates 209.85.216.72 as permitted sender) smtp.mail=rdentato@gmail.com Reply-To: lojban@googlegroups.com Precedence: list Mailing-list: list lojban@googlegroups.com; contact lojban+owners@googlegroups.com List-ID: X-Google-Group-Id: 1004133512417 List-Post: , List-Help: , List-Archive: Sender: lojban@googlegroups.com List-Subscribe: , List-Unsubscribe: , Content-Type: multipart/alternative; boundary=0016e6d3878a9d814204ac578786 --0016e6d3878a9d814204ac578786 Content-Type: text/plain; charset=ISO-8859-1; format=flowed; delsp=yes On , "Bob LeChevalier, President and Founder - LLG" wrote: > Remo Dentato wrote: > Reviewing what others have written, I will say that the answer is "yes > and no", with the technical purist answer being "no". > At one time Pierre and my wife Nora were working on a generalized > word-breakdown algorithm, but the effort stalled out, and I don't know if > anyone has worked on such a thing in the last couple of years. Nora's > last effort *may* have been satisfactory, but we never found a practical > way to test the algorithm, and I think there were open issues left > undecided. There is no name for the generalized algorithm (which would > break down any text string marked for stress uniquely. Is the description of the algorithm available somewhere? I now use a very rough test to check that a "word" can't be broken as a CMAVO+BRIVLA and for slinkuhi that it's "Craf3*(gim?$|raf4?y)" but not "raf3*(gim?$|raf4?y)", I might get some inspiration by reading Nora & Pierre Algorithm. remod -- You received this message because you are subscribed to the Google Groups "lojban" group. To post to this group, send email to lojban@googlegroups.com. To unsubscribe from this group, send email to lojban+unsubscribe@googlegroups.com. For more options, visit this group at http://groups.google.com/group/lojban?hl=en. --0016e6d3878a9d814204ac578786 Content-Type: text/html; charset=ISO-8859-1 Content-Transfer-Encoding: quoted-printable On , "Bob LeChevalier, President and Founder - LLG" <lojbab@lo= jban.org> wrote:
> Remo Dentato wrote:
>
> Revi= ewing what others have written, I will say that the answer is "yes and= no", with the technical purist answer being "no".
>=
> At one time Pierre and my wife Nora were working on a generaliz= ed word-breakdown algorithm, but the effort stalled out, and I don't kn= ow if anyone has worked on such a thing in the last couple of years. Nora&#= 39;s last effort *may* have been satisfactory, but we never found a practic= al way to test the algorithm, and I think there were open issues left undec= ided. =A0There is no name for the generalized algorithm (which would break = down any text string marked for stress uniquely.
>

Is t= he description of the algorithm available somewhere?
I now use a very = rough test to check that a "word" can't be broken as a CMAVO+= BRIVLA and for slinkuhi that it's "Craf3*(gim?$|raf4?y)" but = not "raf3*(gim?$|raf4?y)", I might get some inspiration by readin= g Nora & Pierre Algorithm.

remod

--
You received this message because you are subscribed to the Google Groups "= lojban" group.
To post to this group, send email to lojban@googlegroups.com.
To unsubscribe from this group, send email to lojban+unsubscribe@googlegrou= ps.com.
For more options, visit this group at http://groups.google.com/group/lojban= ?hl=3Den.
--0016e6d3878a9d814204ac578786--