\ti\ftResults of Applying Recursive Constraint Demotion to Warlpiri.txt

\hrRankings for Warlpiri.txt	5-16-2019	\pn

\cn5-16-2019, 10:07 a.m.

\cnOTSoft 2.5
\cnRelease date 1/17/2017


\h1Result
A ranking was found that generates the correct outputs.
\ks
\ts3
\ntStratum	Constraint Name	Abbreviation
Stratum #1	*New Pi	*New Pi
	Ident(+ to -) in RNU	Ident(+ to -) in RNU
	*i u in RNU	*i u in RNU
Stratum #2	Ident(-B to +B)	Ident(-B to +B)
Stratum #3	*i u	*i u
Stratum #4	Ident(+B to -B)	Ident(+B to -B)
Stratum #5	Agree(back) in high	Agree(back) in high
\te\ke

\h1Tableaux
\ts8\ks
/itu RB/	*New Pi\dl	Ident(+ to -) in RNU\dl	*i u in RNU	Ident(-B to +B)	*i u	Ident(+B to -B)	Agree(back) in high
\wsF\we iti						*\sh	\sh
itu					*!	\sh	*\sh
utu				*!	\sh	\sh	\sh
\te\ke
\ts8\ks
/ipu/	*New Pi\dl	Ident(+ to -) in RNU\dl	*i u in RNU	Ident(-B to +B)	*i u	Ident(+B to -B)	Agree(back) in high
\wsF\we ipu					*\sh	\sh	*\sh
upu				*!	\sh	\sh	\sh
ipi	*!	\sh	\sh	\sh	\sh	*\sh	\sh
\te\ke
\ts8\ks
/pi/	*New Pi\dl	Ident(+ to -) in RNU\dl	*i u in RNU	Ident(-B to +B)	*i u	Ident(+B to -B)	Agree(back) in high
\wsF\we pi					\sh	\sh	\sh
pu				*!	\sh	\sh	\sh
\te\ke
\ts8\ks
/uti/	*New Pi\dl	Ident(+ to -) in RNU\dl	*i u in RNU	Ident(-B to +B)	*i u	Ident(+B to -B)	Agree(back) in high
\wsF\we uti							*\sh
iti						*!	\sh
utu				*!	\sh	\sh	\sh
\te\ke
\ts8\ks
/[ i ] - u - u/	*New Pi\dl	Ident(+ to -) in RNU\dl	*i u in RNU	Ident(-B to +B)	*i u	Ident(+B to -B)	Agree(back) in high
\wsF\we [ i ] - i - i						**\sh	\sh
[ i ] - u - u					*!	\sh	*\sh
[ u ] - u - u				*!	\sh	\sh	\sh
\te\ke
\ts8\ks
/[ i ] - pu/	*New Pi\dl	Ident(+ to -) in RNU\dl	*i u in RNU	Ident(-B to +B)	*i u	Ident(+B to -B)	Agree(back) in high
\wsF\we [ i ] - pu					*\sh	\sh	*\sh
[ u ] - pu				*!	\sh	\sh	\sh
[ i ] - pi	*!	\sh	\sh	\sh	\sh	*\sh	\sh
\te\ke
\ts8\ks
/[ i ] - a - u/	*New Pi\dl	Ident(+ to -) in RNU\dl	*i u in RNU	Ident(-B to +B)	*i u	Ident(+B to -B)	Agree(back) in high
\wsF\we [ i ] - a - u							\sh
[ i ] - a  - i						*!	\sh
\te\ke
\ts8\ks
/[ u ] - i /	*New Pi\dl	Ident(+ to -) in RNU\dl	*i u in RNU	Ident(-B to +B)	*i u	Ident(+B to -B)	Agree(back) in high
\wsF\we [ u ] - i							*\sh
[ i ] - i						*!	\sh
[ u ] - u				*!	\sh	\sh	\sh
\te\ke
\ts8\ks
/"[ u ] - { i, u }"/	*New Pi\dl	Ident(+ to -) in RNU\dl	*i u in RNU	Ident(-B to +B)	*i u	Ident(+B to -B)	Agree(back) in high
\wsF\we [ u ] - u							
[ u ] - i							*!
[ i ] - i						*!	\sh
\te\ke
\ts8\ks
/[ a i i ] - rnu SPECIAL/	*New Pi\dl	Ident(+ to -) in RNU\dl	*i u in RNU	Ident(-B to +B)	*i u	Ident(+B to -B)	Agree(back) in high
\wsF\we [ a u u ] - rnu				**\sh	\sh	\sh	\sh
[ a i i ] - rnu			*!	\sh	*\sh	\sh	*\sh
[ a i u ] - rnu			*!	*\sh	*\sh	\sh	*\sh
[ a i i ] - rni		*!	\sh	\sh	\sh	*\sh	\sh
\te\ke

\h1Status of Proposed Constraints:  Necessary or Unnecessary
\ts2
\ntConstraint	Status
*New Pi	Necessary
Ident(+ to -) in RNU	Necessary
Ident(-B to +B)	Necessary
*i u	Necessary
*i u in RNU	Necessary
Ident(+B to -B)	Necessary
Agree(back) in high	Necessary
\te
\ks

\h1Ranking Arguments, based on the Fusional Reduction Algorithm
This run sought to obtain the Skeletal Basis, intended to keep each final ranking argument as pithy as possible.
\ke
The final rankings obtained are as follows:
	*i u in RNU >> Ident(-B to +B)
	Ident(-B to +B) >> *i u
	*i u >> Ident(+B to -B)
	Ident(+B to -B) >> Agree(back) in high
	Ident(+ to -) in RNU >> Ident(-B to +B)
	*New Pi >> *i u

\h1Mini-Tableaux
The following small tableaux may be useful in presenting ranking arguments. They include all winner-rival comparisons in which there is just one winner-preferring constraint and at least one loser-preferring constraint.  Constraints not violated by either candidate are omitted.
\ts3\ks
/itu RB/	Ident(-B to +B)	Ident(+B to -B)
\wsF\we iti		*
utu	* 	
\te\ke
\ts4\ks
/ipu/	Ident(-B to +B)	*i u	Agree(back) in high
\wsF\we ipu		*	*
upu	* 		
\te\ke
\ts3\ks
/uti/	Ident(-B to +B)	Agree(back) in high
\wsF\we uti		*
utu	* 	
\te\ke
\ts3\ks
/uti/	Ident(+B to -B)	Agree(back) in high
\wsF\we uti		*
iti	* 	
\te\ke
\ts3\ks
/[ i ] - u - u/	Ident(-B to +B)	Ident(+B to -B)
\wsF\we [ i ] - i - i		**
[ u ] - u - u	* 	
\te\ke
\ts4\ks
/[ i ] - pu/	Ident(-B to +B)	*i u	Agree(back) in high
\wsF\we [ i ] - pu		*	*
[ u ] - pu	* 		
\te\ke
\ts3\ks
/[ u ] - i /	Ident(-B to +B)	Agree(back) in high
\wsF\we [ u ] - i		*
[ u ] - u	* 	
\te\ke
\ts3\ks
/[ u ] - i /	Ident(+B to -B)	Agree(back) in high
\wsF\we [ u ] - i		*
[ i ] - i	* 	
\te\ke
