Remo Dentato wrote:
On Tue, Sep 6, 2011 at 9:35 PM, Luke Bergen <lukeabergen@gmail.com> wrote:I believe it would fail even before then due to {oa} not being a valid vowel combinationLet's generalize the question, I'm bad at examples :) "do the tosmabru test apply to any (apparent) 'word' that could, instead, be broken in a cmavo+brivla"?
Reviewing what others have written, I will say that the answer is "yes and no", with the technical purist answer being "no".
The tosmabru test itself is DEFINED to apply only to lujvo of certain word-forms, and says that lujvo whose CV at the beginning might fall off leading to ambiguity are forbidden.
BUT, a possibly fu'ivla which could have a cmavo at the beginning fall off is also forbidden. The test to determine this has not traditionally been called the "tosmabru test", and it doesn't follow the exact algorithm described for the lujvo tosmabru test - but that is history, and not "generalized rule".
The test applied to fu'ivla was traditionally called the "slinku'i" test, wherein attaching a cmavo to the front causes the word to break up. But that is not the only test.
fu'ivla are at the bottom of the pecking order among Lojban word-forms, and ANYTHING about a possible fu'ivla that could lead to ambiguous resolution as something else makes it invalid. There are a number of possible ways a word could fall apart, and we made no attempt to concoct a specific test for all of them, and indeed decided at the time that the question of defining all necessary tests algorithmically was too hard to be practical (at the time), and thus came up with the rafsi-fu'ivla proposal that ensures that any fu'ivla created does not violate any tests, intending that NO ONE would create type-4 fu'ivla until we could come up with such an algorithm. So there is no specific name for the test that says that "paigli'u" is invalid, because it could break up into "pai gli'u". I would be opposed to calling it a "tosmabru test" because it in fact is NOT decided by the exact tosmabru test algorithm, but by the generalized rule regulating fu'ivla.
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.
-- 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.