http://glottopedia.org/index.php?action=history&feed=atom&title=Binary_Branching_Constraint 2026-04-22T16:24:18Z Revision history for this page on the wiki MediaWiki 1.34.2 http://glottopedia.org/index.php?title=Binary_Branching_Constraint&diff=5548&oldid=prev 2008-03-13T04:06:20Z

<p></p> <table class="diff diff-contentalign-left" data-mw="interface"> <col class="diff-marker" /> <col class="diff-content" /> <col class="diff-marker" /> <col class="diff-content" /> <tr class="diff-title" lang="en"> <td colspan="2" style="background-color: #fff; color: #222; text-align: center;">← Older revision</td> <td colspan="2" style="background-color: #fff; color: #222; text-align: center;">Revision as of 04:06, 13 March 2008</td> </tr><tr><td colspan="2" class="diff-lineno" id="mw-diff-left-l1" >Line 1:</td> <td colspan="2" class="diff-lineno">Line 1:</td></tr> <tr><td class='diff-marker'>−</td><td style="color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div>In <del class="diffchange diffchange-inline">the </del>morphology, a '''<del class="diffchange diffchange-inline">binary </del>Branching Constraint''' is a constraint on concatenative [[word formation]] which says that in the process of [[word formation]] only two morphemes can be concatenated at the same time.  </div></td><td class='diff-marker'>+</td><td style="color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div>In morphology, a '''<ins class="diffchange diffchange-inline">Binary </ins>Branching Constraint''' is a constraint on concatenative [[word formation]] which says that in the process of [[word formation]] only two morphemes can be concatenated at the same time.  </div></td></tr> <tr><td class='diff-marker'> </td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"></td><td class='diff-marker'> </td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"></td></tr> <tr><td class='diff-marker'>−</td><td style="color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div>In <del class="diffchange diffchange-inline">the </del>syntax, <del class="diffchange diffchange-inline">a </del>a '''<del class="diffchange diffchange-inline">binary </del>Branching Constraint''' is a constraint proposed in Kayne (1984) which rules out syntactic structures in which a phrase contains more than two immediate constituents (i.e. no node in a tree structure may have more than two branches).</div></td><td class='diff-marker'>+</td><td style="color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div>In syntax, a '''<ins class="diffchange diffchange-inline">Binary </ins>Branching Constraint''' is a constraint proposed in Kayne (1984) which rules out syntactic structures in which a phrase contains more than two immediate constituents (i.e. no node in a tree structure may have more than two branches).</div></td></tr> <tr><td class='diff-marker'> </td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"></td><td class='diff-marker'> </td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"></td></tr> <tr><td class='diff-marker'> </td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>===Comment===</div></td><td class='diff-marker'> </td><td style="background-color: #f8f9fa; color: #222; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>===Comment===</div></td></tr> </table>

Luo http://glottopedia.org/index.php?title=Binary_Branching_Constraint&diff=5540&oldid=prev 2008-03-10T14:51:15Z

<p>from Utrecht Lexicon of Linguistics</p> <p><b>New page</b></p><div>In the morphology, a '''binary Branching Constraint''' is a constraint on concatenative [[word formation]] which says that in the process of [[word formation]] only two morphemes can be concatenated at the same time. <br /> <br /> In the syntax, a a '''binary Branching Constraint''' is a constraint proposed in Kayne (1984) which rules out syntactic structures in which a phrase contains more than two immediate constituents (i.e. no node in a tree structure may have more than two branches).<br /> <br /> ===Comment===<br /> In the first area, the compound ''a,i,c'' either has the structure [[[a] [b]] [c]], or the structure [[a] [[b] [c]]], but not the ternary structure [[a] [b] [c]]. [[Circumfix]]es are problematic with respect to this constraint.<br /> <br /> ===Link===<br /> [http://www2.let.uu.nl/UiL-OTS/Lexicon/zoek.pl?lemma=Binary+Branching+Constraint&amp;lemmacode=826 Utrecht Lexicon of Linguistics] <br /> <br /> ===References===<br /> *Kayne, R. 1984. ''Connectedness and binary branching.'' Dordrecht: Foris. <br /> *Spencer, A. 1991. ''Morphological Theory.'' Oxford: Blackwell.<br /> <br /> {{dc}}<br /> [[Category:Morphology]]<br /> [[Category:Syntax]]</div>

Luo