• No results found

T+v_n+\node{V}V_j+Apl_k ].T [ \node{io}{ }IO_l [ \node{subj2}t_i [ \node{v1}t_n [ \node{do}DO_m [ \node{io1}t_l [ \node{apl1}t_k

N/A
N/A
Protected

Academic year: 2021

Share "T+v_n+\node{V}V_j+Apl_k ].T [ \node{io}{ }IO_l [ \node{subj2}t_i [ \node{v1}t_n [ \node{do}DO_m [ \node{io1}t_l [ \node{apl1}t_k"

Copied!
1
0
0

Bezig met laden.... (Bekijk nu de volledige tekst)

Hele tekst

(1)

Examples: Drawing arrows on qtree trees

The arrow-drawing capabilities of the package tree-dvips (written by Emma Pease) can be used with trees drawn with qtree. The two packages are fully compatible.

Note, however, that tree-dvips relies on PostScript specials, and thus does not work with pdfLATEX. This file was generated as DVI and then converted to pdf.

Tree-dvips is not included in the distribution of qtree; it is available on CTAN.

Thanks to Seth Kulick for telling me about the combination, and to Amanda Seidl for con- tributing the verb-movement example.

TP

NP subji

T

T T+vn+Vj+Aplk

vP

IOl v

ti v

tn AplP

DOm Apl tl Apl

tk VP V tj

tm

\Tree

[ [ \node{subj1}subj_i ].NP

[ [ T+v_n+\node{V}V_j+Apl_k ].T [ \node{io}{ }IO_l

[ \node{subj2}t_i [ \node{v1}t_n [ \node{do}DO_m [ \node{io1}t_l

[ \node{apl1}t_k [ [ \node{V1}t_j ].V

\node{do1}t_m ].VP ].Apl\1 ].Apl\1 ].AplP ].{\it v}\1 ].{\it v}\1 ].{\it v}P ].T\1 ].TP

\anodecurve[bl]{subj2}[bl]{subj1}{0.4in}

\anodecurve[bl]{do1}[bl]{do}{0.4in}

{\makedash{4pt}\anodecurve[t]{io1}[r]{io}{.5in}}

\anodecurve[bl]{V1}[bl]{apl1}{0.6in}

\anodecurve[bl]{apl1}[bl]{v1}{1in}

\anodecurve[bl]{v1}[bl]{V}{0.9in}

S NP subji

VP V verb

NP ti

\Tree [.S [.NP \node{subj}{subj i} ]

[.VP [.V verb ] [.NP \node{t}{t i} ]]]

\abarnodeconnect[-6pt]{t}{subj}

1

Referenties

GERELATEERDE DOCUMENTEN

Variables included in the regression model were: axillary procedure (SNB vs ALND); cancer stage (stage 2 vs stage 1); time since axillary surgery ( .2 years ago vs 2 years ago);

A way of looking for an association between plasma cholesterol levels and restriction fragment length polymorphism markers (RFLP) on the low-density lipoprotein (LDL) receptor gene

We will start with the arithmetic of polynomials over a finite field, irreducible poly- nomials (primes), zeta functions and the Riemann Hypothesis (Hasse-Weil Theorem), then skip

In devolgende twee paragrafen wordt voor beide verstellinqen een keuze qemaakt voor de methode waarop de verstellinq dient te

Greedy Distributed Node Selection for Node-Specific Signal Estimation in Wireless Sensor NetworksJ. of Information Technology (INTEC), Gaston Crommenlaan 8 Bus 201, 9050

In Section 5 the utility is described in a distributed scenario where the DANSE algorithm is in place and it is shown how it can be used in the greedy node selection as an upper

Moonen, “Distributed adaptive node-specific signal estimation in fully connected sensor networks—Part I: Sequential node updating,” IEEE Trans.. Signal

In Section 5 the utility is described in a distributed scenario where the DANSE algorithm is in place and it is shown how it can be used in the greedy node selection as an upper