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

\hrRankings for VenetoBruce.txt	4-25-2019	\pn

\cn4-25-2019, 11:46 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	Ident(high) + to -	Id(hi) + -
	Ident(ATR)	Id(ATR)
Stratum #2	*- + high in foot	*- + hi
Stratum #3	Ident(high) - to +	Id(hi) - +
\te\ke

\h1Tableaux
\ts5\ks
/kals-'et-i/	Id(hi) + -\dl	Id(ATR)	*- + hi	Id(hi) - +
\wsF\we kals-'it-i				*\sh
kals-'et-i			*!	\sh
kals-'et-e	*!	\sh	\sh	\sh
\te\ke
\ts5\ks
/kant-'e-si-mo/	Id(hi) + -\dl	Id(ATR)	*- + hi	Id(hi) - +
\wsF\we kant-'i-si-mo				*
kant-'i-si-mu				**!
kant-'e-si-mo			*!	\sh
kant-'e-se-mo	*!	\sh	\sh	\sh
\te\ke
\ts5\ks
/ 'orden-i/	Id(hi) + -\dl	Id(ATR)	*- + hi	Id(hi) - +
\wsF\we 'urdin-i				**\sh
'orden-i			*!	\sh
'urden-i			*!	*\sh
'ordin-i			*!	*\sh
'orden-e	*!	\sh	\sh	\sh
\te\ke
\ts5\ks
/ 'pErseg-i/	Id(hi) + -\dl	Id(ATR)	*- + hi	Id(hi) - +
\wsF\we 'pErseg-i			*	
'pErsig-i			*	*!
'pirsig-i		*!	\sh	**\sh
'pirseg-i		*!	*\sh	*\sh
'pErseg-e	*!	\sh	\sh	\sh
\te\ke
\ts5\ks
/ 'navig-o/	Id(hi) + -\dl	Id(ATR)	*- + hi	Id(hi) - +
\wsF\we 'navig-o		\sh	\sh	\sh
'naveg-o	*!	\sh	\sh	\sh
\te\ke
\ts5\ks
/e'zErsit-i/	Id(hi) + -\dl	Id(ATR)	*- + hi	Id(hi) - +
\wsF\we e'zErsit-i			*\sh	\sh
e'zirsit-i		*!	*\sh	*\sh
e'zErset-i	*!	\sh	*\sh	\sh
\te\ke
\ts5\ks
/la'vor-av-i/	Id(hi) + -\dl	Id(ATR)	*- + hi	Id(hi) - +
\wsF\we la'vor-av-i			*	\sh
la'vur-av-i			**!	*\sh
la'vur-iv-i		*!	*\sh	**\sh
la'vor-av-e	*!	\sh	\sh	\sh
\te\ke

\h1Status of Proposed Constraints:  Necessary or Unnecessary
\ts2
\ntConstraint	Status
Ident(high) + to -	Necessary
Ident(high) - to +	Necessary
Ident(ATR)	Necessary
*- + high in foot	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:
	Id(ATR) >> *- + hi
	*- + hi >> Id(hi) - +
	Id(hi) + - >> *- + hi

\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
/kals-'et-i/	*- + hi	Id(hi) - +
\wsF\we kals-'it-i		*
kals-'et-i	* 	
\te\ke
\ts3\ks
/kals-'et-i/	Id(hi) + -	Id(hi) - +
\wsF\we kals-'it-i		*
kals-'et-e	* 	
\te\ke
\ts3\ks
/kant-'e-si-mo/	*- + hi	Id(hi) - +
\wsF\we kant-'i-si-mo		*
kant-'e-si-mo	* 	
\te\ke
\ts3\ks
/kant-'e-si-mo/	Id(hi) + -	Id(hi) - +
\wsF\we kant-'i-si-mo		*
kant-'e-se-mo	* 	
\te\ke
\ts3\ks
/ 'orden-i/	*- + hi	Id(hi) - +
\wsF\we 'urdin-i		**
'orden-i	* 	
\te\ke
\ts3\ks
/ 'orden-i/	*- + hi	Id(hi) - +
\wsF\we 'urdin-i		**
'urden-i	* 	*
\te\ke
\ts3\ks
/ 'orden-i/	*- + hi	Id(hi) - +
\wsF\we 'urdin-i		**
'ordin-i	* 	*
\te\ke
\ts3\ks
/ 'orden-i/	Id(hi) + -	Id(hi) - +
\wsF\we 'urdin-i		**
'orden-e	* 	
\te\ke
\ts3\ks
/ 'pErseg-i/	Id(hi) + -	*- + hi
\wsF\we 'pErseg-i		*
'pErseg-e	* 	
\te\ke
\ts3\ks
/la'vor-av-i/	Id(hi) + -	*- + hi
\wsF\we la'vor-av-i		*
la'vor-av-e	* 	
\te\ke
