CCGWeb - Est-ce propre ?

Est

NP\NP

< ⁰

NP\NP

< ⁰

NP/(NP\NP)

T ^>

propre

S[b]\NP

S[b]/(NP\NP)

< ¹_×

NP\NP

S[b]

> ⁰

 <div class="der">
<table class="constituent binaryrule" data-cat="S[b]">
<tr class="daughters">
<td class="daughter daughter-left"><table class="constituent binaryrule" data-cat="S[b]/(NP\NP)">
<tr class="daughters">
<td class="daughter daughter-left"><table class="constituent unaryrule" data-cat="NP/(NP\NP)">
<tr class="daughters"><td class="daughter daughter-only"><table class="constituent binaryrule" data-cat="NP">
<tr class="daughters">
<td class="daughter daughter-left"><table class="constituent binaryrule" data-cat="NP">
<tr class="daughters">
<td class="daughter daughter-left"><table class="constituent unaryrule" data-cat="NP">
<tr class="daughters"><td class="daughter daughter-only"><table class="constituent lex" data-token="Est" data-from="0" data-to="3" data-cat="N">
<tr><td class="token">Est</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</div>
<div class="rule" title="Type Changing">
									*
								</div>
</div></td></tr>
</table></td>
<td class="daughter daughter-right"><table class="constituent lex" data-token="-" data-from="3" data-to="4" data-cat="NP\NP">
<tr><td class="token">-</td></tr>
<tr><td class="cat" tabindex="0">NP\NP</td></tr>
<tr><td class="span-swiper"> </td></tr>
</table></td>
</tr>
<tr><td colspan="2" class="rulecat"><div class="rulecat">
<div class="cat">NP</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="ce" data-from="4" data-to="6" data-cat="NP\NP">
<tr><td class="token">ce</td></tr>
<tr><td class="cat" tabindex="0">NP\NP</td></tr>
<tr><td class="span-swiper"> </td></tr>
</table></td>
</tr>
<tr><td colspan="2" class="rulecat"><div class="rulecat">
<div class="cat">NP</div>
<div class="rule" title="Backward Application">&lt; <sup>0</sup>
</div>
</div></td></tr>
</table></td></tr>
<tr><td class="rulecat"><div class="rulecat">
<div class="cat">NP/(NP\NP)</div>
<div class="rule" title="Forward Type Raising">
									T <sup>&gt;</sup>
</div>
</div></td></tr>
</table></td>
<td class="daughter daughter-right"><table class="constituent lex" data-token="propre" data-from="7" data-to="13" data-cat="S[b]\NP">
<tr><td class="token">propre</td></tr>
<tr><td class="cat" tabindex="0">S[b]\NP</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[b]/(NP\NP)</div>
<div class="rule" title="Backward Crossed Composition">&lt; <sup>1</sup><sub>×</sub>
</div>
</div></td></tr>
</table></td>
<td class="daughter daughter-right"><table class="constituent lex" data-token="?" data-from="14" data-to="15" data-cat="NP\NP">
<tr><td class="token">?</td></tr>
<tr><td class="cat" tabindex="0">NP\NP</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[b]</div>
<div class="rule" title="Forward Application">&gt; <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*{idm37}{Est}{\catN}{} \&
		\lexnode*{idm45}{-}{\catNP\?\catNP}{} \&
		\lexnode*{idm55}{ce}{\catNP\?\catNP}{} \&
		\lexnode*{idm65}{propre}{\catS[b]\?\catNP}{} \&
		\lexnode*{idm75}{?}{\catNP\?\catNP}{} \\
	};
	\unnode*{idm34}{idm37-cat}{*}{\catNP}{}
	\binnode*{idm29}{idm34}{idm45-cat}{\BC{0}}{\catNP}{}
	\binnode*{idm24}{idm29}{idm55-cat}{\BC{0}}{\catNP}{}
	\unnode*{idm17}{idm24}{\FTR}{\catNP/(\catNP\?\catNP)}{}
	\binnode*{idm8}{idm17}{idm65-cat}{\BXC{1}}{\catS[b]/(\catNP\?\catNP)}{}
	\binnode*{idm3}{idm8}{idm75-cat}{\FC{0}}{\catS[b]}{}
\end{tikzpicture}

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

Sentence

Parse

Translations