↑ Click to hide

Tree Drawing Program

This program is a webpage written in HTML and JavaScript.

Note: JavaScript must be enabled in your browser.

You can use this program online or save the webpage to your computer and use offline.

Save to your computer. Open in browser and use.

For bugs, please contact me: ginsburg.jasonrobert.2h@kyoto-u.ac.jp

See TreeDraw for Sandiway Fong's better tree drawing program.

[A [B] [C]]	[A [B] [C] [D] [E]]	[DP ^the\|large\|book]

Terminal node with multiple lines [NP [N 本 hon 'book']]	Subscript: X_1 [A [B] [C X_1]]	Strikethrough: $X [A [B] [C $Argument]]
	<="" td="">	<="" td="">

The ugly old man from Brazil found books of poems in the puddle. (Carnie 2013: 198)

[TP [DP_1 [D' [D the] [NP [N' [AdjP [Adj' [Adj ugly]]] [N' [AdjP [Adj' [Adj old] ]][N' [N' [N man]] [PP [P' [P from] [DP [D'[D] [NP [N' [N Brazil]] ]] ]]]]] ]] ] ][T' [T Past] [vP [t_1] [v' [v] [VP [V'[V' [V found] [DP [D' [D the] [NP [N' [N book] [PP [P' [P of] [DP [D' [D ] [NP [N' [N poems] ] ] ]] ]]]] ]] ] [PP [P' [P in] [DP [D' [D the] [NP [N' [N puddle]]]]]]]]]]]]]

To save trees: Drag image from browser or click on image and save.

Show Tree Frontier

[TP [DP_1 [D' [D the] [NP [N' [AdjP [Adj' [Adj ugly]]] [N' [AdjP [Adj' [Adj old] ]][N' [N' [N man]] [PP [P' [P from] [DP [D'[D] [NP [N' [N Brazil]] ]] ]]]]] ]] ] ][T' [T Past] [vP [t_1] [v' [v] [VP [V'[V' [V found] [DP [D' [D the] [NP [N' [N book] [PP [P' [P of] [DP [D' [D ] [NP [N' [N poems] ] ] ]] ]]]] ]] ] [PP [P' [P in] [DP [D' [D the] [NP [N' [N puddle]]]]]]]]]]]]]

<="" td="">

[/LAnglA/CMB/RAngl [X ^this|is|a|triangle] [Y ^this|is|also|a|triangle] ]

<="" td="">

(Example) Stop subscript: C_Q//+Pres+have
(Example) Stop strikethrough: $have//+-en
[C [C_Q//+Pres+have] [T [N_1 [N_1] [Mary] ] [T [T $Pres+have] [v_Perf [v_Perf $have//+-en] [v* [t_1] [v* [v*] [buy [buy] [D [D the] [N [N] [book]]]]]]]]]]

Form Set notation: [_FormSet ] [_FormSet [X [A] [B ]] [Y [C ] [D ] ] [Z [E] [F] ]]

Set Merge (Unlabeled): {A, B}	Set Merge (Labeled): {A A, B}	Pair Merge (First element is adjunct - adjunct appears to the left): {A <D, B>, C}	Pair Merge (Use <2 to make adjunct appear to the right - first element is adjunct): {A <2 D, B>, C}

Multiple Adjuncts {A <P,<K,B C> C>, <F,<{E,G},<M,<2 U,<{D,O},C>>>>>}	Use \|\| for multiple lines: {N N, 本\|\|hon\|\|'book'}

Complex example:
{C C, {Phi3 {d d, {n n, they}}, {Tpast Tpast, {vUnerg {d d, {n n, they}}, {vUnerg vUnerg, {wonder wonder, {Q {Q Q, {in in, {which which, < {adj adj, Texas}, {n n, city}>}}}, {C_whEm C_whEm, {Phi1 {d d, {n n, JFK}}, {be+Tpast be+Tpast, {be {d d, {n n, JFK}}, {be be, {Prt {d d, {n n, JFK}}, {Prt Prt, <2{Q Q, {in in, {which which, < {adj adj, Texas}, {n n, city}>}}}, {assassinate assassinate, {d d, {n n, JFK}}}>}}}}}}}}}}}}}}

This program can convert bracket-notation in an HTML file into trees.

Read in an HTML file.

If there are no errors, the output will be displayed below.
Example HTML Input

Example Output

Input:

Merge:	set-Merge
Stream:	['the', 'use', 'v', ['n_3rd_msc_sg', 'Bill'], 'T_ing', 'prefer', 'v', ['n_3rd_msc_sg', 'John'], 'Tpast', 'C']
Unlabeled:

Merge:	pair-Merge
Stream:	['use', 'v', ['n_3rd_msc_sg', 'Bill'], 'T_ing', 'prefer', 'v', ['n_3rd_msc_sg', 'John'], 'Tpast', 'C']
Label stays the same:

Merge:	set-Merge
Stream:	['v', ['n_3rd_msc_sg', 'Bill'], 'T_ing', 'prefer', 'v', ['n_3rd_msc_sg', 'John'], 'Tpast', 'C']
Unlabeled:

Merge:	set-Merge
Stream:	[['n_3rd_msc_sg', 'Bill'], 'T_ing', 'prefer', 'v*', ['n_3rd_msc_sg', 'John'], 'Tpast', 'C']
Operations:	Agree: (v*,n) Checked Features: 'uPerson' 'uNumber' 'uGender'
Unlabeled:
Label from Head:
Label from Head:
Label from Head:

Merge:	set-Merge
Stream:	[]
Unlabeled:

Tree Drawing Program

ABOUT

EXAMPLES (Basic)

EXAMPLES (Advanced)

SET NOTATION

ADD TREES TO HTML FILE

Spell Out:	C n John T(Past,3rd,sg) v* prefer n Bill -ing v* use the n supercomputer
PF Rules:	John T(Past,3rd,sg)+prefer John preferred Bill/Bill's T_ing+use John preferred Bill/Bill's using the supercomputer

# of Backtracks:	7
# of Crashes:	7
# of Successful Derivations:	1