stem model f_A and declension

[funderburkjim]

feminine nouns ending in 'A'

This list is derived from lexnorm-all2 by the simple filter:
a) key1 ends in long vowel 'A'
b) lexnorm is precisely 'f' or 'f#A'

Note: there are only a handful of cases with lexnorm 'f#A'. For a noun ending in A, this specification
of lexnorm is merely an alternate of 'f' .

As in #4, this excludes many adjectives and other nominals ending in 'a', namely those with more complex normalized lexnorm values, such as 'm:f:n'. As we will see when considering 'm:f:n' for
a citation Xa ending in 'a', the feminine stem is implied to be XA.

There are 17265 cases, listed in file nominals/inputs/f_a1.txt.

Note: The reason the file is named 'f_a1.txt' rather than 'f_A.txt' has to do with the fact that, in Windows
OS, filenames are case-insensitive -- i.e. f_a.txt is same as f_A.txt. To avoid problems arising from this
peculiarity, this system is using the convention of replacing an uppercase letter 'X' in a filename with
'x1', where 'x' is the lower-case form of 'X'. ---- It's annoying but necessary to introduce such
awkwardnesses when using Windows OS.

[funderburkjim]

endings for f_A model

The endings used for the f_A declension algorithm are:

Case	S	D	P
Nominative	A	e	AH
Accusative	Am	e	AH
Instrumental	ayA	AByAm	ABiH
Dative	AyE	AByAm	AByaH
Ablative	AyAH	AByAm	AByaH
Genitive	AyAH	ayoH	AnAm
Locative	AyAm	ayoH	Asu
Vocative	e	e	AH

[funderburkjim]

Base for f_A model

We assume that the stem (last pada of key2) already ends in 'A'.
The base then is formed by removing the final 'A'.

For example, the base for 'latA' is lat.

[funderburkjim]

f_A declension algorithm

The declension algorithm for feminine nouns ending in 'A' is procedurally the same as that for masculine
nouns ending in 'a', with the exception of using the f_A endings.

Here is a summary of the procedure.

• Start with key2.
• If there are '-' characters in key2, represent key2 as H-X, where X is the last 'pada' and H is the head,
  with any additional '-' characters removed.
  If there are no '-' characters in key2, set H = '' (empty string) and X = key2.
• construct the stem from X by removing the last character, which is an 'A', i.e., represent X as YA,
  where 'Y' is the base.
• for each cell of the 24 declension cells, let E be the ending for that cell
  • concatenate the base with the ending: Z = YE
  • apply nR sandhi to Z, resulting in W.
  • concatenate H with W. This is the declension of key2 for the given cell

[funderburkjim]

example rAmA

Note that nR sandhi applies for Genitive Plural

Case	S	D	P
Nominative	rAm + A = rAmA	rAm + e = rAme	rAm + AH = rAmAH
Accusative	rAm + Am = rAmAm	rAm + e = rAme	rAm + AH = rAmAH
Instrumental	rAm + ayA = rAmayA	rAm + AByAm = rAmAByAm	rAm + ABiH = rAmABiH
Dative	rAm + AyE = rAmAyE	rAm + AByAm = rAmAByAm	rAm + AByaH = rAmAByaH
Ablative	rAm + AyAH = rAmAyAH	rAm + AByAm = rAmAByAm	rAm + AByaH = rAmAByaH
Genitive	rAm + AyAH = rAmAyAH	rAm + ayoH = rAmayoH	rAm + AnAm = rAmAnAm -> rAmARAm
Locative	rAm + AyAm = rAmAyAm	rAm + ayoH = rAmayoH	rAm + Asu = rAmAsu
Vocative	rAm + e = rAme	rAm + e = rAme	rAm + AH = rAmAH

[funderburkjim]

checks

latA checked against Deshpande, p. 73

rAmA checked against Huet

These declensions are in decline_check, along with other declension checks.