[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [lojban] tosmabru test
rdentato@gmail.com wrote:
On , "Bob LeChevalier, President and Founder - LLG" <lojbab@lojban.org>
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.
http://www.lojban.org/tiki/Dictionaries,+Glossers+and+parsers
under "old software" has a link to both the algorithm and the
Turbopascal program Nora wrote to implement it.
She and Pierre may have advanced the state of the art beyond that point
(but any changes would be minor), but unless Pierre speaks up, I'll
have to wait until Nora is home to ask whether that is absolutely
current (to the extent that anything 20 years old is "current").
lojbab
--
Bob LeChevalier lojbab@lojban.org www.lojban.org
President and Founder, The Logical Language Group, Inc.
--
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.