Received: from mail-vx0-f189.google.com ([209.85.220.189]:42057) by stodi.digitalkingdom.org with esmtps (TLSv1:RC4-SHA:128) (Exim 4.76) (envelope-from ) id 1RR7jc-0008Ln-PA; Thu, 17 Nov 2011 11:35:01 -0800 Received: by vcbfk1 with SMTP id fk1sf566810vcb.16 for ; Thu, 17 Nov 2011 11:34:50 -0800 (PST) DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=googlegroups.com; s=beta; h=x-beenthere:date:from:reply-to:to:message-id:in-reply-to:references :subject:mime-version:x-original-sender :x-original-authentication-results:precedence:mailing-list:list-id :x-google-group-id:list-post:list-help:list-archive:sender :list-subscribe:list-unsubscribe:content-type; bh=XqIOugOG7ACx8j/IQAApwtUyJ9owwdRswSIjCmcdh9w=; b=A5eN23CtFfmFNaYD3hab68TtqwDUg1OxctN5zc/yOnegx/W1gwTnJgatPiSqP9O8LY 8hvXwYT/CpkzDWLnklYABHE634LZy73GV1AfIxHkFSTteKrkOyXk5Gi14Vv+/A3+N0SV 4I8TV+h4IZkLnIq8X+VQLTDq5jahAdgZBddQw= Received: by 10.52.179.102 with SMTP id df6mr2685548vdc.19.1321558487601; Thu, 17 Nov 2011 11:34:47 -0800 (PST) X-BeenThere: lojban@googlegroups.com Received: by 10.220.142.67 with SMTP id p3ls1098196vcu.1.gmail; Thu, 17 Nov 2011 11:34:46 -0800 (PST) Received: by 10.52.72.199 with SMTP id f7mr9781vdv.11.1321558486112; Thu, 17 Nov 2011 11:34:46 -0800 (PST) Date: Thu, 17 Nov 2011 11:34:45 -0800 (PST) From: djandus Reply-To: lojban@googlegroups.com To: lojban@googlegroups.com Message-ID: <8420465.439.1321558485154.JavaMail.geo-discussion-forums@yqff21> In-Reply-To: <20b482a7-b58a-4e4a-a3f7-27b49ba861c0@p9g2000vbb.googlegroups.com> References: <20b482a7-b58a-4e4a-a3f7-27b49ba861c0@p9g2000vbb.googlegroups.com> Subject: [lojban] Re: New PA-proposal MIME-Version: 1.0 X-Original-Sender: jandew@gmail.com X-Original-Authentication-Results: ls.google.com; spf=pass (google.com: domain of jandew@gmail.com designates internal as permitted sender) smtp.mail=jandew@gmail.com; dkim=pass header.i=@gmail.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="----=_Part_438_15634746.1321558485152" X-Spam-Score: -0.7 (/) X-Spam_score: -0.7 X-Spam_score_int: -6 X-Spam_bar: / ------=_Part_438_15634746.1321558485152 Content-Type: text/plain; charset=ISO-8859-1 This seems really impressive and well-thought-out to me and deserves careful inspection. I have to admit, from the start I was afraid that your demands for the grammar would make it far too complicated, but it actually seems rather intuitive. Just to make sure I understand things, I'm seeing that to make a string: PA1 combine freely PA2 exist individually PA3 modify the string to the right PA4 separate strings, modifying internally PA5 are PA4 but with single usage PA6 are specialized individual numbers Just looking at that, the "pretty pretty simple simple" part of me wants to sort them primarily by basic grammatical usage. That is, combine PA2 and PA6 since they both have words that stand alone as number strings, and combine PA4 and PA5 since they both modify internally. The extra grammatical rules can be explained in subgroups. (e.g. refer to PA6 as PA2* or something) To clarify further, I feel that while it is certainly a valuable goal to make every grammatical PA construct be meaningful, it is also lofty and should be sacrificed when necessary for the sake of having a primary grammar that is clear and easy to understand. Additionally, the secondary rules are more particulars on interpretation or restrictions to provide a computer than a human. (As in, expressing that the words you call PA5 can only be used once is extremely simple to tack on as an extra subcondition, while it is more valuable for structure and grammar to group it with PA4) To illustrate my point, I'll use notation entirely distinct from selma'o -- I'll use "#" for an unmodified number string, which can be composed of what you call PA1 (any combination), PA2, or PA6. I'll use "." for an internal modifier, and "-" for a left-hand modifier. With this simple categorization, I'd like to ask for clarification on your more interesting grammar suggestions. You claim that right-grouping is necessary, but the example you provided seems (to me, correct me if I'm wrong) to illustrate left-grouping! That is, I'm getting the gist of your grammar suggestion to be that you can have any number of number strings automatically associated together. (Providing there is some way to tell them apart, implying in my mind that either another internal separator or number string terminator is desired.) That is: # # # # is parsed as having four number descriptions all describing the same amount. Additionally, I see you applying a primarily *left*-grouping methodology with PA3, saying that you can have any number of left-hand modifiers "prefixing" any string: +++++# +++++# would have two strings with five modifiers each, both of which are numerical descriptions of the same amount. Additionally, I would describe the internal modifiers less as separating numerical strings, and more like joining strings together. (Though this is simply a matter of perspective.) Either way, that part says you can simply have #.# #.#.# Which would be two numerical descriptions, one composed of two substrings and the other composed of three. This sort of grammar seems pretty simple, though implementing it certainly would require a few very critical editations to the current grammar. (I am certainly fond of fi'u for the golden ratio -- something that could easily be accommodated for in this grammar with the use of a special separator/marker/terminator of some kind.) Before I close, I'd like to address your example of {li rau su'o pa} with how I see your grammar would be implemented. {rau}, being of your PA2, represents a full string (#). {su'o}, of your PA3, is a left-hand modifier (+). {pa} is, of course, PA1, and without any adjacent PA1 represents a full string (#). Thus, the structure is simply # +# with the two descriptions "enough" and "at least one" purported as equivalent descriptions of the same value. With this outlook, there is no issue of "left grouping" or "right grouping", as there are simply stacked left-hand modifiers that only modify the next string. One issue would be declaring that the internal modifiers are "close grouping", with {pi} and {pi'e} grouping before left-hand modifiers as expected. Otherwise, the grammar would be complete, intuitive, and often more so than the current, if your {li rau su'o pa} assessment is accurate. (I apparently don't know the current PA grammar well enough, as it simply seems silly to me to try to group {}.) -- You received this message because you are subscribed to the Google Groups "lojban" group. To view this discussion on the web visit https://groups.google.com/d/msg/lojban/-/RImbxLmyHV0J. 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. ------=_Part_438_15634746.1321558485152 Content-Type: text/html; charset=ISO-8859-1 Content-Transfer-Encoding: quoted-printable This seems really impressive and well-thought-out to me and deserves carefu= l inspection.

I have to admit, from the start I was afra= id that your demands for the grammar would make it far too complicated, but= it actually seems rather intuitive. Just to make sure I understand things,= I'm seeing that to make a string:
PA1 combine freely
P= A2 exist individually
PA3 modify the string to the right
PA4 separate strings, modifying internally
PA5 are PA4 but with= single usage
PA6 are specialized individual numbers
Just looking at that, the "pretty pretty simple simple" part o= f me wants to sort them primarily by basic grammatical usage. That is, comb= ine PA2 and PA6 since they both have words that stand alone as number strin= gs, and combine PA4 and PA5 since they both modify internally. The extra gr= ammatical rules can be explained in subgroups. (e.g. refer to PA6 as PA2* o= r something) To clarify further, I feel that while it is certainly a valuab= le goal to make every grammatical PA construct be meaningful, it is also lo= fty and should be sacrificed when necessary for the sake of having a primar= y grammar that is clear and easy to understand. Additionally, the secondary= rules are more particulars on interpretation or restrictions to provide a = computer than a human. (As in, expressing that the words you call PA5 can o= nly be used once is extremely simple to tack on as an extra subcondition, w= hile it is more valuable for structure and grammar to group it with PA4)

To illustrate my point, I'll use notation entirely d= istinct from selma'o -- I'll use "#" for an unmodified number string, which= can be composed of what you call PA1 (any combination), PA2, or PA6. I'll = use "." for an internal modifier, and "-" for a left-hand modifier.

With this simple categorization, I'd like to ask for clar= ification on your more interesting grammar suggestions. You claim that righ= t-grouping is necessary, but the example you provided seems (to me, correct= me if I'm wrong) to illustrate left-grouping! That is, I'm getting the gis= t of your grammar suggestion to be that you can have any number of number s= trings automatically associated together. (Providing there is some way to t= ell them apart, implying in my mind that either another internal separator = or number string terminator is desired.) That is:
# # # #
is parsed as having four number descriptions all describing the same amo= unt. Additionally, I see you applying a primarily left-grouping meth= odology with PA3, saying that you can have any number of left-hand modifier= s "prefixing" any string:
+++++# +++++#
would have two = strings with five modifiers each, both of which are numerical descriptions = of the same amount.
Additionally, I would describe the internal m= odifiers less as separating numerical strings, and more like joining string= s together. (Though this is simply a matter of perspective.) Either way, th= at part says you can simply have
#.# #.#.#
Which would = be two numerical descriptions, one composed of two substrings and the other= composed of three.

This sort of grammar seems pre= tty simple, though implementing it certainly would require a few very criti= cal editations to the current grammar. (I am certainly fond of fi'u for the= golden ratio -- something that could easily be accommodated for in this gr= ammar with the use of a special separator/marker/terminator of some kind.)<= /div>

Before I close, I'd like to address your example o= f {li rau su'o pa} with how I see your grammar would be implemented. {rau},= being of your PA2, represents a full string (#). {su'o}, of your PA3, is a= left-hand modifier (+). {pa} is, of course, PA1, and without any adjacent = PA1 represents a full string (#). Thus, the structure is simply
#= +#
with the two descriptions "enough" and "at least one" purport= ed as equivalent descriptions of the same value. With this outlook, there i= s no issue of "left grouping" or "right grouping", as there are simply stac= ked left-hand modifiers that only modify the next string. One issue would b= e declaring that the internal modifiers are "close grouping", with {pi} and= {pi'e} grouping before left-hand modifiers as expected. Otherwise, the gra= mmar would be complete, intuitive, and often more so than the current, if y= our {li rau su'o pa} assessment is accurate. (I apparently don't know the c= urrent PA grammar well enough, as it simply seems silly to me to try to gro= up {<rau su'o>}.)

--
You received this message because you are subscribed to the Google Groups "= lojban" group.
To view this discussion on the web visit https://groups.google.com/d/msg/lojban/-/RI= mbxLmyHV0J.
=20 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.
------=_Part_438_15634746.1321558485152--