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
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
|
; Post-processing knowledge file
; 6/96
; ----------------------------------------------------------------------------
; This file contains the knowledge related to post-processing, in the
; form of lists and rules. This file is read by post-process.c at run-time.
; Syntax of file:
; line starting with ";" is a comment
; commas are field delimiters
; any token beginning with the character @ is expanded to the set
; of symbols it defined. e.g. one could write
; FOO: blah1 blah2 blah3
; thus defining a set FOO containing three strings. Then one could later write
; BAR: blah5 @FOO blah8
; which defines a set BAR containing 5 strings.
;
; Capitalized tokens are *required*, though if you feel like providing an
; empty list afterwards, that's your right.
; ----------------------------------------------------------------------------
; the following links start a domain. Each must be given a name in the
; table below (STARTING_LINK_TYPE_TABLE)
DOMAIN_STARTER_LINKS:
W Ce Cs Ca Cc Ci R* Rn Re RSe Mr QI#d Mv* Jr Mj Qd
TOn TOi Mg* MVi Ss#d Bsd ER Z Ma#* SIs#g BIqx MX#p MX#a
MX#r MX#j MV#o MV#p Eq COq CCq AFd PFc
; ----------------------------------------------------------------------
; the following links start a urfl domain. They are also included in the
; domain, as opposed to regular starter links (above), which are not. A
; urfl domain includes links accessible from the root word, tracing to
; the right (as well as everything accessible from the left end of the
; starter link).
URFL_DOMAIN_STARTER_LINKS: TOo I#j Pa##j CP
; ----------------------------------------------------------------------
; the following start a urfl_only domain. These include _only_ links :
; reachable from the root word, tracing to the right. They aren't
; included in the domain
URFL_ONLY_DOMAIN_STARTER_LINKS: SFsx Ss#g COp
; ----------------------------------------------------------------------
; links which start a domain and are also part of the domain. This must be
; a sublist of the domain_starter_list
DOMAIN_CONTAINS_LINKS:
Mg* Mx Bsd MX#a Ma#* Mv* MX#r Ss#d Ws Wq Qd Mj Wj
Wi MX#j AFd PFc Jr Wd Mr
; ----------------------------------------------------------------------
; these links are not put in the word/link graph. They also cannot be the
; starter links for a domain. (These links may also only be used in cycles.)
IGNORE_THESE_LINKS: Xca
; ----------------------------------------------------------------------
; these links may only be used in cycles.
MUST_FORM_A_CYCLE_LINKS: R#* TOt EXx HA SFsic Jr JQ Xca
; ----------------------------------------------------------------------
; these links are not traced further if they point back before the root word
RESTRICTED_LINKS:
B#* D##w B#w B#d AFh MVt Xx HL SFsic AFd Bc CX EAh
H HA PFc B#j Wd PF Z
; ----------------------------------------------------------------------
; ---------------------- LINK TYPE TABLE-------------------------------
; ----------------------------------------------------------------------
; the following table associates a domain type with each possible
; starting link. It contains pairs: the first of each pair is a link
; type, and the second is the domain to which that link type belongs.
STARTING_LINK_TYPE_TABLE:
Ce e
R* r
Rn r
Re r
W m
RSe e
Cs s
Ca s
Jr e
Mr r
Cc s
Mv* e
QI#d s
BIqx s
TOn e
TOi e
MVi e
MV#o s
MV#p s
AFd s
PFc s
Mg* e
Mj j
Qd m
MX#j j
TOo x
I#j x
Pa##j x
CP x
COp d
SFsx d
Ss#g d
SIs#g s
Ss#d s
Bsd s
ER s
Z s
Ma#* e
MX#p e
Ci e
MX#a e
Eq e
COq e
CCq s
MX#r r
; ----------------------------------------------------------------------
; ----------------------- LINK SETS ------------------------------------
; ----------------------------------------------------------------------
; (Not in use at present; see comment at beginning of file)
; ----------------------------------------------------------------------
; ----------------- RULES ----------------------------------------------
; ----------------------------------------------------------------------
; explanation of syntax: as usual, each stanza begins with a label
; terminated by a colon. The interpretation of the rule depends on
; the label, as specified in each stanza.
; the following rule asserts that the linkage must *still* be connected
; when the specified set(s) of links are removed from the linkage.
FORM_A_CYCLE_RULES:
@MUST_FORM_A_CYCLE_LINKS , "'must form a cycle' violation"
; For the following rules, if a domain contains a link matching the 1st
; column, it must also contain a linkage matching one of the members of the
; set in the 2nd column. The individual rules are demarcated by semicolons and
; the fields within a rule are demarcated by commas.
CONTAINS_ONE_RULES:
SI#* , Wq Qd CQ PFc , "Bad use of s-v inversion" ,
SI#x , Wq Qd CQ PFc , "Bad use of s-v inversion" ,
SFI##* , Wq Qd CQ PFc , "Bad use of s-v inversion",
SXI , Wq Qd CQ PFc , "Bad use of s-v inversion" ,
Ws , D##w S##w H , "S-V inversion required",
I#a , B#m B#w , "incorrect use of 'to'" ,
Wq , SI SFI SXI , "S-V inversion required" ,
Qd , SI SFI SXI , "S-V inversion required" ,
PFc , SI SFI SXI , "S-V inversion required" ,
Mj , Jw JQ , "Incorrect relative",
MX#j , Jw JQ , "Incorrect relative",
Wj , Jw JQ , "Misuse of preposition" ,
JQ , Mj Wj MX#j , "Misuse of preposition" ,
Jw , Mj Wj MX#j , "Misuse of preposition" ,
B#j , Jr , "Incorrect relative",
Jr , B#j , "Incorrect relative",
EAh , AF Bsm B*m Qe Ca AFm
, "Incorrect use of 'how'" ,
EEh , AF Bsm B*m Qe Ca AFm
, "Incorrect use of 'how'" ,
Qe , EEh , "Incorrect use of adverb" ,
THi , SFsi SFIsi OXi , "Complement requires 'it'" ,
TSi , SFsi SFIsi OXi , "Complement requires 'it'" ,
QIi , SFsi SFIsi OXi , "Complement requires 'it'" ,
TOi , SFsi SFIsi OXi , "Complement requires 'it'" ,
Ci , SFsi SFIsi OXi , "Complement requires 'it'" ,
COqi , SFsi SFIsi OXi , "Complement requires 'it'" ,
CPi , SFsi SFIsi OXi , "Complement requires 'it'" ,
Eqi , SFsi SFIsi OXi , "Complement requires 'it'" ,
LEi , SFsi SFIsi OXi , "Complement requires 'it'" ,
MVti , SFsi SFIsi OXi , "Complement requires 'it'" ,
AFdi , SFsi SFIsi OXi , "Complement requires 'it'" ,
O#i , SFsi SFIsi OXi , "Complement requires 'it'" ,
SFst , O*t Ost Omt Bs#t B*#t Bc#t
, "Bad use of 'there'" ,
SFIst , O*t Ost Omt Bs#t B*#t Bc#t
, "Bad use of 'there'" ,
SFp , Opt Omt O*t Bp#t B*#t Bc#t
, "Bad use of 'there'" ,
SFIp , Opt Omt O*t Bp#t B*#t Bc#t
, "Bad use of 'there'" ,
OXt , O#t B##t , "Bad use of 'there'" ,
SFsi* , TOi THi QIi TSi O#i Ci THb CPi
COqi CPi Eqi AFdi BIh , "Bad use of 'it'" ,
SFIsi , TOi THi QIi TSi O#i Ci THb CPi
COqi CPi Eqi AFdi BIh , "Bad use of 'it'" ,
OXi , TOi THi QIi TSi O#i Ci THb CPi
COqi CPi Eqi AFdi BIh , "Bad use of 'it'" ,
THb , S##t SI##t SFsi SFIsi , "Bad use of predicate" ,
BIh , Ss#b SIs#b SFsi SFIsi , "Bad use of predicate" ,
BIq , S##q SI##q SFsi Ss#b SFIsi SIs#b
, "Bad use of predicate" ,
MVt , Dm#m EAm EEm MVm Pam Pafm AFm EB#m MVb
Om Mam Am Jm Ds*m MX#m , "Bad comparative" ,
MVz , D##y EAy EEy MVy EB#y , "Bad comparative" ,
MV#a , Pam Pafm EAm Ds*m EAy AFm Mam Am
, "Bad comparative" ,
MV#i , Pam Pafm EAm Ds*m EAy AFm Mam Am
, "Bad comparative" ,
MV#o , D##m D##y Om Oy Jm Jy Am MX#m
, "Bad comparative" ,
MV#p , EEm MVb Dm#m EEy D##y MVm Om Oy
Jm Jy Am MX#m
, "Bad comparative" ,
Pafc , EB#m EB#y , "Bad comparative" ,
Pafc , Pa* Paf* , "Bad comparative" ,
MVat , MVm , "Bad comparative" ,
MVpt , MVm , "Bad comparative" ,
MVat , MVa MVp , "Bad comparative" ,
MVpt , MVa MVp , "Bad comparative" ,
U#t , D##m D##y Om Oy Jm Jy Am MX#m
, "Bad comparative" ,
Cc , EEm EEy MVm MVb MVy
, "Bad comparative" ,
Sp#c , Dmcm Dmcy Om Oy Jm Jy MX#m
, "Bad comparative" ,
Ss#c , Dmum Dmuy Om Oy Jm Jy Ds*y MX#m
, "Bad comparative" ,
S##c , Dm#m D##y Om Oy Jm Jy MX#m
, "Bad comparative" ,
THc , TH , "Bad comparative" ,
TOc , TO** TOf* TOi* , "Bad comparative" ,
TOtc , TOt , "Bad comparative" ,
Ma** , TO TOf TH MVp TOt QI OF MVt MVz MVh Ytm Ya
, "Bad use of adjective" ,
Mam , TO TOf TH MVp TOt QI OF MVt MVz MVh Ytm Ya
, "Bad use of adjective" ,
MX#a , TO TOf TH MVp TOt QI OF MVt MVz MVh Ytm Ya
, "Bad use of adjective" ,
Ixd , ZZ , "Can't use 'do' with that verb" ,
Oxn , ZZ , "Bad use of pronoun" ,
MVh , EExk EAxk D##k , "Incorrect use of that" ,
B#m , D##w H HA , "Bad use of gerund"
CONTAINS_NONE_RULES:
S , Spxi , "Bad n-v agreement" ,
SI , SIpxi , "Bad n-v agreement" ,
Ws , B#m Ca BT , "Question inversion violated" ,
SF , I* PP* TO* Pa* Pam Pg* Pv* LE* AFd* MVta
, "Bad use of 'filler' subject" ,
SFI , I* PP* TO* Pa* Pam Pg* Pv* LE* AFd* MVta
, "Bad use of 'filler' subject" ,
OX , I* PP* TO* Pa* Pam Pg* Pv* LE* AFd* MVta
, "Bad use of 'filler' subject" ,
MXsr , Sp#w , "Bad n-v agreement" ,
MXpr , Ss#w S#iw , "Bad n-v agreement" ,
Mr , B#* , "Bad use of 'whose'"
; the following rule asserts that all specified domains must have the
; property that all of the words that touch a link in the domain are
; not to the left of the root word of the domain. These rules are
; different from the above in that the first field is a *domain name*,
; rather than a set of links.
BOUNDED_RULES:
s , "Unbounded s domain" ,
r , "Unbounded r domain"
|
