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

\hrRankings for JohoreMalayMcCarthy2004.txt	4-18-2019	\pn

\cn4-18-2019, 11:32 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	FthHdSp(+nasal)	FthHdSp(+nasal)
	Head(nasal)	Head(nasal)
	Head(p)	Head(p)
	Head is initial	Head is initial
Stratum #2	*A-Span(F)	*A-Span(F)
Stratum #3	*A	*A
\te\ke

\h1Tableaux
\ts7\ks
/ana/	FthHdSp(+nasal)\dl	Head(nasal)\dl	Head(p)\dl	Head is initial	*A-Span(F)	*A
\wsF\we [a_][n_A]					*\sh	*\sh
[an_a]				*!	\sh	\sh
[An_A]				*!	\sh	*\sh
[An_][a]				*!	*\sh	*\sh
[a_na]		*!	\sh	\sh	\sh	\sh
[A_n][a]		*!	\sh	\sh	*\sh	*\sh
[ada]	*!	\sh	\sh	\sh	\sh	\sh
\te\ke
\ts7\ks
/anawa/	FthHdSp(+nasal)\dl	Head(nasal)\dl	Head(p)\dl	Head is initial	*A-Span(F)	*A
\wsF\we [a][nAWA]					*	**\sh
[a][nA][wa]					**!	*\sh
[a][nAW][a]					**!	*\sh
\te\ke
\ts7\ks
/anapa/	FthHdSp(+nasal)\dl	Head(nasal)\dl	Head(p)\dl	Head is initial	*A-Span(F)	*A
\wsF\we [a][n_A][pa]					**\sh	*\sh
[a][n_][ap_a]				*!	**\sh	\sh
[a][n_ApA]			*!	\sh	*\sh	**\sh
[a][n_][a_pa]			*!	\sh	**\sh	\sh
\te\ke
\ts7\ks
/A/	FthHdSp(+nasal)\dl	Head(nasal)\dl	Head(p)\dl	Head is initial	*A-Span(F)	*A
\wsF\we [a]						
[A]						*!
\te\ke
\ts7\ks
/Ana/	FthHdSp(+nasal)\dl	Head(nasal)\dl	Head(p)\dl	Head is initial	*A-Span(F)	*A
\wsF\we [a][nA]					*	*
[A_][n_A]					*	**!
[A_][n_A]					*	**!
[An_A]				*!	\sh	**\sh
[An_][a]				*!	*\sh	*\sh
[A_nA]		*!	\sh	\sh	\sh	\sh
[A_n][a]		*!	\sh	\sh	*\sh	*\sh
\te\ke
\ts7\ks
/aW/	FthHdSp(+nasal)\dl	Head(nasal)\dl	Head(p)\dl	Head is initial	*A-Span(F)	*A
\wsF\we [aw]						
[A_ W]						*!
[a][W]					*!	\sh
\te\ke

\h1Status of Proposed Constraints:  Necessary or Unnecessary
\ts2
\ntConstraint	Status
*A-Span(F)	Necessary
FthHdSp(+nasal)	Necessary
Head(nasal)	Necessary
Head(p)	Necessary
Head is initial	Necessary
*A	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:
	Head is initial >> *A-Span(F)
	*A-Span(F) >> *A
	Head(p) >> *A-Span(F)
	Head(nasal) >> *A-Span(F)
	FthHdSp(+nasal) >> *A-Span(F)

\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.
\ts4\ks
/ana/	Head(nasal)	*A-Span(F)	*A
\wsF\we [a_][n_A]		*	*
[a_na]	* 		
\te\ke
\ts4\ks
/ana/	Head is initial	*A-Span(F)	*A
\wsF\we [a_][n_A]		*	*
[an_a]	* 		
\te\ke
\ts4\ks
/ana/	FthHdSp(+nasal)	*A-Span(F)	*A
\wsF\we [a_][n_A]		*	*
[ada]	* 		
\te\ke
\ts4\ks
/ana/	Head is initial	*A-Span(F)	*A
\wsF\we [a_][n_A]		*	*
[An_A]	* 		*
\te\ke
\ts3\ks
/anawa/	*A-Span(F)	*A
\wsF\we [a][nAWA]	*	**
[a][nA][wa]	** 	*
\te\ke
\ts3\ks
/anawa/	*A-Span(F)	*A
\wsF\we [a][nAWA]	*	**
[a][nAW][a]	** 	*
\te\ke
\ts4\ks
/anapa/	Head(p)	*A-Span(F)	*A
\wsF\we [a][n_A][pa]		**	*
[a][n_][a_pa]	* 	**	
\te\ke
\ts4\ks
/anapa/	Head is initial	*A-Span(F)	*A
\wsF\we [a][n_A][pa]		**	*
[a][n_][ap_a]	* 	**	
\te\ke
\ts4\ks
/Ana/	Head(nasal)	*A-Span(F)	*A
\wsF\we [a][nA]		*	*
[A_nA]	* 		
\te\ke
