CCGWeb - Todos quieren a Tom.

Todos

NP/N

quieren

S[dcl]/PP

PP/NP

Tom

NP\(NP/N)

T ^<

PP\(NP/N)

> ¹_×

S[dcl]\(NP/N)

> ¹_×

S[dcl]

< ⁰

S[dcl]\S[dcl]

S[dcl]

< ⁰

 <div class="der">
<table class="constituent binaryrule" data-cat="S[dcl]">
<tr class="daughters">
<td class="daughter daughter-left"><table class="constituent binaryrule" data-cat="S[dcl]">
<tr class="daughters">
<td class="daughter daughter-left"><table class="constituent lex" data-token="Todos" data-from="0" data-to="5" data-cat="NP/N">
<tr><td class="token">Todos</td></tr>
<tr><td class="cat" tabindex="0">NP/N</td></tr>
<tr><td class="span-swiper"> </td></tr>
</table></td>
<td class="daughter daughter-right"><table class="constituent binaryrule" data-cat="S[dcl]\(NP/N)">
<tr class="daughters">
<td class="daughter daughter-left"><table class="constituent lex" data-token="quieren" data-from="6" data-to="13" data-cat="S[dcl]/PP">
<tr><td class="token">quieren</td></tr>
<tr><td class="cat" tabindex="0">S[dcl]/PP</td></tr>
<tr><td class="span-swiper"> </td></tr>
</table></td>
<td class="daughter daughter-right"><table class="constituent binaryrule" data-cat="PP\(NP/N)">
<tr class="daughters">
<td class="daughter daughter-left"><table class="constituent lex" data-token="a" data-from="14" data-to="15" data-cat="PP/NP">
<tr><td class="token">a</td></tr>
<tr><td class="cat" tabindex="0">PP/NP</td></tr>
<tr><td class="span-swiper"> </td></tr>
</table></td>
<td class="daughter daughter-right"><table class="constituent unaryrule" data-cat="NP\(NP/N)">
<tr class="daughters"><td class="daughter daughter-only"><table class="constituent lex" data-token="Tom" data-from="16" data-to="19" data-cat="N">
<tr><td class="token">Tom</td></tr>
<tr><td class="cat" tabindex="0">N</td></tr>
<tr><td class="span-swiper"> </td></tr>
</table></td></tr>
<tr><td class="rulecat"><div class="rulecat">
<div class="cat">NP\(NP/N)</div>
<div class="rule" title="Backward Type Raising">
									T <sup>&lt;</sup>
</div>
</div></td></tr>
</table></td>
</tr>
<tr><td colspan="2" class="rulecat"><div class="rulecat">
<div class="cat">PP\(NP/N)</div>
<div class="rule" title="Forward Crossed Composition">&gt; <sup>1</sup><sub>×</sub>
</div>
</div></td></tr>
</table></td>
</tr>
<tr><td colspan="2" class="rulecat"><div class="rulecat">
<div class="cat">S[dcl]\(NP/N)</div>
<div class="rule" title="Forward Crossed Composition">&gt; <sup>1</sup><sub>×</sub>
</div>
</div></td></tr>
</table></td>
</tr>
<tr><td colspan="2" class="rulecat"><div class="rulecat">
<div class="cat">S[dcl]</div>
<div class="rule" title="Backward Application">&lt; <sup>0</sup>
</div>
</div></td></tr>
</table></td>
<td class="daughter daughter-right"><table class="constituent lex" data-token="." data-from="19" data-to="20" data-cat="S[dcl]\S[dcl]">
<tr><td class="token">.</td></tr>
<tr><td class="cat" tabindex="0">S[dcl]\S[dcl]</td></tr>
<tr><td class="span-swiper"> </td></tr>
</table></td>
</tr>
<tr><td colspan="2" class="rulecat"><div class="rulecat">
<div class="cat">S[dcl]</div>
<div class="rule" title="Backward Application">&lt; <sup>0</sup>
</div>
</div></td></tr>
</table> </div>

Use with der.css.

\begin{tikzpicture}[ampersand replacement=\&]
	\matrix [column sep=9pt] at (0, 0) {
		\lexnode*{idm13}{Todos}{\catNP/\catN}{} \&
		\lexnode*{idm32}{quieren}{\catS[dcl]/\catPP}{} \&
		\lexnode*{idm51}{a}{\catPP/\catNP}{} \&
		\lexnode*{idm68}{Tom}{\catN}{} \&
		\lexnode*{idm76}{.}{\catS[dcl]\?\catS[dcl]}{} \\
	};
	\unnode*{idm61}{idm68-cat}{*}{\catNP\?(\catNP/\catN)}{}
	\binnode*{idm42}{idm51-cat}{idm61}{\FXC{1}}{\catPP\?(\catNP/\catN)}{}
	\binnode*{idm23}{idm32-cat}{idm42}{\FXC{1}}{\catS[dcl]\?(\catNP/\catN)}{}
	\binnode*{idm8}{idm13-cat}{idm23}{\BC{0}}{\catS[dcl]}{}
	\binnode*{idm3}{idm8}{idm76-cat}{\BC{0}}{\catS[dcl]}{}
\end{tikzpicture}

Use with ccgsym.sty and tikzlibraryccgder.code.tex.

Sentence

Parse

Translations