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

\hrRankings for KikuriaClass.txt	5-30-2019	\pn

\cn5-30-2019, 3:14 p.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	BeGood	BeGood
	Id low	Id low
	*Map(i E)	*Map(i E)
	*Map(E i)	*Map(E i)
	*i e	*i e
	*E i	*E i
	*E e	*E e
	Final(hi)	Final(hi)
Stratum #2	*Map(i e)	*Map(i e)
	*Map(E e)	*Map(E e)
Stratum #3	*Map(e E)	*Map(e E)
	*e i	*e i
Stratum #4	*Map(e i)	*Map(e i)
	*e E	*e E
\te\ke

\h1Tableaux
\ts15\ks
/e e i/	BeGood\dl	Id low\dl	*Map(i E)\dl	*Map(E i)\dl	*i e\dl	*E i\dl	*E e\dl	Final(hi)	*Map(i e)\dl	*Map(E e)	*Map(e E)\dl	*e i	*e E\dl	*Map(e i)
\wsF\we i i i													\sh	**\sh
e e i												*!	\sh	\sh
e i i												*!	\sh	*\sh
e e e								*!	*\sh	\sh	\sh	\sh	\sh	\sh
\te\ke
\ts15\ks
/e e a i/	BeGood\dl	Id low\dl	*Map(i E)\dl	*Map(E i)\dl	*i e\dl	*E i\dl	*E e\dl	Final(hi)	*Map(i e)\dl	*Map(E e)	*Map(e E)\dl	*e i	*e E\dl	*Map(e i)
\wsF\we e e a i														
i i a i														*!*
i i i i		*!	\sh	\sh	\sh	\sh	\sh	\sh	\sh	\sh	\sh	\sh	\sh	**\sh
\te\ke
\ts15\ks
/i e/	BeGood\dl	Id low\dl	*Map(i E)\dl	*Map(E i)\dl	*i e\dl	*E i\dl	*E e\dl	Final(hi)	*Map(i e)\dl	*Map(E e)	*Map(e E)\dl	*e i	*e E\dl	*Map(e i)
\wsF\we e e									*\sh	\sh	\sh	\sh	\sh	\sh
i i								*!	\sh	\sh	\sh	\sh	\sh	*\sh
i e					*!	\sh	\sh	\sh	\sh	\sh	\sh	\sh	\sh	\sh
\te\ke
\ts15\ks
/E i/	BeGood\dl	Id low\dl	*Map(i E)\dl	*Map(E i)\dl	*i e\dl	*E i\dl	*E e\dl	Final(hi)	*Map(i e)\dl	*Map(E e)	*Map(e E)\dl	*e i	*e E\dl	*Map(e i)
\wsF\we e i										*\sh	\sh	*\sh	\sh	\sh
e e									*!	*\sh	\sh	\sh	\sh	\sh
E e							*!	\sh	*\sh	\sh	\sh	\sh	\sh	\sh
E i						*!	\sh	\sh	\sh	\sh	\sh	\sh	\sh	\sh
i i				*!	\sh	\sh	\sh	\sh	\sh	\sh	\sh	\sh	\sh	\sh
E E			*!	\sh	\sh	\sh	\sh	\sh	\sh	\sh	\sh	\sh	\sh	\sh
\te\ke
\ts15\ks
/E e/	BeGood\dl	Id low\dl	*Map(i E)\dl	*Map(E i)\dl	*i e\dl	*E i\dl	*E e\dl	Final(hi)	*Map(i e)\dl	*Map(E e)	*Map(e E)\dl	*e i	*e E\dl	*Map(e i)
\wsF\we E E											*\sh	\sh	\sh	\sh
e e										*!	\sh	\sh	\sh	\sh
E e							*!	\sh	\sh	\sh	\sh	\sh	\sh	\sh
\te\ke
\ts15\ks
/E E i/	BeGood\dl	Id low\dl	*Map(i E)\dl	*Map(E i)\dl	*i e\dl	*E i\dl	*E e\dl	Final(hi)	*Map(i e)\dl	*Map(E e)	*Map(e E)\dl	*e i	*e E\dl	*Map(e i)
\wsF\we e e i										**\sh	\sh	*\sh	\sh	\sh
e e e									*!	**\sh	\sh	\sh	\sh	\sh
E e i							*!	\sh	\sh	*\sh	\sh	*\sh	\sh	\sh
E E i						*!	\sh	\sh	\sh	\sh	\sh	\sh	\sh	\sh
i i i				*!*	\sh	\sh	\sh	\sh	\sh	\sh	\sh	\sh	\sh	\sh
E E E			*!	\sh	\sh	\sh	\sh	\sh	\sh	\sh	\sh	\sh	\sh	\sh
\te\ke
\ts15\ks
/e E/	BeGood\dl	Id low\dl	*Map(i E)\dl	*Map(E i)\dl	*i e\dl	*E i\dl	*E e\dl	Final(hi)	*Map(i e)\dl	*Map(E e)	*Map(e E)\dl	*e i	*e E\dl	*Map(e i)
\wsF\we e E												\sh	*\sh	\sh
E E											*!	\sh	\sh	\sh
e e										*!	\sh	\sh	\sh	\sh
\te\ke
\ts15\ks
/E E e i/	BeGood\dl	Id low\dl	*Map(i E)\dl	*Map(E i)\dl	*i e\dl	*E i\dl	*E e\dl	Final(hi)	*Map(i e)\dl	*Map(E e)	*Map(e E)\dl	*e i	*e E\dl	*Map(e i)
\wsF\we e e i i									\sh	**\sh	\sh	*\sh	\sh	*\sh
e e e e								*!	*\sh	**\sh	\sh	\sh	\sh	\sh
E E e i							*!	\sh	\sh	\sh	\sh	*\sh	\sh	\sh
i i i i				*!*	\sh	\sh	\sh	\sh	\sh	\sh	\sh	\sh	\sh	*\sh
E E E E			*!	\sh	\sh	\sh	\sh	*\sh	\sh	\sh	*\sh	\sh	\sh	\sh
e e e i	*!	\sh	\sh	\sh	\sh	\sh	\sh	\sh	\sh	**\sh	\sh	*\sh	\sh	\sh
\te\ke

\h1Status of Proposed Constraints:  Necessary or Unnecessary
\ts2
\ntConstraint	Status
BeGood	Necessary
*Map(i e)	Necessary
*Map(i E)	Necessary
*Map(e E)	Necessary
*Map(e i)	Necessary
*Map(E i)	Necessary
*Map(E e)	Necessary
*e i	Necessary
*i e	Necessary
*E i	Necessary
*E e	Necessary
Final(hi)	Necessary
Id low	Not necessary
*e E	Not necessary
\te
A check has determined that the grammar will still work even if the constraints marked above as unnecessary are removed en masse.
\ks

\h1Ranking Arguments, based on the Fusional Reduction Algorithm
This run sought to obtain the Most Informative Basis, intended to minimize the set of final ranking arguments.
\ke
The final rankings obtained are as follows:
	Final(hi) >> { *Map(i e), *Map(e i), *e i }
	*Map(i e) >> { *Map(e i), *e i }
	*e i >> *Map(e i)
	*Map(e E) >> *e E
	*Map(E e) >> { *Map(e E), *e E }
	*E e >> { *Map(e E), *Map(e i), *Map(E e), *e E }
	*E i >> { *Map(e E), *Map(e i), *Map(E e), *e i, *e E }
	*i e >> { *Map(i e), *Map(e i), *e i }
	*Map(E i) >> { *Map(e E), *Map(e i), *Map(E e), *e i, *e E }
	*Map(i E) >> { *Map(e E), *Map(e i), *Map(E e), *e i, *e E }
	BeGood >> *Map(e i)

\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
/e e i/	*e i	*Map(e i)
\wsF\we i i i		**
e e i	* 	
\te\ke
\ts3\ks
/e e i/	*e i	*Map(e i)
\wsF\we i i i		**
e i i	* 	*
\te\ke
\ts3\ks
/i e/	*i e	*Map(i e)
\wsF\we e e		*
i e	* 	
\te\ke
\ts4\ks
/E i/	*E i	*Map(E e)	*e i
\wsF\we e i		*	*
E i	* 		
\te\ke
\ts4\ks
/E i/	*Map(i E)	*Map(E e)	*e i
\wsF\we e i		*	*
E E	* 		
\te\ke
\ts4\ks
/E i/	*Map(i e)\dl	*Map(E e)	*e i
\wsF\we e i		*	*
e e	* 	*	
\te\ke
\ts4\ks
/E i/	*Map(E i)	*Map(E e)	*e i
\wsF\we e i		*	*
i i	* 		
\te\ke
\ts3\ks
/E e/	*E e	*Map(e E)
\wsF\we E E		*
E e	* 	
\te\ke
\ts3\ks
/E e/	*Map(E e)	*Map(e E)
\wsF\we E E		*
e e	* 	
\te\ke
\ts4\ks
/E E i/	*E e	*Map(E e)	*e i
\wsF\we e e i		**	*
E e i	* 	*	*
\te\ke
\ts4\ks
/E E i/	*E i	*Map(E e)	*e i
\wsF\we e e i		**	*
E E i	* 		
\te\ke
\ts4\ks
/E E i/	*Map(E i)	*Map(E e)	*e i
\wsF\we e e i		**	*
i i i	* *		
\te\ke
\ts4\ks
/E E i/	*Map(i E)	*Map(E e)	*e i
\wsF\we e e i		**	*
E E E	* 		
\te\ke
\ts4\ks
/E E i/	*Map(i e)\dl	*Map(E e)	*e i
\wsF\we e e i		**	*
e e e	* 	**	
\te\ke
\ts3\ks
/e E/	*Map(E e)	*e E
\wsF\we e E		*
e e	* 	
\te\ke
\ts3\ks
/e E/	*Map(e E)	*e E
\wsF\we e E		*
E E	* 	
\te\ke
\ts5\ks
/E E e i/	BeGood	*Map(E e)	*e i	*Map(e i)
\wsF\we e e i i		**	*	*
e e e i	* 	**	*	
\te\ke
\ts5\ks
/E E e i/	*E e	*Map(E e)	*e i	*Map(e i)
\wsF\we e e i i		**	*	*
E E e i	* 		*	
\te\ke
\ts5\ks
/E E e i/	*Map(E i)	*Map(E e)	*e i	*Map(e i)
\wsF\we e e i i		**	*	*
i i i i	* *			*
\te\ke
\ks

\h1Hasse Diagram
The following Hasse diagram (in output folder at KikuriaClassHasse.gif) summarizes the rankings obtained.

\hf
\ke
