Open funderburkjim opened 6 years ago
Case | S | D | P |
---|---|---|---|
Nominative | IH/FH | irO/rO | iraH/raH |
Accusative | iram/Fm | irO/rO | iraH/Fn |
Instrumental | irA/rA | IrByAm/FByAm | IrBiH/FBiH |
Dative | ire/re | IrByAm/FByAm | IrByaH/FByaH |
Ablative | iraH/ruH | IrByAm/FByAm | IrByaH/FByaH |
Genitive | iraH/ruH | iroH/roH | irAm/rAm |
Locative | iri/ri | iroH/roH | Irzu/Fzu |
Vocative | IH/FH | irO/rO | iraH/raH |
Obtain base by dropping the final 'F'
Completely analogous to the other vowel-ending declension algorithms:
Case | S | D | P |
---|---|---|---|
Nominative | k + IH/FH = kIH/kFH | k + irO/rO = kirO/krO | k + iraH/raH = kiraH/kraH |
Accusative | k + iram/Fm = kiram/kFm | k + irO/rO = kirO/krO | k + iraH/Fn = kiraH/kFn |
Instrumental | k + irA/rA = kirA/krA | k + IrByAm/FByAm = kIrByAm/kFByAm | k + IrBiH/FBiH = kIrBiH/kFBiH |
Dative | k + ire/re = kire/kre | k + IrByAm/FByAm = kIrByAm/kFByAm | k + IrByaH/FByaH = kIrByaH/kFByaH |
Ablative | k + iraH/ruH = kiraH/kruH | k + IrByAm/FByAm = kIrByAm/kFByAm | k + IrByaH/FByaH = kIrByaH/kFByaH |
Genitive | k + iraH/ruH = kiraH/kruH | k + iroH/roH = kiroH/kroH | k + irAm/rAm = kirAm/krAm |
Locative | k + iri/ri = kiri/kri | k + iroH/roH = kiroH/kroH | k + Irzu/Fzu = kIrzu/kFzu |
Vocative | k + IH/FH = kIH/kFH | k + irO/rO = kirO/krO | k + iraH/raH = kiraH/kraH |
Case | S | D | P |
---|---|---|---|
Nominative | A | alO | alaH |
Accusative | alam | alO | Fn |
Instrumental | lA | xByAm | xBiH |
Dative | le | xByAm | xByaH |
Ablative | ul | xByAm | xByaH |
Genitive | ul | loH | FRAm |
Locative | ali | loH | xzu |
Vocative | al | alO | alaH |
Obtain base by dropping the final 'x'
Same as above for m_F
Case | S | D | P |
---|---|---|---|
Nominative | gam + A = gamA | gam + alO = gamalO | gam + alaH = gamalaH |
Accusative | gam + alam = gamalam | gam + alO = gamalO | gam + Fn = gamFn |
Instrumental | gam + lA = gamlA | gam + xByAm = gamxByAm | gam + xBiH = gamxBiH |
Dative | gam + le = gamle | gam + xByAm = gamxByAm | gam + xByaH = gamxByaH |
Ablative | gam + ul = gamul | gam + xByAm = gamxByAm | gam + xByaH = gamxByaH |
Genitive | gam + ul = gamul | gam + loH = gamloH | gam + FRAm = gamFRAm |
Locative | gam + ali = gamali | gam + loH = gamloH | gam + xzu = gamxzu |
Vocative | gam + al = gamal | gam + alO = gamalO | gam + alaH = gamalaH |
Thus we remove 'X' from lexnorm-all2 and make no attempt to decline.
It would be sad to see it the other way around.
There are only 3 nominals in lexnorm-all2 that end with one of the vowels 'F','x','X' (ṝ, ḷ, ḹ ); and they are the 'words' F,x,X !
Kale does not mention ḹ, and MW says "entirely artificial and only appearing in the works of some grammarians and lexicographers". Thus we remove 'X' from lexnorm-all2 and make no attempt to decline.
Of ṝ, ḷ, Kale says: "There are no words ending in ṝ or ḷ,; therefore, the imitative sounds of the roots kṝ and tṝ and gamḷ and śakḷ are taken to show what the forms of such words will be, if there be need to use such words".
Kale shows declension of the masculine of kṝ and gamḷ, and the endings and declension algorithm described below are based on these.
The algorithms also allow for feminine declensions, and assume they would be same as for masculine; this is by analogy with the equivalence of masculine and feminine declensions for nominals ending in e, E, o, O.
Since Kale mentions nothing regarding a neuter declension of kṝ and gamḷ, we make no guess here.