Skip to content

Commit ec517e1

Browse files
committed
Add documentation for before / after operations
1 parent 9140384 commit ec517e1

File tree

1 file changed

+3
-0
lines changed

1 file changed

+3
-0
lines changed

src/edu/stanford/nlp/semgraph/semgrex/SemgrexPattern.java

Lines changed: 3 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -69,6 +69,9 @@
6969
* <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
7070
* <tr><td>A == B <td>A and B are the same nodes in the same graph
7171
* <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()}
7275
* <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
7376
* <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
7477
* <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()}

0 commit comments

Comments
 (0)