1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
|
concrete NounGer of Noun = CatGer ** open ResGer, Prelude in {
flags optimize=all_subs ;
lin
DetCN det cn = {
s = \\c => det.s ! cn.g ! c ++ cn.s ! adjfCase det.a c ! det.n ! c ;
a = agrP3 det.n ;
isPron = False
} ;
DetNP det = {
s = \\c => det.s ! Neutr ! c ; ---- genders
a = agrP3 det.n ;
isPron = False
} ;
UsePN pn = pn ** {a = agrP3 Sg} ;
UsePron pron = {
s = \\c => pron.s ! NPCase c ;
a = pron.a
} ;
PredetNP pred np = {
s = \\c => pred.s ! np.a.n ! Masc ! c ++ np.s ! c ; ---- g
a = np.a
} ;
PPartNP np v2 = {
s = \\c => np.s ! c ++ v2.s ! VPastPart APred ; --- invar part
a = np.a
} ;
AdvNP np adv = {
s = \\c => np.s ! c ++ adv.s ;
a = np.a
} ;
DetQuantOrd quant num ord =
let
n = num.n ;
a = quant.a
in {
s = \\g,c => quant.s ! n ! g ! c ++
num.s!g!c ++ ord.s ! agrAdj g (adjfCase a c) n c ;
n = n ;
a = a
} ;
DetQuant quant num =
let
n = num.n ;
a = quant.a
in {
s = \\g,c => quant.s ! n ! g ! c ++ num.s!g!c ;
n = n ;
a = a
} ;
DetArtOrd quant num ord =
let
n = num.n ;
a = quant.a
in {
s = \\g,c => quant.s ! num.isNum ! n ! g ! c ++
num.s!g!c ++ ord.s ! agrAdj g (adjfCase a c) n c ;
n = n ;
a = a
} ;
DetArtCard quant num =
let
n = num.n ;
a = quant.a
in {
s = \\g,c => quant.s ! True ! n ! g ! c ++
num.s!g!c ;
n = n ;
a = a
} ;
DetArtPl det cn = {
s = \\c => det.s ! False ! Pl ! cn.g ! c ++ cn.s ! adjfCase det.a c ! Pl ! c ;
a = agrP3 Pl ;
isPron = False
} ;
DetArtSg det cn = {
s = \\c => det.s ! False ! Sg ! cn.g ! c ++ cn.s ! adjfCase det.a c ! Sg ! c ;
a = agrP3 Sg ;
isPron = False
} ;
PossPron p = {
s = \\n,g,c => p.s ! NPPoss (gennum g n) c ;
a = Strong --- need separately weak for Pl ?
} ;
NumCard n = n ** {isNum = True} ;
NumPl = {s = \\g,c => []; n = Pl ; isNum = False} ;
NumSg = {s = \\g,c => []; n = Sg ; isNum = False} ;
NumDigits numeral = {s = \\g,c => numeral.s ! NCard g c; n = numeral.n } ;
OrdDigits numeral = {s = \\af => numeral.s ! NOrd af} ;
NumNumeral numeral = {s = \\g,c => numeral.s ! NCard g c; n = numeral.n } ;
OrdNumeral numeral = {s = \\af => numeral.s ! NOrd af} ;
AdNum adn num = {s = \\g,c => adn.s ++ num.s!g!c; n = num.n } ;
OrdSuperl a = {s = a.s ! Superl} ;
DefArt = {
s = \\_,n,g,c => artDef ! gennum g n ! c ;
a = Weak
} ;
IndefArt = {
s = table {
True => \\_,_,_ => [] ;
False => table {
Sg => \\g,c => "ein" + pronEnding ! GSg g ! c ;
Pl => \\_,_ => []
}
} ;
a = Strong
} ;
MassNP cn = {
s = \\c => cn.s ! adjfCase Strong c ! Sg ! c ;
a = agrP3 Sg ;
isPron = False
} ;
UseN, UseN2 = \n -> {
s = \\_ => n.s ;
g = n.g
} ;
ComplN2 f x = {
s = \\_,n,c => f.s ! n ! c ++ appPrep f.c2 x.s ;
g = f.g
} ;
ComplN3 f x = {
s = \\n,c => f.s ! n ! c ++ appPrep f.c2 x.s ;
g = f.g ;
c2 = f.c3
} ;
Use2N3 f = {
s = f.s ;
g = f.g ;
c2 = f.c2
} ;
Use3N3 f = {
s = f.s ;
g = f.g ;
c2 = f.c3
} ;
AdjCN ap cn =
let
g = cn.g
in {
s = \\a,n,c =>
preOrPost ap.isPre
(ap.s ! agrAdj g a n c)
(cn.s ! a ! n ! c) ;
g = g
} ;
RelCN cn rs = {
s = \\a,n,c => cn.s ! a ! n ! c ++ rs.s ! gennum cn.g n ;
g = cn.g
} ;
RelNP np rs = {
s = \\c => np.s ! c ++ "," ++ rs.s ! gennum np.a.g np.a.n ;
a = np.a ;
isPron = False
} ;
SentCN cn s = {
s = \\a,n,c => cn.s ! a ! n ! c ++ s.s ;
g = cn.g
} ;
AdvCN cn s = {
s = \\a,n,c => cn.s ! a ! n ! c ++ s.s ;
g = cn.g
} ;
ApposCN cn np = let g = cn.g in {
s = \\a,n,c => cn.s ! a ! n ! c ++ np.s ! c ;
g = g ;
isMod = cn.isMod
} ;
}
|
