CCGweb
About
Manual
Download
Privacy Policy
Sign in
Sentence
ara
bul
dan
eng
est
deu
fra
hin
ind
ita
kan
ltz
mar
nld
pol
por
ron
rus
spa
srp
tur
urd
vie
Go
Previous
Next
Parse
auto
visual
HTML
LaTeX
Mit
(S[dcl]/S[dcl])/NP
purer
N/N
Logik
N
N
>
0
NP
*
S[dcl]/S[dcl]
>
0
kann
(S[dcl]/NP)/(S[b]\NP)
man
NP
S[dcl]\(S[dcl]/NP)
T
<
S[dcl]/(S[b]\NP)
<
1
×
den
NP/N
allergrößten
N/N
Schwachsinn
N
N
>
0
NP
>
0
beweisen
(S[b]\NP)\NP
S[b]\NP
<
0
S[dcl]
>
0
.
S[dcl]\S[dcl]
S[dcl]
<
0
S[dcl]
>
0
<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]/S[dcl]"> <tr class="daughters"> <td class="daughter daughter-left"><table class="constituent lex" data-token="Mit" data-from="0" data-to="3" data-cat="(S[dcl]/S[dcl])/NP"> <tr><td class="token">Mit</td></tr> <tr><td class="cat" tabindex="0">(S[dcl]/S[dcl])/NP</td></tr> <tr><td class="span-swiper"> </td></tr> </table></td> <td class="daughter daughter-right"><table class="constituent unaryrule" data-cat="NP"> <tr class="daughters"><td class="daughter daughter-only"><table class="constituent binaryrule" data-cat="N"> <tr class="daughters"> <td class="daughter daughter-left"><table class="constituent lex" data-token="purer" data-from="4" data-to="9" data-cat="N/N"> <tr><td class="token">purer</td></tr> <tr><td class="cat" tabindex="0">N/N</td></tr> <tr><td class="span-swiper"> </td></tr> </table></td> <td class="daughter daughter-right"><table class="constituent lex" data-token="Logik" data-from="10" data-to="15" data-cat="N"> <tr><td class="token">Logik</td></tr> <tr><td class="cat" tabindex="0">N</td></tr> <tr><td class="span-swiper"> </td></tr> </table></td> </tr> <tr><td colspan="2" class="rulecat"><div class="rulecat"> <div class="cat">N</div> <div class="rule" title="Forward Application">> <sup>0</sup> </div> </div></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> </tr> <tr><td colspan="2" class="rulecat"><div class="rulecat"> <div class="cat">S[dcl]/S[dcl]</div> <div class="rule" title="Forward Application">> <sup>0</sup> </div> </div></td></tr> </table></td> <td class="daughter daughter-right"><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 binaryrule" data-cat="S[dcl]/(S[b]\NP)"> <tr class="daughters"> <td class="daughter daughter-left"><table class="constituent lex" data-token="kann" data-from="16" data-to="20" data-cat="(S[dcl]/NP)/(S[b]\NP)"> <tr><td class="token">kann</td></tr> <tr><td class="cat" tabindex="0">(S[dcl]/NP)/(S[b]\NP)</td></tr> <tr><td class="span-swiper"> </td></tr> </table></td> <td class="daughter daughter-right"><table class="constituent unaryrule" data-cat="S[dcl]\(S[dcl]/NP)"> <tr class="daughters"><td class="daughter daughter-only"><table class="constituent lex" data-token="man" data-from="21" data-to="24" data-cat="NP"> <tr><td class="token">man</td></tr> <tr><td class="cat" tabindex="0">NP</td></tr> <tr><td class="span-swiper"> </td></tr> </table></td></tr> <tr><td class="rulecat"><div class="rulecat"> <div class="cat">S[dcl]\(S[dcl]/NP)</div> <div class="rule" title="Backward Type Raising"> T <sup><</sup> </div> </div></td></tr> </table></td> </tr> <tr><td colspan="2" class="rulecat"><div class="rulecat"> <div class="cat">S[dcl]/(S[b]\NP)</div> <div class="rule" title="Backward Crossed Composition">< <sup>1</sup><sub>×</sub> </div> </div></td></tr> </table></td> <td class="daughter daughter-right"><table class="constituent binaryrule" data-cat="S[b]\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 lex" data-token="den" data-from="25" data-to="28" data-cat="NP/N"> <tr><td class="token">den</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="N"> <tr class="daughters"> <td class="daughter daughter-left"><table class="constituent lex" data-token="allergrößten" data-from="29" data-to="41" data-cat="N/N"> <tr><td class="token">allergrößten</td></tr> <tr><td class="cat" tabindex="0">N/N</td></tr> <tr><td class="span-swiper"> </td></tr> </table></td> <td class="daughter daughter-right"><table class="constituent lex" data-token="Schwachsinn" data-from="42" data-to="53" data-cat="N"> <tr><td class="token">Schwachsinn</td></tr> <tr><td class="cat" tabindex="0">N</td></tr> <tr><td class="span-swiper"> </td></tr> </table></td> </tr> <tr><td colspan="2" class="rulecat"><div class="rulecat"> <div class="cat">N</div> <div class="rule" title="Forward Application">> <sup>0</sup> </div> </div></td></tr> </table></td> </tr> <tr><td colspan="2" class="rulecat"><div class="rulecat"> <div class="cat">NP</div> <div class="rule" title="Forward Application">> <sup>0</sup> </div> </div></td></tr> </table></td> <td class="daughter daughter-right"><table class="constituent lex" data-token="beweisen" data-from="54" data-to="62" data-cat="(S[b]\NP)\NP"> <tr><td class="token">beweisen</td></tr> <tr><td class="cat" tabindex="0">(S[b]\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]\NP</div> <div class="rule" title="Backward Application">< <sup>0</sup> </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="Forward Application">> <sup>0</sup> </div> </div></td></tr> </table></td> <td class="daughter daughter-right"><table class="constituent lex" data-token="." data-from="62" data-to="63" 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">< <sup>0</sup> </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="Forward Application">> <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*{idm15}{Mit}{(\catS[dcl]/\catS[dcl])/\catNP}{} \& \lexnode*{idm35}{purer}{\catN/\catN}{} \& \lexnode*{idm45}{Logik}{\catN}{} \& \lexnode*{idm72}{kann}{(\catS[dcl]/\catNP)/(\catS[b]\?\catNP)}{} \& \lexnode*{idm93}{man}{\catNP}{} \& \lexnode*{idm113}{den}{\catNP/\catN}{} \& \lexnode*{idm128}{allergrößten}{\catN/\catN}{} \& \lexnode*{idm138}{Schwachsinn}{\catN}{} \& \lexnode*{idm146}{beweisen}{(\catS[b]\?\catNP)\?\catNP}{} \& \lexnode*{idm158}{.}{\catS[dcl]\?\catS[dcl]}{} \\ }; \binnode*{idm30}{idm35-cat}{idm45-cat}{\FC{0}}{\catN}{} \unnode*{idm27}{idm30}{*}{\catNP}{} \binnode*{idm8}{idm15-cat}{idm27}{\FC{0}}{\catS[dcl]/\catS[dcl]}{} \unnode*{idm86}{idm93-cat}{*}{\catS[dcl]\?(\catS[dcl]/\catNP)}{} \binnode*{idm63}{idm72-cat}{idm86}{\BXC{1}}{\catS[dcl]/(\catS[b]\?\catNP)}{} \binnode*{idm123}{idm128-cat}{idm138-cat}{\FC{0}}{\catN}{} \binnode*{idm108}{idm113-cat}{idm123}{\FC{0}}{\catNP}{} \binnode*{idm101}{idm108}{idm146-cat}{\BC{0}}{\catS[b]\?\catNP}{} \binnode*{idm58}{idm63}{idm101}{\FC{0}}{\catS[dcl]}{} \binnode*{idm53}{idm58}{idm158-cat}{\BC{0}}{\catS[dcl]}{} \binnode*{idm3}{idm8}{idm53}{\FC{0}}{\catS[dcl]}{} \end{tikzpicture}
Use with
ccgsym.sty
and
tikzlibraryccgder.code.tex
.
Translations
eng
With pure logic you can prove the biggest nonsense.