Received: from 173-13-139-235-sfba.hfc.comcastbusiness.net ([173.13.139.235]:60967 helo=jukni.digitalkingdom.org) by stodi.digitalkingdom.org with smtp (Exim 4.85) (envelope-from ) id 1a13CT-0006k4-SM; Mon, 23 Nov 2015 18:19:26 -0800 Received: by jukni.digitalkingdom.org (sSMTP sendmail emulation); Mon, 23 Nov 2015 18:19:21 -0800 From: "Apache" Date: Mon, 23 Nov 2015 18:19:21 -0800 To: webmaster@lojban.org, curtis289@att.net Subject: [jvsw] Definition Edited At Word tseingu -- By krtisfranks Bcc: jbovlaste-admin@lojban.org Message-ID: <5653c929.iKTLFlA/titDtVI9%webmaster@lojban.org> User-Agent: Heirloom mailx 12.5 7/5/10 MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: quoted-printable X-Spam-Score: 1.9 (+) X-Spam_score: 1.9 X-Spam_score_int: 19 X-Spam_bar: + X-Spam-Report: Spam detection software, running on the system "stodi.digitalkingdom.org", has NOT identified this incoming email as spam. The original message has been attached to this so you can view it or label similar future email. If you have any questions, see the administrator of that system for details. Content preview: In jbovlaste, the user krtisfranks has edited a definition of "tseingu" in the language "English". Differences: 5,5c5,5 < This word can be used to specify the concept of "nth cousin m-times removed"-ness; x1 and x2 would be the cousins, x3-1 = n, and x4 is related to my but is signed. The relationship need not actually be cousinhood (as perceived by English); direct ancestor-defendant pairs, (aunt/uncle)-(niece/nephew) pairs, and in fact any pair of family members with a well-speified most recent common ancestor (that is known) have this relationship to one another. This word can be used for specifying the number of "great"'s in the title of a relationship between x1 and x2 (with some calculational forethought). The tree diagram can be more generic than a family tree though; thus cousinhood is just a way to put it into context/application and is noy really essential to the meaning except through analogy. Notice the ordering of all terms; if the graph is directed, the arguments of the distance matters. The graph should probably be a tree locally if it is to be a well-defined relationship. --- > This word can be used to specify the concept of "nth cousin m-times removed"-ness; x1 and x2 would be the cousins, x3-1 = n, and x4 is related to m but is signed. The relationship need not actually be cousinhood (as perceived by English); direct ancestor-defendant pairs, (aunt/uncle)-(niece/nephew) pairs, and in fact any pair of family members with a well-speified most recent common ancestor (that is known) have this relationship to one another. This word can be used for specifying the number of "great"'s in the title of a relationship between x1 and x2 (with some calculational forethought). The tree diagram can be more generic than a family tree though; thus cousinhood is just a way to put it into context/application and is noy really essential to the meaning except through analogy. Notice the ordering of all terms; if the graph is directed, the arguments of the distance matters. The graph should probably be a tree locally if it is to be a well-defined relationship. [...] Content analysis details: (1.9 points, 5.0 required) pts rule name description ---- ---------------------- -------------------------------------------------- 0.0 URIBL_BLOCKED ADMINISTRATOR NOTICE: The query to URIBL was blocked. See http://wiki.apache.org/spamassassin/DnsBlocklists#dnsbl-block for more information. [URIs: lojban.org] 1.4 RCVD_IN_BRBL_LASTEXT RBL: No description available. [173.13.139.235 listed in bb.barracudacentral.org] -0.5 BAYES_05 BODY: Bayes spam probability is 1 to 5% [score: 0.0189] 1.0 RDNS_DYNAMIC Delivered to internal network by host with dynamic-looking rDNS In jbovlaste, the user krtisfranks has edited a definition of "tseingu" in the language "English". Differences: 5,5c5,5 < =09=09This word can be used to specify the concept of "nth cousin m-t= imes removed"-ness; x1 and x2 would be the cousins, x3-1 =3D n, and x4 = is related to my but is signed. The relationship need not actually be c= ousinhood (as perceived by English); direct ancestor-defendant pairs, = (aunt/uncle)-(niece/nephew) pairs, and in fact any pair of family membe= rs with a well-speified most recent common ancestor (that is known) hav= e this relationship to one another. This word can be used for specifyin= g the number of "great"'s in the title of a relationship between x1 and= x2 (with some calculational forethought). The tree diagram can be more= generic than a family tree though; thus cousinhood is just a way to pu= t it into context/application and is noy really essential to the meanin= g except through analogy. Notice the ordering of all terms; if the grap= h is directed, the arguments of the distance matters. The graph should = probably be a tree locally if it is to be a well-defined relationship. --- > =09=09This word can be used to specify the concept of "nth cousin m-t= imes removed"-ness; x1 and x2 would be the cousins, x3-1 =3D n, and x4 = is related to m but is signed. The relationship need not actually be co= usinhood (as perceived by English); direct ancestor-defendant pairs, (= aunt/uncle)-(niece/nephew) pairs, and in fact any pair of family member= s with a well-speified most recent common ancestor (that is known) have= this relationship to one another. This word can be used for specifying= the number of "great"'s in the title of a relationship between x1 and = x2 (with some calculational forethought). The tree diagram can be more = generic than a family tree though; thus cousinhood is just a way to put= it into context/application and is noy really essential to the meaning= except through analogy. Notice the ordering of all terms; if the graph= is directed, the arguments of the distance matters. The graph should p= robably be a tree locally if it is to be a well-defined relationship. Old Data: =09Definition: =09=09$x_1$ (node in a tree graph) and $x_2$ (node in the same tree gra= ph) have an essentially unique most recent (graph-nearest) common ances= tor node A such that $x_3$ [nonnegative integer; li] is the minimum ele= ment of the set consisting only of $d($A$, x_1)$ and of $d($A$, x_2)$, = and such that $x_4$ [integer; li] is $d($A$, x_1) - d($A$, x_2)$, where= $d$ is the graph geodesic distance (defined to be infinite if nodes ar= e not connected in the correct direction). =09Notes: =09=09This word can be used to specify the concept of "nth cousin m-tim= es removed"-ness; x1 and x2 would be the cousins, x3-1 =3D n, and x4 is= related to my but is signed. The relationship need not actually be cou= sinhood (as perceived by English); direct ancestor-defendant pairs, (a= unt/uncle)-(niece/nephew) pairs, and in fact any pair of family members= with a well-speified most recent common ancestor (that is known) have = this relationship to one another. This word can be used for specifying = the number of "great"'s in the title of a relationship between x1 and x= 2 (with some calculational forethought). The tree diagram can be more g= eneric than a family tree though; thus cousinhood is just a way to put = it into context/application and is noy really essential to the meaning = except through analogy. Notice the ordering of all terms; if the graph = is directed, the arguments of the distance matters. The graph should pr= obably be a tree locally if it is to be a well-defined relationship. =09Jargon: =09=09 =09Gloss Keywords: =09=09Word: consanguinity values, In Sense:=20 =09=09Word: cousin degree, In Sense:=20 =09=09Word: cousin order, In Sense: ordinal of cousin relationship =09=09Word: cousin removal, In Sense:=20 =09=09Word: degree of removal, In Sense: cousin relationship =09=09Word: kinship number, In Sense:=20 =09Place Keywords: New Data: =09Definition: =09=09$x_1$ (node in a tree graph) and $x_2$ (node in the same tree gra= ph) have an essentially unique most recent (graph-nearest) common ances= tor node A such that $x_3$ [nonnegative integer; li] is the minimum ele= ment of the set consisting only of $d($A$, x_1)$ and of $d($A$, x_2)$, = and such that $x_4$ [integer; li] is $d($A$, x_1) - d($A$, x_2)$, where= $d$ is the graph geodesic distance (defined to be infinite if nodes ar= e not connected in the correct direction). =09Notes: =09=09This word can be used to specify the concept of "nth cousin m-tim= es removed"-ness; x1 and x2 would be the cousins, x3-1 =3D n, and x4 is= related to m but is signed. The relationship need not actually be cous= inhood (as perceived by English); direct ancestor-defendant pairs, (au= nt/uncle)-(niece/nephew) pairs, and in fact any pair of family members = with a well-speified most recent common ancestor (that is known) have t= his relationship to one another. This word can be used for specifying t= he number of "great"'s in the title of a relationship between x1 and x2= (with some calculational forethought). The tree diagram can be more ge= neric than a family tree though; thus cousinhood is just a way to put i= t into context/application and is noy really essential to the meaning e= xcept through analogy. Notice the ordering of all terms; if the graph i= s directed, the arguments of the distance matters. The graph should pro= bably be a tree locally if it is to be a well-defined relationship. =09Jargon: =09=09 =09Gloss Keywords: =09=09Word: consanguinity values, In Sense:=20 =09=09Word: cousin degree, In Sense:=20 =09=09Word: cousin order, In Sense: ordinal of cousin relationship =09=09Word: cousin removal, In Sense:=20 =09=09Word: degree of removal, In Sense: cousin relationship =09=09Word: kinship number, In Sense:=20 =09Place Keywords: You can go to to see it.