Dirk Roorda

example ``` word lex=L

Then there is more than one first subphrase after the word, however you define it. In the canonical ordering, s1 and s2 precede s3 and s4. Maybe the best proposal...

Back to `

But `` are not each others converse. If a certain subphrase is the first one after a certain word, then that word does not have to be the first word...

So it makes sense to also have `~~` meaning both: word ~~ subphrase matches (w, s) such that s is the first subphrase after w and w is the first...

Still there is a subtlety that keeps puzzling me word lex=L

On my bike ride I also felt that B is better. B is more a spatial relationship, whereas A needs arbitrary conditions on the nodes in terms of features. Moreover,...

I have been thinking what is needed for computing these relations efficiently, both for L.a L.b and in queries. You need to pre-compute for each slot the list of nodes...

Maybe we can chunk this task in smaller bits and ask people to work on it. For example, the precompute step is a nice task for a medium-experienced python programmer....

These relations are innovative. All earlier relations can be defined in terms of nodes and the slots they are linked to. The new ones need something more: the concept that...