-
Notifications
You must be signed in to change notification settings - Fork 2.7k
/
TregexTest.java
1790 lines (1583 loc) · 84.3 KB
/
TregexTest.java
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
package edu.stanford.nlp.trees.tregex;
import junit.framework.TestCase;
import java.io.IOException;
import java.io.StringReader;
import java.util.IdentityHashMap;
import java.util.Set;
import edu.stanford.nlp.trees.*;
import java.util.function.Function;
public class TregexTest extends TestCase {
// We don't use valueOf because we sometimes use trees such as
// (bar (foo (foo 1))), and the default valueOf uses a
// TreeNormalizer that removes nodes from such a tree
public static Tree treeFromString(String s) {
try {
TreeReader tr = new PennTreeReader(new StringReader(s),
new LabeledScoredTreeFactory());
return tr.readTree();
} catch (IOException e) {
throw new RuntimeException(e);
}
}
public static Tree[] treesFromString(String ... s) {
Tree[] trees = new Tree[s.length];
for (int i = 0; i < s.length; ++i) {
trees[i] = treeFromString(s[i]);
}
return trees;
}
/** This was buggy in 2010. But John Bauer fixed it. */
public void testJoãoSilva() {
final TregexPattern tregex1 = TregexPattern.compile(
"PNT=p >>- (__=l >, (__=t <- (__=r <, __=m <- (__ <, CONJ <- __=z))))");
final TregexPattern tregex2 = TregexPattern.compile(
"PNT=p >>- (/(.+)/#1%var=l >, (__=t <- (__=r <, /(.+)/#1%var=m <- (__ <, CONJ <- /(.+)/#1%var=z))))");
final TregexPattern tregex3 = TregexPattern.compile(
"PNT=p >>- (__=l >, (__=t <- (__=r <, ~l <- (__ <, CONJ <- ~l))))");
Tree tree = treeFromString("(T (X (N (N Moe (PNT ,)))) (NP (X (N Curly)) (NP (CONJ and) (X (N Larry)))))");
TregexMatcher matcher1 = tregex1.matcher(tree);
assertTrue(matcher1.find());
TregexMatcher matcher2 = tregex2.matcher(tree);
assertTrue(matcher2.find());
TregexMatcher matcher3 = tregex3.matcher(tree);
assertTrue(matcher3.find());
}
public void testNoResults() {
final TregexPattern pMWE = TregexPattern.compile("/^MW/");
Tree tree = treeFromString("(Foo)");
TregexMatcher matcher = pMWE.matcher(tree);
assertFalse(matcher.find());
}
public void testOneResult() {
final TregexPattern pMWE = TregexPattern.compile("/^MW/");
Tree tree = treeFromString("(ROOT (MWE (N 1) (N 2) (N 3)))");
TregexMatcher matcher = pMWE.matcher(tree);
assertTrue(matcher.find());
Tree match = matcher.getMatch();
assertEquals("(MWE (N 1) (N 2) (N 3))", match.toString());
assertFalse(matcher.find());
}
public void testTwoResults() {
final TregexPattern pMWE = TregexPattern.compile("/^MW/");
Tree tree = treeFromString("(ROOT (MWE (N 1) (N 2) (N 3)) (MWV (A B)))");
TregexMatcher matcher = pMWE.matcher(tree);
assertTrue(matcher.find());
Tree match = matcher.getMatch();
assertEquals("(MWE (N 1) (N 2) (N 3))", match.toString());
assertTrue(matcher.find());
match = matcher.getMatch();
assertEquals("(MWV (A B))", match.toString());
assertFalse(matcher.find());
}
/**
* a tregex pattern should be able to go more than once.
* just like me.
*/
public void testReuse() {
final TregexPattern pMWE = TregexPattern.compile("/^MW/");
Tree tree = treeFromString("(ROOT (MWE (N 1) (N 2) (N 3)) (MWV (A B)))");
TregexMatcher matcher = pMWE.matcher(tree);
assertTrue(matcher.find());
assertTrue(matcher.find());
assertFalse(matcher.find());
tree = treeFromString("(ROOT (MWE (N 1) (N 2) (N 3)))");
matcher = pMWE.matcher(tree);
assertTrue(matcher.find());
assertFalse(matcher.find());
tree = treeFromString("(Foo)");
matcher = pMWE.matcher(tree);
assertFalse(matcher.find());
}
/**
* reruns one of the simpler tests using the test class to make sure
* the test class works
*/
public void testTest() {
runTest("/^MW/", "(ROOT (MWE (N 1) (N 2) (N 3)) (MWV (A B)))",
"(MWE (N 1) (N 2) (N 3))", "(MWV (A B))");
}
public void testWordDisjunction() {
TregexPattern pattern = TregexPattern.compile("a|b|c << bar");
runTest(pattern, "(a (bar 1))", "(a (bar 1))");
runTest(pattern, "(b (bar 1))", "(b (bar 1))");
runTest(pattern, "(c (bar 1))", "(c (bar 1))");
runTest(pattern, "(d (bar 1))");
runTest(pattern, "(e (bar 1))");
runTest(pattern, "(f (bar 1))");
runTest(pattern, "(g (bar 1))");
pattern = TregexPattern.compile("a|b|c|d|e|f << bar");
runTest(pattern, "(a (bar 1))", "(a (bar 1))");
runTest(pattern, "(b (bar 1))", "(b (bar 1))");
runTest(pattern, "(c (bar 1))", "(c (bar 1))");
runTest(pattern, "(d (bar 1))", "(d (bar 1))");
runTest(pattern, "(e (bar 1))", "(e (bar 1))");
runTest(pattern, "(f (bar 1))", "(f (bar 1))");
runTest(pattern, "(g (bar 1))");
}
public void testDominates() {
final TregexPattern dominatesPattern =
TregexPattern.compile("foo << bar");
runTest(dominatesPattern, "(foo (bar 1))", "(foo (bar 1))");
runTest(dominatesPattern, "(foo (a (bar 1)))", "(foo (a (bar 1)))");
runTest(dominatesPattern, "(foo (a (b (bar 1))))", "(foo (a (b (bar 1))))");
runTest(dominatesPattern, "(foo (a (b 1) (bar 2)))",
"(foo (a (b 1) (bar 2)))");
runTest(dominatesPattern, "(foo (a (b 1) (c 2) (bar 3)))",
"(foo (a (b 1) (c 2) (bar 3)))");
runTest(dominatesPattern, "(foo (baz 1))");
runTest(dominatesPattern, "(a (foo (bar 1)))", "(foo (bar 1))");
runTest(dominatesPattern, "(a (foo (baz (bar 1))))",
"(foo (baz (bar 1)))");
runTest(dominatesPattern, "(a (foo (bar 1)) (foo (bar 2)))",
"(foo (bar 1))", "(foo (bar 2))");
final TregexPattern dominatedPattern =
TregexPattern.compile("foo >> bar");
runTest(dominatedPattern, "(foo (bar 1))");
runTest(dominatedPattern, "(foo (a (bar 1)))");
runTest(dominatedPattern, "(foo (a (b (bar 1))))");
runTest(dominatedPattern, "(foo (a (b 1) (bar 2)))");
runTest(dominatedPattern, "(foo (a (b 1) (c 2) (bar 3)))");
runTest(dominatedPattern, "(bar (foo 1))", "(foo 1)");
runTest(dominatedPattern, "(bar (a (foo 1)))", "(foo 1)");
runTest(dominatedPattern, "(bar (a (foo (b 1))))", "(foo (b 1))");
runTest(dominatedPattern, "(bar (a (foo 1) (foo 2)))",
"(foo 1)", "(foo 2)");
runTest(dominatedPattern, "(bar (foo (foo 1)))", "(foo (foo 1))", "(foo 1)");
runTest(dominatedPattern, "(a (bar (foo 1)))", "(foo 1)");
}
public void testImmediatelyDominates() {
final TregexPattern dominatesPattern =
TregexPattern.compile("foo < bar");
runTest(dominatesPattern, "(foo (bar 1))", "(foo (bar 1))");
runTest(dominatesPattern, "(foo (a (bar 1)))");
runTest(dominatesPattern, "(a (foo (bar 1)))", "(foo (bar 1))");
runTest(dominatesPattern, "(a (foo (baz 1) (bar 2)))",
"(foo (baz 1) (bar 2))");
runTest(dominatesPattern, "(a (foo (bar 1)) (foo (bar 2)))",
"(foo (bar 1))", "(foo (bar 2))");
final TregexPattern dominatedPattern =
TregexPattern.compile("foo > bar");
runTest(dominatedPattern, "(foo (bar 1))");
runTest(dominatedPattern, "(foo (a (bar 1)))");
runTest(dominatedPattern, "(foo (a (b (bar 1))))");
runTest(dominatedPattern, "(foo (a (b 1) (bar 2)))");
runTest(dominatedPattern, "(foo (a (b 1) (c 2) (bar 3)))");
runTest(dominatedPattern, "(bar (foo 1))", "(foo 1)");
runTest(dominatedPattern, "(bar (a (foo 1)))");
runTest(dominatedPattern, "(bar (foo 1) (foo 2))", "(foo 1)", "(foo 2)");
runTest(dominatedPattern, "(bar (foo (foo 1)))", "(foo (foo 1))");
runTest(dominatedPattern, "(a (bar (foo 1)))", "(foo 1)");
}
public void testSister() {
TregexPattern pattern = TregexPattern.compile("/.*/ $ foo");
runTest(pattern, "(a (foo 1) (bar 2))", "(bar 2)");
runTest(pattern, "(a (bar 1) (foo 2))", "(bar 1)");
runTest(pattern, "(a (foo 1) (bar 2) (baz 3))", "(bar 2)", "(baz 3)");
runTest(pattern, "(a (foo (bar 2)) (baz 3))", "(baz 3)");
runTest(pattern, "(a (foo (bar 2)) (baz (bif 3)))", "(baz (bif 3))");
runTest(pattern, "(a (foo (bar 2)))");
runTest(pattern, "(a (foo 1))");
pattern = TregexPattern.compile("bar|baz $ foo");
runTest(pattern, "(a (foo 1) (bar 2))", "(bar 2)");
runTest(pattern, "(a (bar 1) (foo 2))", "(bar 1)");
runTest(pattern, "(a (foo 1) (bar 2) (baz 3))", "(bar 2)", "(baz 3)");
runTest(pattern, "(a (foo (bar 2)) (baz 3))", "(baz 3)");
runTest(pattern, "(a (foo (bar 2)) (baz (bif 3)))", "(baz (bif 3))");
runTest(pattern, "(a (foo (bar 2)))");
runTest(pattern, "(a (foo 1))");
pattern = TregexPattern.compile("/.*/ $ foo");
runTest(pattern, "(a (foo 1) (foo 2))", "(foo 1)", "(foo 2)");
runTest(pattern, "(a (foo 1))");
pattern = TregexPattern.compile("foo $ foo");
runTest(pattern, "(a (foo 1) (foo 2))", "(foo 1)", "(foo 2)");
runTest(pattern, "(a (foo 1))");
pattern = TregexPattern.compile("foo $ foo=a");
Tree tree = treeFromString("(a (foo 1) (foo 2) (foo 3))");
TregexMatcher matcher = pattern.matcher(tree);
assertTrue(matcher.find());
assertEquals("(foo 1)", matcher.getMatch().toString());
assertEquals("(foo 2)", matcher.getNode("a").toString());
assertTrue(matcher.find());
assertEquals("(foo 1)", matcher.getMatch().toString());
assertEquals("(foo 3)", matcher.getNode("a").toString());
assertTrue(matcher.find());
assertEquals("(foo 2)", matcher.getMatch().toString());
assertEquals("(foo 1)", matcher.getNode("a").toString());
assertTrue(matcher.find());
assertEquals("(foo 2)", matcher.getMatch().toString());
assertEquals("(foo 3)", matcher.getNode("a").toString());
assertTrue(matcher.find());
assertEquals("(foo 3)", matcher.getMatch().toString());
assertEquals("(foo 1)", matcher.getNode("a").toString());
assertTrue(matcher.find());
assertEquals("(foo 3)", matcher.getMatch().toString());
assertEquals("(foo 2)", matcher.getNode("a").toString());
assertFalse(matcher.find());
runTest("foo $ foo", "(a (foo 1))");
}
public void testPrecedesFollows() {
TregexPattern pattern = TregexPattern.compile("/.*/ .. foo");
runTest(pattern, "(a (foo 1) (bar 2))");
runTest(pattern, "(a (bar 1) (foo 2))", "(bar 1)", "(1)");
runTest(pattern, "(a (bar 1) (baz 2) (foo 3))",
"(bar 1)", "(1)", "(baz 2)", "(2)");
runTest(pattern, "(a (foo 1) (baz 2) (bar 3))");
runTest(pattern, "(a (bar (foo 1)) (baz 2))");
runTest(pattern, "(a (bar 1) (baz (foo 2)))", "(bar 1)", "(1)");
runTest(pattern, "(a (bar 1) (baz 2) (bif (foo 3)))",
"(bar 1)", "(1)", "(baz 2)", "(2)");
runTest(pattern, "(a (bar (foo 1)) (baz 2) (bif 3))");
runTest(pattern, "(a (bar 1) (baz 2) (foo (bif 3)))",
"(bar 1)", "(1)", "(baz 2)", "(2)");
runTest(pattern, "(a (bar 1) (foo (bif 2)) (baz 3))",
"(bar 1)", "(1)");
pattern = TregexPattern.compile("/.*/ ,, foo");
runTest(pattern, "(a (foo 1) (bar 2))", "(bar 2)", "(2)");
runTest(pattern, "(a (bar 1) (foo 2))");
runTest(pattern, "(a (bar 1) (baz 2) (foo 3))");
runTest(pattern, "(a (foo 1) (baz 2) (bar 3))",
"(baz 2)", "(2)", "(bar 3)", "(3)");
runTest(pattern, "(a (bar (foo 1)) (baz 2))", "(baz 2)", "(2)");
runTest(pattern, "(a (bar 1) (baz (foo 2)))");
runTest(pattern, "(a (bar 1) (baz 2) (bif (foo 3)))");
runTest(pattern, "(a (bar (foo 1)) (baz 2) (bif 3))",
"(baz 2)", "(2)", "(bif 3)", "(3)");
runTest(pattern, "(a (bar 1) (baz 2) (foo (bif 3)))");
runTest(pattern, "(a (foo (bif 1)) (bar 2) (baz 3))",
"(bar 2)", "(2)", "(baz 3)", "(3)");
runTest(pattern, "(a (bar 1) (foo (bif 2)) (baz 3))",
"(baz 3)", "(3)");
}
public void testImmediatePrecedesFollows() {
// immediate precedes
TregexPattern pattern = TregexPattern.compile("/.*/ . foo");
runTest(pattern, "(a (foo 1) (bar 2))");
runTest(pattern, "(a (bar 1) (foo 2))", "(bar 1)", "(1)");
runTest(pattern, "(a (bar 1) (baz 2) (foo 3))", "(baz 2)", "(2)");
runTest(pattern, "(a (foo 1) (baz 2) (bar 3))");
runTest(pattern, "(a (bar (foo 1)) (baz 2))");
runTest(pattern, "(a (bar 1) (baz (foo 2)))", "(bar 1)", "(1)");
runTest(pattern, "(a (bar 1) (baz 2) (bif (foo 3)))", "(baz 2)", "(2)");
runTest(pattern, "(a (bar (foo 1)) (baz 2) (bif 3))");
runTest(pattern, "(a (bar 1) (baz 2) (foo (bif 3)))", "(baz 2)", "(2)");
runTest(pattern, "(a (bar 1) (foo (bif 2)) (baz 3))", "(bar 1)", "(1)");
runTest(pattern, "(a (bar 1) (foo 2) (baz 3) (foo 4) (bif 5))",
"(bar 1)", "(1)", "(baz 3)", "(3)");
runTest(pattern, "(a (bar 1) (foo 2) (foo 3) (baz 4))",
"(bar 1)", "(1)", "(foo 2)", "(2)");
runTest(pattern, "(a (b (c 1) (d 2)) (foo))",
"(b (c 1) (d 2))", "(d 2)", "(2)");
runTest(pattern, "(a (b (c 1) (d 2)) (bar (foo 3)))",
"(b (c 1) (d 2))", "(d 2)", "(2)");
runTest(pattern, "(a (b (c 1) (d 2)) (bar (baz 3) (foo 4)))",
"(baz 3)", "(3)");
runTest(pattern, "(a (b (c 1) (d 2)) (bar (baz 2 3) (foo 4)))",
"(baz 2 3)", "(3)");
// immediate follows
pattern = TregexPattern.compile("/.*/ , foo");
runTest(pattern, "(a (foo 1) (bar 2))", "(bar 2)", "(2)");
runTest(pattern, "(a (bar 1) (foo 2))");
runTest(pattern, "(a (bar 1) (baz 2) (foo 3))");
runTest(pattern, "(a (foo 1) (baz 2) (bar 3))", "(baz 2)", "(2)");
runTest(pattern, "(a (bar (foo 1)) (baz 2))", "(baz 2)", "(2)");
runTest(pattern, "(a (bar 1) (baz (foo 2)))");
runTest(pattern, "(a (bar 1) (baz 2) (bif (foo 3)))");
runTest(pattern, "(a (bar (foo 1)) (baz 2) (bif 3))", "(baz 2)", "(2)");
runTest(pattern, "(a (bar 1) (baz 2) (foo (bif 3)))");
runTest(pattern, "(a (foo (bif 1)) (bar 2) (baz 3))", "(bar 2)", "(2)");
runTest(pattern, "(a (bar 1) (foo (bif 2)) (baz 3))", "(baz 3)", "(3)");
runTest(pattern, "(a (bar 1) (foo 2) (baz 3) (foo 4) (bif 5))",
"(baz 3)", "(3)", "(bif 5)", "(5)");
runTest(pattern, "(a (bar 1) (foo 2) (foo 3) (baz 4))",
"(foo 3)", "(3)", "(baz 4)", "(4)");
runTest(pattern, "(a (foo) (b (c 1) (d 2)))",
"(b (c 1) (d 2))", "(c 1)", "(1)");
runTest(pattern, "(a (bar (foo 3)) (b (c 1) (d 2)))",
"(b (c 1) (d 2))", "(c 1)", "(1)");
runTest(pattern, "(a (bar (baz 3) (foo 4)) (b (c 1) (d 2)))",
"(b (c 1) (d 2))", "(c 1)", "(1)");
runTest(pattern, "(a (bar (foo 4) (baz 3)) (b (c 1) (d 2)))",
"(baz 3)", "(3)");
}
public void testLeftRightMostDescendant() {
// B leftmost descendant of A
runTest("/.*/ <<, /1/", "(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))",
"(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))",
"(a (foo 1 2) (bar 3 4))", "(foo 1 2)");
runTest("/.*/ <<, /2/", "(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))");
runTest("/.*/ <<, foo", "(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))",
"(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))",
"(a (foo 1 2) (bar 3 4))");
runTest("/.*/ <<, baz", "(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))",
"(b (baz 5))");
// B rightmost descendant of A
runTest("/.*/ <<- /1/", "(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))");
runTest("/.*/ <<- /2/", "(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))",
"(foo 1 2)");
runTest("/.*/ <<- /4/", "(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))",
"(a (foo 1 2) (bar 3 4))", "(bar 3 4)");
// A leftmost descendant of B
runTest("/.*/ >>, root", "(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))",
"(a (foo 1 2) (bar 3 4))", "(foo 1 2)", "(1)");
runTest("/.*/ >>, a", "(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))",
"(foo 1 2)", "(1)");
runTest("/.*/ >>, bar", "(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))",
"(3)");
// A rightmost descendant of B
runTest("/.*/ >>- root", "(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))",
"(b (baz 5))", "(baz 5)", "(5)");
runTest("/.*/ >>- a", "(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))",
"(bar 3 4)", "(4)");
runTest("/.*/ >>- /1/", "(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))");
}
public void testFirstLastChild() {
// A is the first child of B
runTest("/.*/ >, root", "(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))",
"(a (foo 1 2) (bar 3 4))");
runTest("/.*/ >, a", "(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))",
"(foo 1 2)");
runTest("/.*/ >, foo", "(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))",
"(1)");
runTest("/.*/ >, bar", "(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))",
"(3)");
// A is the last child of B
runTest("/.*/ >- root", "(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))",
"(b (baz 5))");
runTest("/.*/ >- a", "(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))",
"(bar 3 4)");
runTest("/.*/ >- foo", "(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))",
"(2)");
runTest("/.*/ >- bar", "(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))",
"(4)");
runTest("/.*/ >- b", "(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))",
"(baz 5)");
// B is the first child of A
runTest("/.*/ <, root", "(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))");
runTest("/.*/ <, a", "(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))",
"(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))");
runTest("/.*/ <, /1/", "(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))",
"(foo 1 2)");
runTest("/.*/ <, /2/", "(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))");
runTest("/.*/ <, bar", "(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))");
runTest("/.*/ <, /3/", "(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))",
"(bar 3 4)");
runTest("/.*/ <, /4/", "(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))");
// B is the last child of A
runTest("/.*/ <- root", "(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))");
runTest("/.*/ <- a", "(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))");
runTest("/.*/ <- /1/", "(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))");
runTest("/.*/ <- /2/", "(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))",
"(foo 1 2)");
runTest("/.*/ <- bar", "(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))",
"(a (foo 1 2) (bar 3 4))");
runTest("/.*/ <- /3/", "(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))");
runTest("/.*/ <- /4/", "(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))",
"(bar 3 4)");
}
public void testIthChild() {
// A is the ith child of B
runTest("/.*/ >1 root", "(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))",
"(a (foo 1 2) (bar 3 4))");
runTest("/.*/ >1 a", "(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))",
"(foo 1 2)");
runTest("/.*/ >2 a", "(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))",
"(bar 3 4)");
runTest("/.*/ >1 foo", "(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))",
"(1)");
runTest("/.*/ >2 foo", "(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))",
"(2)");
runTest("/.*/ >1 bar", "(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))",
"(3)");
runTest("/.*/ >2 bar", "(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))",
"(4)");
// A is the -ith child of B
runTest("/.*/ >-1 root", "(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))",
"(b (baz 5))");
runTest("/.*/ >-1 a", "(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))",
"(bar 3 4)");
runTest("/.*/ >-2 a", "(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))",
"(foo 1 2)");
runTest("/.*/ >-1 foo", "(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))",
"(2)");
runTest("/.*/ >-2 bar", "(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))",
"(3)");
runTest("/.*/ >-1 bar", "(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))",
"(4)");
runTest("/.*/ >-1 b", "(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))",
"(baz 5)");
runTest("/.*/ >-2 b", "(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))");
// B is the ith child of A
runTest("/.*/ <1 root", "(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))");
runTest("/.*/ <1 a", "(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))",
"(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))");
runTest("/.*/ <1 /1/", "(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))",
"(foo 1 2)");
runTest("/.*/ <1 /2/", "(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))");
runTest("/.*/ <1 bar", "(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))");
runTest("/.*/ <2 bar", "(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))",
"(a (foo 1 2) (bar 3 4))");
runTest("/.*/ <3 bar", "(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))");
runTest("/.*/ <1 /3/", "(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))",
"(bar 3 4)");
runTest("/.*/ <1 /4/", "(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))");
runTest("/.*/ <2 /4/", "(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))",
"(bar 3 4)");
// B is the -ith child of A
runTest("/.*/ <-1 root", "(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))");
runTest("/.*/ <-1 a", "(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))");
runTest("/.*/ <-2 a", "(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))",
"(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))");
runTest("/.*/ <-1 /1/", "(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))");
runTest("/.*/ <-2 /1/", "(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))",
"(foo 1 2)");
runTest("/.*/ <-1 /2/", "(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))",
"(foo 1 2)");
runTest("/.*/ <-2 /2/", "(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))");
runTest("/.*/ <-1 bar", "(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))",
"(a (foo 1 2) (bar 3 4))");
runTest("/.*/ <-1 /3/", "(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))");
runTest("/.*/ <-2 /3/", "(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))",
"(bar 3 4)");
runTest("/.*/ <-1 /4/", "(root (a (foo 1 2) (bar 3 4)) (b (baz 5)))",
"(bar 3 4)");
}
public void testOnlyChild() {
runTest("foo <: bar", "(foo (bar 1))", "(foo (bar 1))");
runTest("foo <: bar", "(foo (bar 1) (bar 2))");
runTest("foo <: bar", "(foo)");
runTest("foo <: bar", "(foo (baz (bar)))");
runTest("foo <: bar", "(foo 1)");
runTest("bar >: foo", "(foo (bar 1))", "(bar 1)");
runTest("bar >: foo", "(foo (bar 1) (bar 2))");
runTest("bar >: foo", "(foo)");
runTest("bar >: foo", "(foo (baz (bar)))");
runTest("bar >: foo", "(bar (foo 1))");
runTest("/.*/ >: foo", "(a (foo (bar 1)) (foo (baz 2)))",
"(bar 1)", "(baz 2)");
}
public void testDominateUnaryChain() {
runTest("foo <<: bar", "(a (foo (b (c (d (bar))))))",
"(foo (b (c (d (bar)))))");
runTest("foo <<: bar", "(a (foo (b (c (d (bar) (baz))))))");
runTest("foo <<: bar", "(a (foo (b (c (d (bar)) (baz)))))");
runTest("foo <<: bar", "(a (foo (b (c (d (bar))) (baz))))");
runTest("foo <<: bar", "(a (foo (b (c (d (bar)))) (baz)))");
runTest("foo <<: bar", "(a (foo (b (c (d (bar))))) (baz))",
"(foo (b (c (d (bar)))))");
runTest("foo <<: bar", "(a (foo (b (c (bar)))))",
"(foo (b (c (bar))))");
runTest("foo <<: bar", "(a (foo (b (bar))))",
"(foo (b (bar)))");
runTest("foo <<: bar", "(a (foo (bar)))",
"(foo (bar))");
runTest("bar >>: foo", "(a (foo (b (c (d (bar))))))", "(bar)");
runTest("bar >>: foo", "(a (foo (b (c (d (bar) (baz))))))");
runTest("bar >>: foo", "(a (foo (b (c (d (bar)) (baz)))))");
runTest("bar >>: foo", "(a (foo (b (c (d (bar))) (baz))))");
runTest("bar >>: foo", "(a (foo (b (c (d (bar)))) (baz)))");
runTest("bar >>: foo", "(a (foo (b (c (d (bar))))) (baz))", "(bar)");
runTest("bar >>: foo", "(a (foo (b (c (bar)))))", "(bar)");
runTest("bar >>: foo", "(a (foo (b (bar))))", "(bar)");
runTest("bar >>: foo", "(a (foo (bar)))", "(bar)");
}
public void testPrecedingFollowingSister() {
// test preceding sisters
TregexPattern preceding = TregexPattern.compile("/.*/ $.. baz");
runTest(preceding, "(a (foo 1) (bar 2) (baz 3))", "(foo 1)", "(bar 2)");
runTest(preceding, "(root (b (foo 1)) (a (foo 1) (bar 2) (baz 3)))",
"(foo 1)", "(bar 2)");
runTest(preceding, "(root (a (foo 1) (bar 2) (baz 3)) (b (foo 1)))",
"(foo 1)", "(bar 2)");
runTest(preceding, "(a (foo 1) (baz 2) (bar 3))", "(foo 1)");
runTest(preceding, "(a (baz 1) (foo 2) (bar 3))");
// test immediately preceding sisters
TregexPattern impreceding = TregexPattern.compile("/.*/ $. baz");
runTest(impreceding, "(a (foo 1) (bar 2) (baz 3))", "(bar 2)");
runTest(impreceding, "(root (b (foo 1)) (a (foo 1) (bar 2) (baz 3)))",
"(bar 2)");
runTest(impreceding, "(root (a (foo 1) (bar 2) (baz 3)) (b (foo 1)))",
"(bar 2)");
runTest(impreceding, "(a (foo 1) (baz 2) (bar 3))", "(foo 1)");
runTest(impreceding, "(a (baz 1) (foo 2) (bar 3))");
// test following sisters
TregexPattern following = TregexPattern.compile("/.*/ $,, baz");
runTest(following, "(a (foo 1) (bar 2) (baz 3))");
runTest(following, "(root (b (foo 1)) (a (foo 1) (bar 2) (baz 3)))");
runTest(following, "(root (a (foo 1) (bar 2) (baz 3)) (b (foo 1)))");
runTest(following, "(root (a (baz 1) (bar 2) (foo 3)) (b (foo 1)))",
"(bar 2)", "(foo 3)");
runTest(following, "(a (foo 1) (baz 2) (bar 3))", "(bar 3)");
runTest(following, "(a (baz 1) (foo 2) (bar 3))", "(foo 2)", "(bar 3)");
// test immediately following sisters
TregexPattern imfollowing = TregexPattern.compile("/.*/ $, baz");
runTest(imfollowing, "(a (foo 1) (bar 2) (baz 3))");
runTest(imfollowing, "(root (b (foo 1)) (a (foo 1) (bar 2) (baz 3)))");
runTest(imfollowing, "(root (a (foo 1) (bar 2) (baz 3)) (b (foo 1)))");
runTest(imfollowing, "(root (a (baz 1) (bar 2) (foo 3)) (b (foo 1)))",
"(bar 2)");
runTest(imfollowing, "(a (foo 1) (baz 2) (bar 3))", "(bar 3)");
runTest(imfollowing, "(a (baz 1) (foo 2) (bar 3))", "(foo 2)");
}
public void testCategoryFunctions() {
Function<String, String> fooCategory = new Function<String, String>() {
public String apply(String label) {
if (label == null) {
return label;
}
if (label.equals("bar")) {
return "foo";
}
return label;
}
};
TregexPatternCompiler fooCompiler = new TregexPatternCompiler(fooCategory);
TregexPattern fooTregex = fooCompiler.compile("@foo > bar");
runTest(fooTregex, "(bar (foo 0))", "(foo 0)");
runTest(fooTregex, "(bar (bar 0))", "(bar 0)");
runTest(fooTregex, "(foo (foo 0))");
runTest(fooTregex, "(foo (bar 0))");
Function<String, String> barCategory = new Function<String, String>() {
public String apply(String label) {
if (label == null) {
return label;
}
if (label.equals("foo")) {
return "bar";
}
return label;
}
};
TregexPatternCompiler barCompiler = new TregexPatternCompiler(barCategory);
TregexPattern barTregex = barCompiler.compile("@bar > foo");
runTest(barTregex, "(bar (foo 0))");
runTest(barTregex, "(bar (bar 0))");
runTest(barTregex, "(foo (foo 0))", "(foo 0)");
runTest(barTregex, "(foo (bar 0))", "(bar 0)");
// These should still work, since the tregex patterns have
// different category functions. Old enough versions of tregex do
// not allow for that.
runTest(fooTregex, "(bar (foo 0))", "(foo 0)");
runTest(fooTregex, "(bar (bar 0))", "(bar 0)");
runTest(fooTregex, "(foo (foo 0))");
runTest(fooTregex, "(foo (bar 0))");
}
public void testCategoryDisjunction() {
Function<String, String> abCategory = new Function<String, String>() {
public String apply(String label) {
if (label == null) {
return label;
}
if (label.startsWith("a")) {
return "aaa";
}
if (label.startsWith("b")) {
return "bbb";
}
return label;
}
};
TregexPatternCompiler abCompiler = new TregexPatternCompiler(abCategory);
TregexPattern aaaTregex = abCompiler.compile("foo > @aaa");
runTest(aaaTregex, "(aaa (foo 0))", "(foo 0)");
runTest(aaaTregex, "(abc (foo 0))", "(foo 0)");
runTest(aaaTregex, "(bbb (foo 0))");
runTest(aaaTregex, "(bcd (foo 0))");
runTest(aaaTregex, "(ccc (foo 0))");
TregexPattern bbbTregex = abCompiler.compile("foo > @bbb");
runTest(bbbTregex, "(aaa (foo 0))");
runTest(bbbTregex, "(abc (foo 0))");
runTest(bbbTregex, "(bbb (foo 0))", "(foo 0)");
runTest(bbbTregex, "(bcd (foo 0))", "(foo 0)");
runTest(bbbTregex, "(ccc (foo 0))");
TregexPattern bothTregex = abCompiler.compile("foo > @aaa|bbb");
runTest(bothTregex, "(aaa (foo 0))", "(foo 0)");
runTest(bothTregex, "(abc (foo 0))", "(foo 0)");
runTest(bothTregex, "(bbb (foo 0))", "(foo 0)");
runTest(bothTregex, "(bcd (foo 0))", "(foo 0)");
runTest(bothTregex, "(ccc (foo 0))");
}
// tests for following/preceding described chains
public void testPrecedesDescribedChain() {
runTest("DT .+(JJ) NN", "(NP (DT the) (JJ large) (JJ green) (NN house))", "(DT the)");
runTest("DT .+(@JJ) /^NN/", "(NP (PDT both) (DT the) (JJ-SIZE large) (JJ-COLOUR green) (NNS houses))", "(DT the)");
runTest("NN ,+(JJ) DT", "(NP (DT the) (JJ large) (JJ green) (NN house))", "(NN house)");
runTest("NNS ,+(@JJ) /^DT/", "(NP (PDT both) (DT the) (JJ-SIZE large) (JJ-COLOUR green) (NNS houses))", "(NNS houses)");
runTest("NNS ,+(/^(JJ|DT).*$/) PDT", "(NP (PDT both) (DT the) (JJ-SIZE large) (JJ-COLOUR green) (NNS houses))", "(NNS houses)");
runTest("NNS ,+(@JJ) JJ", "(NP (PDT both) (DT the) (JJ large) (JJ-COLOUR green) (NNS houses))", "(NNS houses)");
// TODO: The patterns below should work but don't
// runTest("DT .+(JJ) JJ", "(NP (DT the) (JJ large) (JJ green) (NN house))", "(DT the)");
// runTest("NNS ,+(@JJ) /JJ/", "(NP (PDT both) (DT the) (JJ large) (JJ-COLOUR green) (NNS houses))", "(NNS houses)");
// runTest("NNS ,+(@JJ) /^JJ$/", "(NP (PDT both) (DT the) (JJ large) (JJ-COLOUR green) (NNS houses))", "(NNS houses)");
// runTest("NNS ,+(@JJ) @JJ", "(NP (PDT both) (DT the) (JJ large) (JJ-COLOUR green) (NNS houses))", "(NNS houses)");
}
// TODO: tests for patterns made with different headfinders,
// which will verify the thread safety of using different headfinders
public void testDominateDescribedChain() {
runTest("foo <+(bar) baz", "(a (foo (baz)))", "(foo (baz))");
runTest("foo <+(bar) baz", "(a (foo (bar (baz))))", "(foo (bar (baz)))");
runTest("foo <+(bar) baz", "(a (foo (bar (bar (baz)))))",
"(foo (bar (bar (baz))))");
runTest("foo <+(bar) baz", "(a (foo (bif (baz))))");
runTest("foo <+(!bif) baz", "(a (foo (bif (baz))))");
runTest("foo <+(!bif) baz", "(a (foo (bar (baz))))", "(foo (bar (baz)))");
runTest("foo <+(/b/) baz", "(a (foo (bif (baz))))", "(foo (bif (baz)))");
runTest("foo <+(/b/) baz", "(a (foo (bar (bif (baz)))))",
"(foo (bar (bif (baz))))");
runTest("foo <+(bar) baz", "(a (foo (bar (blah 1) (bar (baz)))))",
"(foo (bar (blah 1) (bar (baz))))");
runTest("baz >+(bar) foo", "(a (foo (baz)))", "(baz)");
runTest("baz >+(bar) foo", "(a (foo (bar (baz))))", "(baz)");
runTest("baz >+(bar) foo", "(a (foo (bar (bar (baz)))))", "(baz)");
runTest("baz >+(bar) foo", "(a (foo (bif (baz))))");
runTest("baz >+(!bif) foo", "(a (foo (bif (baz))))");
runTest("baz >+(!bif) foo", "(a (foo (bar (baz))))", "(baz)");
runTest("baz >+(/b/) foo", "(a (foo (bif (baz))))", "(baz)");
runTest("baz >+(/b/) foo", "(a (foo (bar (bif (baz)))))", "(baz)");
runTest("baz >+(bar) foo", "(a (foo (bar (blah 1) (bar (baz)))))",
"(baz)");
}
public void testSegmentedAndEqualsExpressions() {
runTest("foo : bar", "(a (foo) (bar))", "(foo)");
runTest("foo : bar", "(a (foo))");
runTest("(foo << bar) : (foo << baz)", "(a (foo (bar 1)) (foo (baz 2)))",
"(foo (bar 1))");
runTest("(foo << bar) : (foo << baz)", "(a (foo (bar 1)) (foo (baz 2)))",
"(foo (bar 1))");
runTest("(foo << bar) == (foo << baz)", "(a (foo (bar)) (foo (baz)))");
runTest("(foo << bar) : (foo << baz)", "(a (foo (bar) (baz)))",
"(foo (bar) (baz))");
runTest("(foo << bar) == (foo << baz)", "(a (foo (bar) (baz)))",
"(foo (bar) (baz))");
runTest("(foo << bar) : (baz >> a)", "(a (foo (bar) (baz)))",
"(foo (bar) (baz))");
runTest("(foo << bar) == (baz >> a)", "(a (foo (bar) (baz)))");
runTest("foo == foo", "(a (foo (bar)))", "(foo (bar))");
runTest("foo << bar == foo", "(a (foo (bar)) (foo (baz)))",
"(foo (bar))");
runTest("foo << bar == foo", "(a (foo (bar) (baz)))",
"(foo (bar) (baz))");
runTest("foo << bar == foo << baz", "(a (foo (bar) (baz)))",
"(foo (bar) (baz))");
runTest("foo << bar : (foo << baz)", "(a (foo (bar)) (foo (baz)))",
"(foo (bar))");
}
public void testTwoChildren() {
runTest("foo << bar << baz", "(foo (bar 1) (baz 2))",
"(foo (bar 1) (baz 2))");
// this is a poorly written pattern that will match 4 times
runTest("foo << __ << baz", "(foo (bar 1) (baz 2))",
"(foo (bar 1) (baz 2))", "(foo (bar 1) (baz 2))",
"(foo (bar 1) (baz 2))", "(foo (bar 1) (baz 2))");
// this one also matches 4 times
runTest("foo << bar << __", "(foo (bar 1) (baz 2))",
"(foo (bar 1) (baz 2))", "(foo (bar 1) (baz 2))",
"(foo (bar 1) (baz 2))", "(foo (bar 1) (baz 2))");
// this one also matches 4 times
runTest("foo << __ << __", "(foo (bar 1))",
"(foo (bar 1))", "(foo (bar 1))",
"(foo (bar 1))", "(foo (bar 1))");
// same thing, just making sure variable assignment doesn't throw
// it off
runTest("foo << __=a << __=b", "(foo (bar 1))",
"(foo (bar 1))", "(foo (bar 1))",
"(foo (bar 1))", "(foo (bar 1))");
// 16 times! hopefully no one writes patterns like this
runTest("foo << __ << __", "(foo (bar 1) (baz 2))",
"(foo (bar 1) (baz 2))", "(foo (bar 1) (baz 2))",
"(foo (bar 1) (baz 2))", "(foo (bar 1) (baz 2))",
"(foo (bar 1) (baz 2))", "(foo (bar 1) (baz 2))",
"(foo (bar 1) (baz 2))", "(foo (bar 1) (baz 2))",
"(foo (bar 1) (baz 2))", "(foo (bar 1) (baz 2))",
"(foo (bar 1) (baz 2))", "(foo (bar 1) (baz 2))",
"(foo (bar 1) (baz 2))", "(foo (bar 1) (baz 2))",
"(foo (bar 1) (baz 2))", "(foo (bar 1) (baz 2))");
// note: this matches because we set a=(bar 1), b=(1)
runTest("(foo << __=a << __=b) : (=a !== =b)", "(foo (bar 1))",
"(foo (bar 1))", "(foo (bar 1))");
runTest("(foo < __=a < __=b) : (=a !== =b)", "(foo (bar 1))");
// 12 times: 16 possible ways to match the nodes, but 4 of them
// are ruled out because they are the same node matching twice
runTest("(foo << __=a << __=b) : (=a !== =b)",
"(foo (bar 1) (baz 2))",
"(foo (bar 1) (baz 2))", "(foo (bar 1) (baz 2))",
"(foo (bar 1) (baz 2))", "(foo (bar 1) (baz 2))",
"(foo (bar 1) (baz 2))", "(foo (bar 1) (baz 2))",
"(foo (bar 1) (baz 2))", "(foo (bar 1) (baz 2))",
"(foo (bar 1) (baz 2))", "(foo (bar 1) (baz 2))",
"(foo (bar 1) (baz 2))", "(foo (bar 1) (baz 2))");
// would need three unique descendants, but we only have two, so
// this pattern doesn't match anything
runTest("(foo << __=a << __=b << __=c) : " +
"(=a !== =b) : (=a !== =c) : (=b !== =c)",
"(foo (bar 1))");
// TODO: this should work, but it doesn't even parse
//runTest("foo << __=a << __=b : !(=a == =b)", "(foo (bar 1))");
}
public void testDocExamples() {
runTest("S < VP < NP", "(S (VP) (NP))", "(S (VP) (NP))");
runTest("S < VP < NP", "(a (S (VP) (NP)) (S (NP) (VP)))",
"(S (VP) (NP))", "(S (NP) (VP))");
runTest("S < VP < NP", "(S (VP (NP)))");
runTest("S < VP & < NP", "(S (VP) (NP))", "(S (VP) (NP))");
runTest("S < VP & < NP", "(a (S (VP) (NP)) (S (NP) (VP)))",
"(S (VP) (NP))", "(S (NP) (VP))");
runTest("S < VP & < NP", "(S (VP (NP)))");
runTest("S < VP << NP", "(S (VP (NP)))", "(S (VP (NP)))");
runTest("S < VP << NP", "(S (VP) (foo NP))", "(S (VP) (foo NP))");
runTest("S < (VP < NP)", "(S (VP (NP)))", "(S (VP (NP)))");
runTest("S < (NP $++ VP)", "(S (NP) (VP))", "(S (NP) (VP))");
runTest("S < (NP $++ VP)", "(S (NP VP))");
runTest("(NP < NN | < NNS)", "((NP NN) (NP foo) (NP NNS))",
"(NP NN)", "(NP NNS)");
runTest("(NP (< NN | < NNS) & > S)",
"(foo (S (NP NN) (NP foo) (NP NNS)) (NP NNS))",
"(NP NN)", "(NP NNS)");
runTest("(NP [< NN | < NNS] & > S)",
"(foo (S (NP NN) (NP foo) (NP NNS)) (NP NNS))",
"(NP NN)", "(NP NNS)");
}
/**
* An example from our code which looks for month-day-year patterns
* in PTB. Relies on the pattern splitting and variable matching
* features.
*/
public void testMonthDayYear() {
String MONTH_REGEX = "January|February|March|April|May|June|July|August|September|October|November|December|Jan\\.|Feb\\.|Mar\\.|Apr\\.|Aug\\.|Sep\\.|Sept\\.|Oct\\.|Nov\\.|Dec\\.";
String testPattern = "NP=root <1 (NP=monthdayroot <1 (NNP=month <: /" + MONTH_REGEX +"/) <2 (CD=day <: __)) <2 (/^,$/=comma <: /^,$/) <3 (NP=yearroot <: (CD=year <: __)) : (=root <- =yearroot) : (=monthdayroot <- =day)";
runTest(testPattern, "(ROOT (S (NP (NNP Mr.) (NNP Good)) (VP (VBZ devotes) (NP (RB much) (JJ serious) (NN space)) (PP (TO to) (NP (NP (DT the) (NNS events)) (PP (IN of) (NP (NP (NP (NNP Feb.) (CD 25)) (, ,) (NP (CD 1942))) (, ,) (SBAR (WHADVP (WRB when)) (S (NP (JJ American) (NNS gunners)) (VP (VBD spotted) (NP (NP (JJ strange) (NNS lights)) (PP (IN in) (NP (NP (DT the) (NN sky)) (PP (IN above) (NP (NNP Los) (NNP Angeles)))))))))))))) (. .)))", "(NP (NP (NNP Feb.) (CD 25)) (, ,) (NP (CD 1942)))");
runTest(testPattern, "(ROOT (S (NP (DT The) (JJ preferred) (NNS shares)) (VP (MD will) (VP (VB carry) (NP (NP (DT a) (JJ floating) (JJ annual) (NN dividend)) (ADJP (JJ equal) (PP (TO to) (NP (NP (CD 72) (NN %)) (PP (IN of) (NP (NP (DT the) (JJ 30-day) (NNS bankers) (POS ')) (NN acceptance) (NN rate))))))) (PP (IN until) (NP (NP (NNP Dec.) (CD 31)) (, ,) (NP (CD 1994)))))) (. .)))", "(NP (NP (NNP Dec.) (CD 31)) (, ,) (NP (CD 1994)))");
runTest(testPattern, "(ROOT (S (NP (PRP It)) (VP (VBD said) (SBAR (S (NP (NN debt)) (VP (VBD remained) (PP (IN at) (NP (NP (DT the) (QP ($ $) (CD 1.22) (CD billion))) (SBAR (WHNP (DT that)) (S (VP (VBZ has) (VP (VBD prevailed) (PP (IN since) (NP (JJ early) (CD 1989))))))))) (, ,) (SBAR (IN although) (S (NP (IN that)) (VP (VBN compared) (PP (IN with) (NP (NP (QP ($ $) (CD 911) (CD million))) (PP (IN at) (NP (NP (NNP Sept.) (CD 30)) (, ,) (NP (CD 1988))))))))))))) (. .)))", "(NP (NP (NNP Sept.) (CD 30)) (, ,) (NP (CD 1988)))");
runTest(testPattern, "(ROOT (S (NP (DT The) (JJ new) (NNS notes)) (VP (MD will) (VP (VB bear) (NP (NN interest)) (PP (PP (IN at) (NP (NP (CD 5.5) (NN %)) (PP (IN through) (NP (NP (NNP July) (CD 31)) (, ,) (NP (CD 1991)))))) (, ,) (CC and) (ADVP (RB thereafter)) (PP (IN at) (NP (CD 10) (NN %)))))) (. .)))", "(NP (NP (NNP July) (CD 31)) (, ,) (NP (CD 1991)))");
runTest(testPattern, "(ROOT (S (NP (NP (NNP Francis) (NNP M.) (NNP Wheat)) (, ,) (NP (NP (DT a) (JJ former) (NNPS Securities)) (CC and) (NP (NNP Exchange) (NNP Commission) (NN member))) (, ,)) (VP (VBD headed) (NP (NP (DT the) (NN panel)) (SBAR (WHNP (WDT that)) (S (VP (VBD had) (VP (VP (VBN studied) (NP (DT the) (NNS issues)) (PP (IN for) (NP (DT a) (NN year)))) (CC and) (VP (VBD proposed) (NP (DT the) (NNP FASB)) (PP (IN on) (NP (NP (NNP March) (CD 30)) (, ,) (NP (CD 1972))))))))))) (. .)))", "(NP (NP (NNP March) (CD 30)) (, ,) (NP (CD 1972)))");
runTest(testPattern, "(ROOT (S (NP (DT The) (NNP FASB)) (VP (VBD had) (NP (PRP$ its) (JJ initial) (NN meeting)) (PP (IN on) (NP (NP (NNP March) (CD 28)) (, ,) (NP (CD 1973))))) (. .)))", "(NP (NP (NNP March) (CD 28)) (, ,) (NP (CD 1973)))");
runTest(testPattern, "(ROOT (S (S (PP (IN On) (NP (NP (NNP Dec.) (CD 13)) (, ,) (NP (CD 1973)))) (, ,) (NP (PRP it)) (VP (VBD issued) (NP (PRP$ its) (JJ first) (NN rule)))) (: ;) (S (NP (PRP it)) (VP (VBD required) (S (NP (NNS companies)) (VP (TO to) (VP (VB disclose) (NP (NP (JJ foreign) (NN currency) (NNS translations)) (PP (IN in) (NP (NNP U.S.) (NNS dollars))))))))) (. .)))", "(NP (NP (NNP Dec.) (CD 13)) (, ,) (NP (CD 1973)))");
runTest(testPattern, "(ROOT (S (NP (NP (NNP Fidelity) (NNPS Investments)) (, ,) (NP (NP (DT the) (NN nation) (POS 's)) (JJS largest) (NN fund) (NN company)) (, ,)) (VP (VBD said) (SBAR (S (NP (NN phone) (NN volume)) (VP (VBD was) (NP (NP (QP (RBR more) (IN than) (JJ double)) (PRP$ its) (JJ typical) (NN level)) (, ,) (CC but) (ADVP (RB still)) (NP (NP (NN half) (DT that)) (PP (IN of) (NP (NP (NNP Oct.) (CD 19)) (, ,) (NP (CD 1987)))))))))) (. .)))", "(NP (NP (NNP Oct.) (CD 19)) (, ,) (NP (CD 1987)))");
runTest(testPattern, "(ROOT (S (NP (JJ SOFT) (NN CONTACT) (NNS LENSES)) (VP (VP (VBP WON) (NP (JJ federal) (NN blessing)) (PP (IN on) (NP (NP (NNP March) (CD 18)) (, ,) (NP (CD 1971))))) (, ,) (CC and) (VP (ADVP (RB quickly)) (VBD became) (NP (NN eye) (NNS openers)) (PP (IN for) (NP (PRP$ their) (NNS makers))))) (. .)))", "(NP (NP (NNP March) (CD 18)) (, ,) (NP (CD 1971)))");
runTest(testPattern, "(ROOT (NP (NP (NP (VBN Annualized) (NN interest) (NNS rates)) (PP (IN on) (NP (JJ certain) (NNS investments))) (SBAR (IN as) (S (VP (VBN reported) (PP (IN by) (NP (DT the) (NNP Federal) (NNP Reserve) (NNP Board))) (PP (IN on) (NP (DT a) (JJ weekly-average) (NN basis))))))) (: :) (NP-TMP (NP (CD 1989)) (CC and) (NP (NP (NNP Wednesday)) (NP (NP (NNP October) (CD 4)) (, ,) (NP (CD 1989))))) (. .)))", "(NP (NP (NNP October) (CD 4)) (, ,) (NP (CD 1989)))");
runTest(testPattern, "(ROOT (S (S (ADVP (RB Together))) (, ,) (NP (DT the) (CD two) (NNS stocks)) (VP (VP (VBD wreaked) (NP (NN havoc)) (PP (IN among) (NP (NN takeover) (NN stock) (NNS traders)))) (, ,) (CC and) (VP (VBD caused) (NP (NP (DT a) (ADJP (CD 7.3) (NN %)) (NN drop)) (PP (IN in) (NP (DT the) (NNP Dow) (NNP Jones) (NNP Transportation) (NNP Average))) (, ,) (ADJP (JJ second) (PP (IN in) (NP (NN size))) (PP (RB only) (TO to) (NP (NP (DT the) (NN stock-market) (NN crash)) (PP (IN of) (NP (NP (NNP Oct.) (CD 19)) (, ,) (NP (CD 1987)))))))))) (. .)))", "(NP (NP (NNP Oct.) (CD 19)) (, ,) (NP (CD 1987)))");
}
/**
* More complex tests, often based on examples from our source code
*/
public void testComplex() {
String testPattern = "S < (NP=m1 $.. (VP < ((/VB/ < /^(am|are|is|was|were|'m|'re|'s|be)$/) $.. NP=m2)))";
String testTree = "(S (NP (NP (DT The) (JJ next) (NN stop)) (PP (IN on) (NP (DT the) (NN itinerary)))) (VP (VBD was) (NP (NP (NNP Chad)) (, ,) (SBAR (WHADVP (WRB where)) (S (NP (NNP Chen)) (VP (VBD dined) (PP (IN with) (NP (NP (NNP Chad) (POS \'s)) (NNP President) (NNP Idris) (NNP Debi)))))))) (. .))";
runTest(testPattern, "(ROOT " + testTree + ")", testTree);
testTree = "(S (NP (NNP Chen) (NNP Shui) (HYPH -) (NNP bian)) (VP (VBZ is) (NP (NP (DT the) (JJ first) (NML (NNP ROC) (NN president))) (SBAR (S (ADVP (RB ever)) (VP (TO to) (VP (VB travel) (PP (IN to) (NP (JJ western) (NNP Africa))))))))) (. .))";
runTest(testPattern, "(ROOT " + testTree + ")", testTree);
testTree = "(ROOT (S (NP (PRP$ My) (NN dog)) (VP (VBZ is) (VP (VBG eating) (NP (DT a) (NN sausage)))) (. .)))";
runTest(testPattern, testTree);
testTree = "(ROOT (S (NP (PRP He)) (VP (MD will) (VP (VB be) (ADVP (RB here) (RB soon)))) (. .)))";
runTest(testPattern, testTree);
testPattern = "/^NP(?:-TMP|-ADV)?$/=m1 < (NP=m2 $- /^,$/ $-- NP=m3 !$ CC|CONJP)";
testTree = "(ROOT (S (NP (NP (NP (NP (DT The) (NNP ROC) (POS \'s)) (NN ambassador)) (PP (IN to) (NP (NNP Nicaragua)))) (, ,) (NP (NNP Antonio) (NNP Tsai)) (, ,)) (ADVP (RB bluntly)) (VP (VBD argued) (PP (IN in) (NP (NP (DT a) (NN briefing)) (PP (IN with) (NP (NNP Chen))))) (SBAR (IN that) (S (NP (NP (NP (NNP Taiwan) (POS \'s)) (JJ foreign) (NN assistance)) (PP (IN to) (NP (NNP Nicaragua)))) (VP (VBD was) (VP (VBG being) (ADJP (JJ misused))))))) (. .)))";
String expectedResult = "(NP (NP (NP (NP (DT The) (NNP ROC) (POS 's)) (NN ambassador)) (PP (IN to) (NP (NNP Nicaragua)))) (, ,) (NP (NNP Antonio) (NNP Tsai)) (, ,))";
runTest(testPattern, testTree, expectedResult);
testTree = "(ROOT (S (PP (IN In) (NP (NP (DT the) (NN opinion)) (PP (IN of) (NP (NP (NNP Norman) (NNP Hsu)) (, ,) (NP (NP (NN vice) (NN president)) (PP (IN of) (NP (NP (DT a) (NNS foods) (NN company)) (SBAR (WHNP (WHNP (WP$ whose) (NN family)) (PP (IN of) (NP (CD four)))) (S (VP (VBD had) (VP (VBN spent) (NP (QP (DT a) (JJ few)) (NNS years)) (PP (IN in) (NP (NNP New) (NNP Zealand))) (PP (IN before) (S (VP (VBG moving) (PP (IN to) (NP (NNP Dongguan))))))))))))))))) (, ,) (`` \") (NP (NP (DT The) (JJ first) (NN thing)) (VP (TO to) (VP (VB do)))) (VP (VBZ is) (S (VP (VB ask) (NP (DT the) (NNS children)) (NP (PRP$ their) (NN reason)) (PP (IN for) (S (VP (VBG saying) (NP (JJ such) (NNS things)))))))) (. .)))";
expectedResult = "(NP (NP (NNP Norman) (NNP Hsu)) (, ,) (NP (NP (NN vice) (NN president)) (PP (IN of) (NP (NP (DT a) (NNS foods) (NN company)) (SBAR (WHNP (WHNP (WP$ whose) (NN family)) (PP (IN of) (NP (CD four)))) (S (VP (VBD had) (VP (VBN spent) (NP (QP (DT a) (JJ few)) (NNS years)) (PP (IN in) (NP (NNP New) (NNP Zealand))) (PP (IN before) (S (VP (VBG moving) (PP (IN to) (NP (NNP Dongguan))))))))))))))";
runTest(testPattern, testTree, expectedResult);
testTree = "(ROOT (S (NP (NP (NNP Banana)) (, ,) (NP (NN orange)) (, ,) (CC and) (NP (NN apple))) (VP (VBP are) (NP (NNS fruits))) (. .)))";
runTest(testPattern, testTree);
testTree = "(ROOT (S (NP (PRP He)) (, ,) (ADVP (RB however)) (, ,) (VP (VBZ does) (RB not) (VP (VB look) (ADJP (JJ fine)))) (. .)))";
runTest(testPattern, testTree);
}
/**
* More complex patterns to test
*/
public void testComplex2() {
String[] inputTrees = {"(ROOT (S (NP (PRP You)) (VP (VBD did) (VP (VB go) (WHADVP (WRB How) (JJ long)) (PP (IN for)))) (. .)))",
"(ROOT (S (NP (NNS Raccoons)) (VP (VBP do) (VP (VB come) (WHADVP (WRB When)) (PRT (RP out)))) (. .)))",
"(ROOT (S (NP (PRP She)) (VP (VBZ is) (VP (WHADVP (WRB Where)) (VBG working))) (. .)))",
"(ROOT (S (NP (PRP You)) (VP (VBD did) (VP (WHNP (WP What)) (VB do))) (. .)))",
"(ROOT (S (NP (PRP You)) (VP (VBD did) (VP (VB do) (PP (IN in) (NP (NNP Australia))) (WHNP (WP What)))) (. .)))"};
String pattern = "WHADVP=whadvp > VP $+ /[A-Z]*/=last ![$++ (PP < NP)]";
runTest(pattern, inputTrees[0], "(WHADVP (WRB How) (JJ long))");
runTest(pattern, inputTrees[1], "(WHADVP (WRB When))");
runTest(pattern, inputTrees[2], "(WHADVP (WRB Where))");
runTest(pattern, inputTrees[3]);
runTest(pattern, inputTrees[4]);
pattern = "VP < (/^WH/=wh $++ /^VB/=vb)";
runTest(pattern, inputTrees[0]);
runTest(pattern, inputTrees[1]);
runTest(pattern, inputTrees[2], "(VP (WHADVP (WRB Where)) (VBG working))");
runTest(pattern, inputTrees[3], "(VP (WHNP (WP What)) (VB do))");
runTest(pattern, inputTrees[4]);
pattern = "PP=pp > VP $+ WHNP=whnp";
runTest(pattern, inputTrees[0]);
runTest(pattern, inputTrees[1]);
runTest(pattern, inputTrees[2]);
runTest(pattern, inputTrees[3]);
runTest(pattern, inputTrees[4], "(PP (IN in) (NP (NNP Australia)))");
}
public void testNamed() {
Tree tree = treeFromString("(a (foo 1) (bar 2) (bar 3))");
TregexPattern pattern = TregexPattern.compile("foo=a $ bar=b");
TregexMatcher matcher = pattern.matcher(tree);
assertTrue(matcher.find());
assertEquals("(foo 1)", matcher.getMatch().toString());
assertEquals("(foo 1)", matcher.getNode("a").toString());
assertEquals("(bar 2)", matcher.getNode("b").toString());
assertTrue(matcher.find());
assertEquals("(foo 1)", matcher.getMatch().toString());
assertEquals("(foo 1)", matcher.getNode("a").toString());
assertEquals("(bar 3)", matcher.getNode("b").toString());
assertFalse(matcher.find());
}
public void testLink() {
// matched node will be (bar 3), the next bar matches (bar 2), and
// the foo at the end obviously matches the (foo 1)
runTest("bar $- (bar $- foo)", "(a (foo 1) (bar 2) (bar 3))", "(bar 3)");
// same thing, but this tests the link functionality, as the
// second match should also be (bar 2)
runTest("bar=a $- (~a $- foo)", "(a (foo 1) (bar 2) (bar 3))", "(bar 3)");
// won't work, since (bar 3) doesn't satisfy the next-to-foo
// relation, and (bar 2) isn't the same node as (bar 3)
runTest("bar=a $- (=a $- foo)", "(a (foo 1) (bar 2) (bar 3))");
// links can be saved as named nodes as well, so this should work
runTest("bar=a $- (~a=b $- foo)", "(a (foo 1) (bar 2) (bar 3))", "(bar 3)");
// run a few of the same tests, but this time dissect the results
// to make sure the captured nodes are the correct nodes
Tree tree = treeFromString("(a (foo 1) (bar 2) (bar 3))");
TregexPattern pattern = TregexPattern.compile("bar=a $- (~a $- foo)");
TregexMatcher matcher = pattern.matcher(tree);
assertTrue(matcher.find());
assertEquals("(bar 3)", matcher.getMatch().toString());
assertEquals("(bar 3)", matcher.getNode("a").toString());
assertFalse(matcher.find());
tree = treeFromString("(a (foo 1) (bar 2) (bar 3))");
pattern = TregexPattern.compile("bar=a $- (~a=b $- foo)");
matcher = pattern.matcher(tree);
assertTrue(matcher.find());
assertEquals("(bar 3)", matcher.getMatch().toString());
assertEquals("(bar 3)", matcher.getNode("a").toString());
assertEquals("(bar 2)", matcher.getNode("b").toString());
assertFalse(matcher.find());
tree = treeFromString("(a (foo 1) (bar 2) (bar 3))");
pattern = TregexPattern.compile("bar=a $- (~a=b $- foo=c)");
matcher = pattern.matcher(tree);
assertTrue(matcher.find());
assertEquals("(bar 3)", matcher.getMatch().toString());
assertEquals("(bar 3)", matcher.getNode("a").toString());
assertEquals("(bar 2)", matcher.getNode("b").toString());
assertEquals("(foo 1)", matcher.getNode("c").toString());
assertFalse(matcher.find());
}
/** Test another variant of using links, this time with pattern partitions */
public void testBackref() {
TregexPattern tregex = TregexPattern.compile("__ <1 B=n <2 ~n");
Tree tree = treeFromString("(A (B w) (B x))");
TregexMatcher matcher = tregex.matcher(tree);
assertTrue(matcher.find());
Tree match = matcher.getMatch();
assertEquals("(A (B w) (B x))", match.toString());
Tree node = matcher.getNode("n");
assertEquals("(B w)", node.toString());
assertFalse(matcher.find());
tregex = TregexPattern.compile("__ < B=n <2 B=m : (=n !== =m)");
tree = treeFromString("(A (B w) (B x))");
matcher = tregex.matcher(tree);
assertTrue(matcher.find());
match = matcher.getMatch();
assertEquals("(A (B w) (B x))", match.toString());
node = matcher.getNode("n");
assertEquals("(B w)", node.toString());
assertFalse(matcher.find());
}
public void testNonsense() {
// can't name a variable twice
try {
TregexPattern pattern = TregexPattern.compile("foo=a $ bar=a");
throw new RuntimeException("Expected a parse exception");
} catch (TregexParseException e) {
// yay, passed
}
// another way of doing the same thing
try {
TregexPattern pattern = TregexPattern.compile("foo=a > bar=b $ ~a=b");
throw new RuntimeException("Expected a parse exception");
} catch (TregexParseException e) {