Towards a Logical Description of Trees in Annotation Graphs - JLCL
Towards a Logical Description of Trees in Annotation Graphs - JLCL
Towards a Logical Description of Trees in Annotation Graphs - JLCL
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Michaelis, Mönnich<br />
explore A p,q<br />
1 if A p,q ≠ ∅ then<br />
2 choose a ∈ A p,q<br />
3 A r ← A r ∪ {a} % add a to partition set A r<br />
4 A p,q ← A p,q \ {a} % remove a from set A p,q<br />
4.1 χ p,q ← χ p,q · k p,q % def<strong>in</strong>e (essential part <strong>of</strong>) new<br />
node address for T r<br />
4.2 T r ← T r ∪ {〈〈χ p,q, r〉, label(a)〉} % add to T r a correspond<strong>in</strong>g new<br />
node labeled by label(a) 11<br />
4.3 real root p,q ← true % no dummy node, cf. l<strong>in</strong>e 4.10, 11.1<br />
4.4 k ← 0 % potential next daughter to f<strong>in</strong>d<br />
is leftmost child<br />
4.5 if p + 1 = q then<br />
4.6 T r ← T r ∪ {〈〈χ p,q · k, r〉, 〈p, p + 1〉〉} % yield <strong>of</strong> T r comprises (arc cover<strong>in</strong>g)<br />
<strong>in</strong>terval [p,p+1]<br />
4.7 fi<br />
4.8 else<br />
4.9 if p = 0 and q = K − 1then<br />
4.10 T r ← T r ∪ {〈〈ɛ, r〉, dummy-label r 〉} % dummy root cover<strong>in</strong>g potential nontime-cross<strong>in</strong>g,<br />
non-<strong>in</strong>clusive arcs<br />
(cf. T 0 and T 1 from Example 3.9)<br />
4.11 k ← 0<br />
4.12 else<br />
4.13 k ← k p,q<br />
4.14 fi<br />
5 fi<br />
6 i ← 0<br />
7 j ← 1<br />
11 For each arc a = 〈p, q, l〉 ∈ A for some p, q ∈ N and l ∈ L, we take label(a) to denote its label l.<br />
80 LDV-FORUM
Change language