File tree Expand file tree Collapse file tree 1 file changed +3
-0
lines changed
src/edu/stanford/nlp/semgraph/semgrex Expand file tree Collapse file tree 1 file changed +3
-0
lines changed Original file line number Diff line number Diff line change 69
69
* <tr><td>{@code A x,y>>reln B} <td>A is the governor of a relation reln in a chain to B following {@code gov->dep} paths between distances of x and y
70
70
* <tr><td>A == B <td>A and B are the same nodes in the same graph
71
71
* <tr><td>A . B <td>A immediately precedes B, i.e. A.index() == B.index() - 1
72
+ * <tr><td>A - B <td>A immediately succeeds B, i.e. A.index() == B.index() + 1
73
+ * <tr><td>A .. B <td>A precedes B, i.e. {@code A.index() < B.index()}
74
+ * <tr><td>A -- B <td>A succeeds B, i.e. {@code A.index() > B.index()}
72
75
* <tr><td>A $+ B <td>B is a right immediate sibling of A, i.e. A and B have the same parent and A.index() == B.index() - 1
73
76
* <tr><td>A $- B <td>B is a left immediate sibling of A, i.e. A and B have the same parent and A.index() == B.index() + 1
74
77
* <tr><td>A $++ B <td>B is a right sibling of A, i.e. A and B have the same parent and {@code A.index() < B.index()}
You can’t perform that action at this time.
0 commit comments