Property relativizing determiner / unary quantifier constructor. {kai'i} introduces a predicate whose first argument slot becomes filled by the property made by taking the bridi in which this {kai'i} appears and putting {ce'u} into the argument slot in which this {kai'i} argument was located. Put formally, "kai'i brodi cu brodu" = "lo ka ce'u brodu cu brodi". Additionally, a {kai'i} term has a rightward logical scope, like quantifiers and adverbials.
Attaches all of the following words to the next explicitly mentioned sumti as seltau of that sumti or selbri which is explicitly marked with "cu" (under left-grouping by default).
incidental/non-restrictive adverbial: converts selbri to bridi adverbial term. The first place of the converted selbri is claimed to be such that the outer bridi satisfies it, and the outer bridi is claimed. {broda noi'a brode} means {lo nu broda ku goi ko'a cu fasnu .i ko'a brode}.
restrictive adverbial: converts selbri to bridi adverbial term. The first place of the converted selbri is claimed to occur in conjunction with the outer bridi. {broda poi'a brode} means {lo nu broda cu fasnu gi'e brode}.
subordinating adverbial: converts selbri to bridi adverbial term. The bridi is claimed to satisfy the first place of the converted selbri, but is not itself claimed to occur. {broda soi'a brode} means {lo nu broda cu brode}
The date [day,week,month,year] x1=d1=k1 is recurrence/repetition of the date [day,week,month,year] of the first event x2=d2, for the x3=k3'rd time, in system x3.
grammatically converts LAhE to SE; semantically the result tags the x1 of the selbri as being LAhE the supplied x1. Can be converted to other than x1 with SE.
This cmavo precedes a predicate (at least binary) and turns it into a conjunction, which syntactically behaves like JA cmavo. The predicate indicates the relationship between the two connected propositions. Terminator: {te'u}.
head-final content clause relativizer: it turns the current clause into a subordinate content clause, binds it to the {ke'a} pronoun, and restart the current clause afresh (as if its previous content was erased or moved into a hidden prenex).
x1 (plural of ordered pairs) is an exhaustive set (possibly infinite) of inputs/outputs defining a unary function which yields result x3 when given input x2; x1(x2) = x3
x1 (group of entity) compete with each other in competition x2 (property of each member of x1) where each member of x1 has goal x3 (property of member of x1) that is the same for all members of x1