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

\hrRankings for TurkishWithIyor.txt	4-04-2019	\pn

\cn4-04-2019, 9:17 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	Max(rd)	Max(rd)
Stratum #2	Agree back	Agr bk
	RoLo	RoLo
Stratum #3	Agree round	Agr rd
Stratum #4	No left(round)	No L(rd)
Stratum #5	Dep(+rd)	Dep(+rd)
\te\ke

\h1Tableaux
\ts7\ks
/[ o ] /	Max(rd)	RoLo\dl	Agr bk	Agr rd	No L(rd)	Dep(+rd)
\wsF\we [ o ]		*\sh	\sh	\sh	\sh	\sh
[ a ]	*!	\sh	\sh	\sh	\sh	\sh
\te\ke
\ts7\ks
/[ o ] A/	Max(rd)	RoLo\dl	Agr bk	Agr rd	No L(rd)	Dep(+rd)
\wsF\we [ o ] a		*		*\sh	\sh	\sh
[ o ] e		*	*!	*\sh	\sh	\sh
[ o ] o		**!	\sh	\sh	\sh	\sh
\te\ke
\ts7\ks
/[ o ] I/	Max(rd)	RoLo\dl	Agr bk	Agr rd	No L(rd)	Dep(+rd)
\wsF\we [ o ] u		*			\sh	\sh
[ o ] i-		*		*!	\sh	\sh
[ o ] i		*	*!	*\sh	\sh	\sh
\te\ke
\ts7\ks
/[ o ] I yor/	Max(rd)	RoLo\dl	Agr bk	Agr rd	No L(rd)	Dep(+rd)
\wsF\we [ o ] u yor		**			*\sh	*\sh
[ o ] i- yor		**		*!*	\sh	\sh
\te\ke
\ts7\ks
/[ a ] I yor/	Max(rd)	RoLo\dl	Agr bk	Agr rd	No L(rd)	Dep(+rd)
\wsF\we [ a ] i- yor		*		*		\sh
[a ] u yor		*		*	*!	*\sh
\te\ke
\ts7\ks
/[ e ] I yor/	Max(rd)	RoLo\dl	Agr bk	Agr rd	No L(rd)	Dep(+rd)
\wsF\we [ e ] i yor		*	*	*		\sh
[ e ] u yor		*	*	*	*!	*\sh
[ e ] U yor		*	*	*	*!	*\sh
[ e ] i yer	*!	\sh	\sh	\sh	\sh	\sh
\te\ke
\ts7\ks
/[ u ] I a/	Max(rd)	RoLo\dl	Agr bk	Agr rd	No L(rd)	Dep(+rd)
\wsF\we [ u ] u a				*		*\sh
[ u ] i- a				*	*!	\sh
\te\ke

\h1Status of Proposed Constraints:  Necessary or Unnecessary
\ts2
\ntConstraint	Status
Agree back	Necessary
Agree round	Necessary
RoLo	Necessary
Max(rd)	Necessary
No left(round)	Necessary
Dep(+rd)	Not necessary (but included to show Faithfulness violations of a winning candidate)
\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
Original set of ERCs
\ks
\ts3
\ntIndex	ERC	Reason
1	eeeLWe	for /[ o ] /, [ o ] >> [ a ]
2	eLeWee	for /[ o ] A/, [ o ] a >> [ o ] o
3	eWLeeL	for /[ o ] I yor/, [ o ] u yor >> [ o ] i- yor
4	LLeLWe	for /[ e ] I yor/, [ e ] i yor >> [ e ] i yer
5	eeLeeW	for /[ u ] I a/, [ u ] u a >> [ u ] i- a
\te\ke
Recursive ranking search

Recursive search has now reached this location in the search tree:  1

	Fusion of this ERC set is:  
		LLLLWL
   The following ERCs form the total information-loss residue:
		ELEWEE
		EWLEEL
		EELEEW

	Fusion of total residue:
		ELLWEL

	Skeletal basis of the fusion:
		LEELWE

	LEELWE includes at least one L and thus is not entailed by ELLWEL.
	Thus it may be retained in the Skeletal Basis of ERCs.

Recursive search has now reached this location in the search tree:  1, 5
Current set of ERCs is based on constraint #5, Max(rd)
Working with the following ERC set:
		ELEWEE
		EWLEEL
		EELEEW

	Fusion of this ERC set is:  
		ELLWEL
   The following ERCs form the total information-loss residue:
		EWLEEL
		EELEEW

	Fusion of total residue:
		EWLEEL

	Skeletal basis of the fusion:
		ELEWEE

	ELEWEE includes at least one L and thus is not entailed by EWLEEL.
	Thus it may be retained in the Skeletal Basis of ERCs.

Recursive search has now reached this location in the search tree:  1, 5, 4
Current set of ERCs is based on constraint #4, RoLo
Working with the following ERC set:
		EWLEEL
		EELEEW

	Fusion of this ERC set is:  
		EWLEEL
   The following ERCs form the total information-loss residue:
		EELEEW

	Fusion of total residue:
		EELEEW

	Skeletal basis of the fusion:
		EWEEEL

	EWEEEL includes at least one L and thus is not entailed by EELEEW.
	Thus it may be retained in the Skeletal Basis of ERCs.

Recursive search has now reached this location in the search tree:  1, 5, 4, 2
Current set of ERCs is based on constraint #2, Agr rd
Working with the following ERC set:
		EELEEW

	Fusion of this ERC set is:  
		EELEEW
   The following ERCs form the total information-loss residue:


	EELEEW has a null residue and thus may be retained in the Skeletal Basis of ERCs.

\h1Ranking argumentation:  Final result
The following set of ERCs forms the Skeletal Basis for the ERC set as a whole, and thus encapsulates the available ranking information.
	LEELWE
	ELEWEE
	EWEEEL
	EELEEW
The final rankings obtained are as follows:
	Max(rd) >> { Agr bk, RoLo }
	RoLo >> Agr rd
	Agr rd >> No L(rd)
	No L(rd) >> Dep(+rd)

\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
/[ o ] /	Max(rd)	RoLo
\wsF\we [ o ]		*
[ a ]	* 	
\te\ke
\ts3\ks
/[ o ] A/	RoLo	Agr rd
\wsF\we [ o ] a	*	*
[ o ] o	** 	
\te\ke
\ts5\ks
/[ o ] I yor/	RoLo	Agr rd	No L(rd)	Dep(+rd)
\wsF\we [ o ] u yor	**		*	*
[ o ] i- yor	**	* *		
\te\ke
\ts5\ks
/[ e ] I yor/	Max(rd)	RoLo\dl	Agr bk	Agr rd
\wsF\we [ e ] i yor		*	*	*
[ e ] i yer	* 			
\te\ke
\ts4\ks
/[ u ] I a/	Agr rd	No L(rd)	Dep(+rd)
\wsF\we [ u ] u a	*		*
[ u ] i- a	*	* 	
\te\ke
