-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmatrix.tdl
1250 lines (965 loc) · 33.2 KB
/
matrix.tdl
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
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
;;; -*- Mode: TDL; Coding: utf-8; Package: LKB -*-
;;;
;;; HPSG Grammar Matrix Version 0.6
;;;
;;; Copyright Emily M. Bender 2002
;;; All Rights Reserved.
;;; No use or redistribution without permission.
;;;
;;; Based on:
;;;
;;; LinGO Grammar: fundamentals.tdl
;;; Copyright Daniel Flickinger 1994-2001
;;; Initial development Rob Malouf, 3-Nov-1994
;;;
;;; JACY Grammar: fundamentals.tdl, mrsbasic.tdl
;;; Developed by Melanie Siegel, Emily M. Bender
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;;
;; Top-level feature geometry
;;
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
; Types for Sign, Word, Phrase, and Lex-Entry
; sign-min := avm &
; [ STEM list ].
;;; make STEM of type orthog(raphy) to pass up from/to/form
sign-min := avm &
[ STEM orthog ].
orthog := cons &
[ FORM string,
FROM string,
TO string ].
orthography := orthog &
[ CLASS token_class ].
basic-sign := sign-min &
[ KEY-ARG bool ].
sign := basic-sign &
[ SYNSEM synsem,
ARGS list,
INFLECTED bool,
ROOT bool,
BOUNDARY bool,
PUNCT punct-min,
BRACKET sort,
COLON bool,
LINK-INPUT bool,
CONJ conj-value,
NEXTWORD synsem-mini,
START bool ].
punct-min := sort.
punct := punct-min.
no-punct-or-period := punct-min.
no-punct-or-quest-mark := punct-min.
no-punct-or-exclam-mark := punct-min.
no-punct := no-punct-or-period & no-punct-or-quest-mark &
no-punct-or-exclam-mark.
period := no-punct-or-period & punct.
quest-mark := no-punct-or-quest-mark & punct.
colon := period.
exclam-mark := no-punct-or-exclam-mark & punct.
brack := sort.
no-brack := sort.
comma := sort.
no-comma := sort.
co-br := comma & brack.
noco-br := no-comma & brack.
co-nobr := comma & no-brack.
noco-nobr := no-comma & no-brack.
; C-CONT encodes the semantic contribution of the rule (phrasal
; or lexical).
; PH 11-feb-2003: Took out the HOOK link between the mother and C-CONT in order
; to allow for introduced relations that don't share index with the verb. (See
; verb-spr-phrase).
; PH 31-mat-2005: BOUNDARY is marking whether a sign is a sentence or not.
phrase-or-lexrule := sign &
[ SYNSEM canonical-synsem,
C-CONT mrs-min ].
c-cont-1 := phrase-or-lexrule &
[ STEM [FROM #from,
TO #to ],
C-CONT.RELS <! [ CFROM #from,
CTO #to ] !>].
c-cont-2 := phrase-or-lexrule &
[ STEM [FROM #from,
TO #to ],
C-CONT.RELS <! [ CFROM #from,
CTO #to ],
[ CFROM #from,
CTO #to ] !>].
word-or-lexrule-min := sign-min.
; ALTS allow lexical entries to block lexical rule application
; PH 16-dec-03: NKL-ID keeps track of ID in the NKL lexicon.
word-or-lexrule := word-or-lexrule-min & sign &
[ ALTS alts-min,
NKL-ID string,
LEXREL diff-list ].
alts-min := avm.
alts := alts-min &
[ PASSIVE bool ].
no-alts := alts-min.
; Not all words have lex-synsem - e.g. lexical PPs like "tomorrow" are
; phr-synsem since they can be post-nominal modifiers.
word := word-or-lexrule &
[ PUNCT no-punct,
ROOT -,
SYNSEM [ LOCAL.CAT.STACK <>,
FIRST-WORD bool ],
BRACKET sort ].
lex-item := word-or-lexrule.
cont-1 := lex-item &
[ STEM [ FROM #from,
TO #to ],
SYNSEM.LOCAL.CONT.RELS <! [ CFROM #from,
CTO #to ] !> ].
cont-2 := lex-item &
[ STEM [ FROM #from,
TO #to ],
SYNSEM.LOCAL.CONT.RELS <! [ CFROM #from,
CTO #to ],
[ CFROM #from,
CTO #to ] !> ].
norm-lex-item := lex-item &
[ SYNSEM [ FIRST-WORD -,
LOCAL.CONT [ HOOK [ LTOP #ltop,
INDEX #index ] ],
LKEYS [ KEYREL [ LBL #ltop,
ARG0 #index ] ] ] ].
native-lex-item := lex-item &
[ TRAITS native_token_list,
SYNSEM.FIRST-WORD - ].
keyrel-lex-item := native-lex-item &
[ SYNSEM.LKEYS.KEYREL #relation,
LEXREL <! #relation !> ].
qrel-lex-item := native-lex-item &
[ SYNSEM.LKEYS.Q.QREL #relation,
LEXREL <! #relation !> ].
generic-lex-item := lex-item &
[ TRAITS generic_token_list ].
; PH 15-dec-03: I add the feature INFLECTION to deal with inflectional
; patterns.
lexeme := keyrel-lex-item &
[ INFLECTED -,
INFLECTION inflection ].
;; Not all phrases have SYNSEM phr-synsem, since we need to allow the
;; head-comp rules to build signs which are still [ SYNSEM lex-synsem
;; ], for constructions like "twenty-two" and "five fifteen p.m.". So
;; most phrases will assign the type phr-synsem to the value of
;; SYNSEM, but not all.
; Phrases don't have argument structure, but ARG-S is a feature
; of local, not sign. So rather than have subtypes of local for
; phrases and lexical items, constrain phrases to have empty ARG-S.
phrase := phrase-or-lexrule &
[ ROOT bool ].
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
; Affixation
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
non-affix-bearing := word-or-lexrule &
[ INFLECTED + ].
; Rule
rule := sign &
[ RULE-NAME string ].
; LABEL-NAME and META used for labeling nodes in parse trees
tree-node-label := *top* &
[ NODE sign ].
label := sign &
[ LABEL-NAME string ].
;; see lkbpatches
meta := sign &
[ META-PREFIX string,
META-SUFFIX string ].
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
; SYNSEM values
synsem-mini := avm.
synsem-link := synsem-mini &
[ LINK predsort ].
synsem-min := synsem-mini &
[ OPT bool,
LOCAL mod-local,
NON-LOCAL non-local-min,
SAT bool,
EXTR bool,
LTYPE link,
PHR bool,
CLITIC bool,
FIRST-WORD bool,
LKEYS lexkeys,
MARKED bool,
COMP-IND individual ].
lex-or-phrase-synsem := synsem-min &
[ LEX bool,
--PHR-KEY relation ].
synsem := synsem-min & synsem-link &
[ OPT +,
MODIFIED xmod,
LKEYS lexkeys ].
expressed-synsem := synsem.
canonical-synsem := expressed-synsem &
[ MODIFIED xmod ].
lex-synsem := canonical-synsem & lex-or-phrase-synsem &
[ LOCAL local-min,
LEX + ].
phr-synsem := canonical-synsem & lex-or-phrase-synsem &
[ LOCAL local-min,
LEX -,
--PHR-KEY relation ].
non-canonical := synsem &
[ LOCAL.CONT.HOOK.INDEX individual ].
expressed-non-canonical := non-canonical & expressed-synsem.
gap := expressed-non-canonical &
[ LOCAL #local,
NON-LOCAL.SLASH < #local > ].
unexpressed := synsem-min &
[ NON-LOCAL.SLASH null ].
unexpressed-reg := unexpressed & non-canonical.
anti-synsem := unexpressed.
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
; LOCAL & NON-LOCAL values
; The feature AGR is introduced on LOCAL rather than on CAT (or on HEAD) since
; coordination schema unify the CAT value of the daughters with that of then
; mother, but need to be able to change AGR on the mother (to get plural
; agreement on verb when subject is a coordinated NP with "and" vs. "or").
mod-local := avm.
; Type for saying that there is no topic
no-topic := local-min.
local-min := mod-local &
[ CAT cat-min,
CONT mrs-min,
AGR individual,
NEG-IN message_m_rel,
NEG-OUT message_m_rel ].
local := local-min &
[ TOPIC local-min,
MODAL modal-min ].
local-gap := local &
[ EXTR-REL relation,
EXTR-LINK link ].
; Types for distinguishing scopal v. intersective modifiers.
; (These types are used in the MOD value of modifiers, and
; references by the scopal/intersective head-adjunct rules.)
scopal-mod := local.
intersective-mod := local.
non-local-min := avm.
non-local := non-local-min &
[ SLASH list ].
;non-local-none := non-local &
; [ SLASH < >,
; QUE 0-dlist,
; REL 0-dlist ].
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
; CAT values
cat-min := avm.
;; PH 06-mar-2006: Introduced C-COGN-ST. Its function is to show the cognitive
;; status of the last argument that combined with the projection.
cat := cat-min &
[ HEAD head-min,
VAL valence-min,
CASE case-min,
MC luk,
ARGUMENT synsem-mini,
VBL synsem-mini,
C-COGN-ST cogn-st,
STACK list,
COMPARATIVE bool,
QUANT bool,
AAIF bool,
C bool,
INTRANS bool ].
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
; HEAD & VAL
head-min := avm.
; It is expected that head will have many more features, but it
; is not yet clear which are relevant crosslinguistically. In
; the English grammar, HEAD features include CASE, PRD, AUX, INV,
; TAM, and VFORM. (Re: TAM --- it is sometimes useful to have the
; semantic information encoded in EVENT.E accessible via the head
; path.)
; Which subtypes of head are necessary and which head features are
; declared for which subtypes is also a language-specific question.
head := head-min &
[ MOD list,
KEYS keys_min,
MESS basic-message_m_rel,
AGREE agree,
CATEGORY category,
PREDICATIVE bool,
NOM bool,
SU-IND individual,
ELLIPSIS bool,
PERFPART bool ].
modal-min := avm.
valence-min := avm.
; PH 04-feb-04: Removed the SUBJ, COMPS and SPEC features and inserted the
; DOBJ, IOBJ and POBJ features.
; PH 05-sep-05: Removed the SPR, DOBJ, IOBJ and POBJ features and inserted
; the ARG1, ARG2, ARG3 and ARG4 features.
; Replaced ARG1, ARG2, ARG3, ARG4 with CMP1, CMP2, CMP3, CMP4 in order
; not to conflict with the MRS features (2011-12-01; ph)
valence := valence-min &
[ ARGFRAME link,
CMP1 synsem-mini,
CMP2 synsem-mini,
CMP3 synsem-mini,
CMP4 synsem-mini,
PART link,
SISTER synsem-mini ].
keys_min := avm.
keys := keys_min &
[ KEY predsort,
ALTKEY predsort ].
; One of a grammatically salient inventory of semantic sorts, such as
; 'animate' or 'time'
semsort := sort.
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
; CONT values
;
; HOOK : Externally visible attributes of a sign
; RELS diff-list ; List of semantic relations
; HCONS diff-list ; Scope constraints: list of qeq's
mrs-min := avm.
mrs := mrs-min &
[ HOOK hook,
RELS diff-list,
HCONS diff-list,
MSG basic-message_m_rel ].
; HOOK values include
; LTOP ; Local top handle
; INDEX ; The salient nominal instance or event
; XARG ; The external (controlled) argument of a phrase
hook := avm &
[ LTOP handle,
INDEX individual,
XARG individual,
PARG individual ].
; MRSs are divided into psoas (with a distinguished event) and
; nom-objs (with a distinguished index). We use a polymorphic
; attribute name INDEX for both of these, to simplify manipulation of
; these objects; for example, modifying PPs assign as their ARG's
; value the INDEX of the phrase they modify, whether it's an N-bar
; (with a ref-ind value) or a VP (with an event value). Similarly
; useful for coordination.
psoa := mrs &
[ HOOK.INDEX event ].
nom-obj := mrs &
[ HOOK.INDEX index ].
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
; LKEYS attributes, providing pointers to semantic relations and complement
; predsorts in lexical types:
; KEYREL relation ; Pointer to main relation in RELS
; ALTKEYREL relation ; Pointer to an alternate relation in RELS
; --COMPKEY predsort ; Pointer to the first complement's KEY predsort
; --OCOMPKEY predsort ; Pointer to the oblique complement's KEY predsort
qitems := avm &
[ QREL relation,
QEQ qeq ].
lexkeys := avm &
[ KEYREL relation,
ALTKEYREL relation,
--COMPKEY predsort,
--OCOMPKEY predsort,
CNSTR relation,
Q qitems,
ELLREL relation ].
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
; CTXT values
;ctxt-min := avm.
;ctxt := ctxt-min &
; [ ACTIVATED bool,
; PRESUP diff-list ].
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
; Basic semantic types
; The message represents the semantic type of a clause (cf. Ginzburg &
; Sag 2000). All clauses have messages. Elements that take clauses
; as semantic arguments should end up with the LBL of the clause as
; the value of ARGn, L/R-HNDL, etc. The MARG (message argument) of a
; message is a handle that qeqs the LBL of the main verb in the clause.
; This leaves room for quantifiers to scope at each clause without
; allowing scope ambiguity between quanitifers and messages, as it is
; not clear what that would mean.
basic_message := relation.
message := basic_message &
[ PRED message_m_rel ].
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
; Message preds
basic-message_m_rel := predsort.
message_m_rel := basic-message_m_rel.
;comm-or-ques_m_rel := message_m_rel.
;command_m_rel := comm-or-ques_m_rel.
;prop-or-ques_m_rel := message_m_rel. ;for COMPS of e.g. 'know'
;prop-or-wh_m_rel := message_m_rel.
;proposition_m_rel := prop-or-ques_m_rel & prop-or-wh_m_rel.
;wh-question_m_rel := prop-or-wh_m_rel & question_m_rel.
;yes-no-ques_m_rel := question_m_rel & comm-or-ques_m_rel.
;abstr-ques_m_rel := message_m_rel.
;question_m_rel := abstr-ques_m_rel.
no-msg_m_rel := basic-message_m_rel.
command_m_rel := message_m_rel.
prop-cmpl-yn-wh_m_rel := message_m_rel.
neg-or-yn_m_rel := prop-cmpl-yn-wh_m_rel.
pos_m_rel := message_m_rel.
neg_m_rel := neg-or-yn_m_rel.
prop-yn-wh_m_rel := prop-cmpl-yn-wh_m_rel.
prop-yn_m_rel := prop-yn-wh_m_rel.
yes-no-ques_m_rel := prop-yn_m_rel & neg-or-yn_m_rel.
yes-no-pos_m_rel := yes-no-ques_m_rel & pos_m_rel.
yes-no-neg_m_rel := yes-no-ques_m_rel & neg_m_rel.
prop-wh_m_rel := prop-yn-wh_m_rel.
wh-question_m_rel := prop-wh_m_rel.
prop_m_rel := prop-wh_m_rel & prop-yn_m_rel.
;prop_pos_m_rel := prop_m_rel & pos_m_rel.
;prop_neg_m_rel := prop_m_rel & neg_m_rel.
no-msg := basic_message.
prontype := sort.
real_pron := prontype.
std_pron := real_pron.
recip := real_pron.
refl_pron := real_pron.
impers := real_pron.
demon := real_pron.
zero_pron := real_pron.
not_pron := prontype.
; Subtype of int_rel for tag questions and structures in other languages
; with equivalent pragmatics.
;ne_m_rel := abstr-ques_m_rel.
; Constrains handle of scopable argument HARG relative to one
; outscoped LARG handle (the "H" is mnemonic for either "higher" or
; "hole" argument, while the "L" is mnemonic for either "lower" or
; "label" argument.
qeq := avm &
[ HARG handle,
LARG handle ].
;semarg := avm &
; [ INSTLOC instloc ].
;instloc := *top.
semarg := avm &
[ INSTLOC string ].
handle := semarg.
individual := semarg &
[ COGN-ST cogn-st,
E tam,
GRADE grade,
PNG png ].
; The INDEX value of a nom-obj is an index (expletive or
; referential).
index := individual &
[ PNG png ].
; This is the type of the index of the phrase modified by predicative
; PPs, which can either modify a ref-ind nominal or an event VP.
; PH 2004-feb-27: Added the COGN-ST feature.
event-or-ref-index := individual.
; Expletives get distinguished index type so they can be
; selected semantically. In English, this type has subtypes
; for it and there. Most languages have at most one expletive,
; so those aren't included here.
; PH 2013-01-31: Changed supertype from index to individual in order
; to make event-or-ref-index distinct from expl-ind.
expl-ind := individual.
ref-ind := index & event-or-ref-index &
[ PNG png,
E.TENSE no_tense ].
full_ref-ind := ref-ind &
[ PRONTYPE prontype ].
grade := sort.
positive := grade.
comparative := grade.
superlative := grade.
;grade-ind := ref-ind &
; [ GRADE grade ].
; Types encoding agreement information, analyzed as a part of the
; index, following Pollard & Sag 1994. Which subtypes and features
; are appropriate seems highly language dependent. The agreement
; system of English doesn't justify a full cross-classification of
; number and gender, so the features of png are PN and GENDER in the
; English grammar. (See Flickinger 2000.) Sag & Wasow 1999 declare
; GENDER as a feature of the png type 3sg.
png := avm.
; Create subtypes of tense, aspect and mood as appropriate.
tense := sort.
aspect := sort.
mood := sort.
tam := avm &
[ TENSE tense ].
; ASPECT aspect,
; MOOD mood ].
event := event-or-ref-index &
[ E tam,
SF basic-message_m_rel,
COGN-ST activ-or-less,
PERF bool ].
rel-event := event &
[ RESTR bool ].
; Coordinated phrases have conjoined indices as their INDEX
; values. These are meant to be interpreted as pointers to
; the set of indices the conjunction conjoins.
conj-index := event-or-ref-index.
conj-event := conj-index & event.
conj-ref-ind := conj-index & ref-ind.
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
; Basic relation types
; Relations are classified according to the types of arguments they take. All
; relations have a handle. In addition, quantifier relations have a bound
; variable and a restriction, nominal relations have an instance, and event
; relations have an event. Furthermore, nominal relations and event relations
; can have additional roles, depending on their meaning.
; WLINK links semantic relation to input string elements, more or less.
; This becomes useful whenever a grammar is used in some application.
relation := avm &
[ LBL handle,
PRED predsort,
CFROM *top*,
CTO *top* ].
; Abstract relation subtypes. We recommend not positing a type
; for each lexical relation, but rather using the feature PRED
; to distinguish different lexical relations of the same type.
; Relation types are modified in one of two circumstances:
;
; (i) A feature needs to be introduced that is relevant for some
; relations and not others, or
;
; (ii) Something in the grammar needs to make reference to a family
; of relations that are not otherwise distinguished by a type.
; PH 04-feb-2004: I do some changes on the arg-relations, making the
; hieararchy flat, and adding PRED values.
arg0-relation := relation &
[ ARG0 semarg ].
ref-relation := arg0-relation &
[ ARG0 ref-ind ].
; arg1-or-2_rel := predsort.
; arg2-or-3_rel := predsort.
; arg1_rel := arg1-or-2_rel.
; arg2_rel := arg1-or-2_rel & arg2-or-3_rel.
; arg3_rel := arg2-or-3_rel.
; arg4_rel := predsort.
arg1-rel-min := arg0-relation &
[ ARG1 semarg ].
arg2-rel-min := arg0-relation &
[ ARG2 semarg ].
arg3-rel-min := arg0-relation &
[ ARG3 semarg ].
arg4-rel-min := arg0-relation &
[ ARG4 semarg ].
arg1-relation := arg1-rel-min.
arg12-relation := arg1-rel-min & arg2-rel-min.
arg123-relation := arg1-rel-min & arg2-rel-min & arg3-rel-min.
arg1234-relation := arg1-rel-min & arg2-rel-min & arg3-rel-min & arg4-rel-min.
arg124-relation := arg1-rel-min & arg2-rel-min & arg4-rel-min.
arg13-relation := arg1-rel-min & arg3-rel-min.
arg134-relation := arg1-rel-min & arg3-rel-min & arg4-rel-min.
arg14-relation := arg1-rel-min & arg4-rel-min.
arg2-relation := arg2-rel-min.
arg23-relation := arg2-rel-min & arg3-rel-min.
arg234-relation := arg2-rel-min & arg3-rel-min & arg4-rel-min.
arg24-relation := arg2-rel-min & arg4-rel-min.
arg3-relation := arg3-rel-min.
arg34-relation := arg3-rel-min & arg4-rel-min.
arg4-relation := arg4-rel-min.
event-relation := arg0-relation &
[ ARG0 event ].
verb-ellipsis-relation := arg1-relation.
; Noun relations
noun-relation := arg0-relation &
[ ARG0 ref-ind ].
pronoun-relation := arg0-relation &
[ PRED pron_rel,
ARG0 ref-ind ].
poss-relation := arg12-relation &
[ PRED poss_rel,
ARG0 event,
ARG1 ref-ind,
ARG2 ref-ind ].
; Relational nouns like 'picture' or 'claim' take an additional semantic
; argument
noun-arg1-relation := noun-relation & arg1-relation.
carg-relation := arg0-relation &
[ CARG string ].
number-relation := carg-relation & quant-relation.
named-relation := noun-relation & carg-relation &
[ PRED named_rel ].
const_relation := arg1-relation & carg-relation &
[ ARG0 event ].
; Preposition relations
; PH 04-feb-2003: Commented out the prep-mod-relation
;prep-mod-relation := arg12-ev-relation.
; adverb relations
; NB: Negation is represented not as a subtype of adv-relation, but as an
; adv-relation with the PRED value neg_rel.
adv-relation := arg0-relation.
; coordinating and subordinating conjunctions
subord-or-conj-relation-min := relation &
[ C-ARG individual ].
subord-or-conj-relation := subord-or-conj-relation-min &
[ L-HNDL handle,
R-HNDL handle ].
conjunction-relation := subord-or-conj-relation-min &
[ L-INDEX individual,
R-INDEX individual ].
; NB: "if_then_rel" is now a PRED value of subord-relation.
subord-relation := subord-or-conj-relation.
; noun noun compounds
; PH 04-feb-2003: Commented out the unspec-compound-relation
;unspec-compound-relation := arg12-relation &
; [ ARG0 event,
; ARG1 ref-ind,
; ARG2 ref-ind ].
; quantifier relation
quant-relation := arg0-relation &
[ ARG0 ref-ind,
RSTR handle,
BODY handle ].
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
; predsorts
norm_rel := atom.
; PH 2017-11-09: Added type for vocatives and continuatives.
init_rel := norm_rel.
named_rel := init_rel.
sg_digit := named_rel.
pl_digit := named_rel.
card_rel := named_rel.
def_digit := named_rel.
pron_rel := norm_rel.
;poss_rel := norm_rel.
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
; Head types
; Values for head features such as CASE, VFORM, ...
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
; Sorts for atomic values
; person, number and gender
; clause mode
; voice
; mood
; pronoun type
; Three-valued sort evoking Polish logician Jan Lukasiewicz
luk := sort.
; These types allow the statement of constraints (e.g., in
; subcategorization) of the form: If you care, you must have
; the value + (-), but you don't have to care. Useful for keeping
; down the number of constructions and subcategorization types.
na-or-+ := luk.
na-or-- := luk.
+-or-- := luk.
na := na-or-+ & na-or--.
bool := luk.
+ := bool & na-or-+ & +-or--.
- := bool & na-or-- & +-or--.
; Three-valued sort for distinguishing unmodified signs from both
; left-modified and right-modified signs PERIPH indicates whether this
; modifier is left- or right-peripheral in its phrase - e.g., "the IBM
; temporary employees" but "*the IBM five employees"
xmod := sort &
[ PERIPH luk ].
notmod-or-rmod := xmod.
notmod-or-lmod := xmod.
notmod := notmod-or-rmod & notmod-or-lmod.
hasmod := xmod.
lmod := hasmod & notmod-or-lmod.
rmod := hasmod & notmod-or-rmod.
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
; Basic types
sort := *top*.
predsort := sort.
atom := predsort.
avm := *top*.
list := avm.
cons := list &
[ FIRST *top*,
REST *top* ].
0-1-list := list.
1-list := 0-1-list & cons &
[ REST null ].
null := 0-1-list.
1-plus-list := cons &
[ REST cons ].
diff-list := avm &
[ LIST list,
LAST list ].
0-1-dlist := diff-list &
[ LIST 0-1-list ].
0-dlist := 0-1-dlist &
[ LIST #list,
LAST #list ].
1-dlist := 0-1-dlist &
[ LIST 1-list &
[ REST #rest & null ],
LAST #rest ].
; This type shows the basic form for diff-list appends.
; It is not meant to be used as a supertype. Actual instances
; of diff-list append will involve different features in different
; relationships to each other & the feature geometry.
dl-append := avm & [APPARG1 [LIST #first,
LAST #between],
APPARG2 [LIST #between,
LAST #last],
RESULT [LIST #first,
LAST #last]].
integer := atom.
; NB: strings should be enclosed in double quotes, e.g., [PRED "named_rel"].
initial-cfrom-val := atom.
initial-cto-val := atom.
; string := initial-cfrom-val & initial-cto-val.
string := atom.
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
; Some useful kinds of lists
; A list of optional arguments.
olist := list.
ocons := olist & cons &
[ FIRST unexpressed & [ OPT + ],
REST olist ].
onull := olist & null.
; The LinGO grammar also makes use of a prolist -- or list
; of synsems of type pro-ss.
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
; Lexical rules
; PH 2016-08-09: Took out the ALTS DTR.ALTS reentrancy in order to allow
; for passive inflection of main verbs: beundres
lex-rule := phrase-or-lexrule & word-or-lexrule &
[ NEEDS-AFFIX bool,
SYNSEM [ LOCAL.CONT [ RELS [ LIST #first,
LAST #last ],
HCONS [ LIST #hfirst,
LAST #hlast ] ],
LKEYS.CNSTR #rel ],
DTR #dtr & word-or-lexrule &
[ SYNSEM [ LOCAL.CONT [ RELS [ LIST #first,
LAST #middle ],
HCONS [ LIST #hfirst,
LAST #hmiddle ] ],
LKEYS.CNSTR #rel ] ],
C-CONT [ RELS [ LIST #middle,
LAST #last ],
HCONS [ LIST #hmiddle,
LAST #hlast ] ],
ARGS < #dtr > ].
; Lexical rules vary on two dimensions: whether they are lexeme-to-lexeme
; or lexeme-to-word and whether or not they involve spelling changes.
; Accordingly, we define four subtypes of lex-rule, which have
; four cross-classified glb subtypes:
; Note that the lexeme/word distinction is represented via a feature
; [INFLECTED bool] rather than as a type. We find this more convenient,
; as it allows certain words to be [INFLECTED +] from the start without
; having to twist the hierarchy too much (especially if one makes use
; of defaults).
; Lexeme-to-word rules are hypothesized to monotonically add synsem
; information.
lexeme-to-word-rule := lex-rule &
[ INFLECTED +,
KEY-ARG #keyarg,
SYNSEM #synsem,
ROOT #root,
DTR [ INFLECTED -,
KEY-ARG #keyarg,
SYNSEM #synsem,
ROOT #root ],
C-CONT.RELS <! !> ].
; Lexeme-to-lexeme rules can make more radical changes to the SYNSEM value.
lexeme-to-lexeme-rule := lex-rule & lexeme &
[ INFLECTED #infl,
SYNSEM.LOCAL.CAT.MC #mc,
DTR [ INFLECTED #infl,
SYNSEM.LOCAL.CAT.MC #mc ] ].
; Spelling changing rules. The LKB identifies these rules based
; on the NEEDS-AFFIX value.
inflecting-lex-rule := lex-rule &
[ NEEDS-AFFIX + ].
; Spelling-preserving rules copy up the STEM (orthography) of
; the daughter.
constant-lex-rule := lex-rule &
[ STEM #stem,
DTR [ STEM #stem ]].
; Cross-classified glb types