Najamba Tableaux | Laura McPherson

Results of Applying Recursive Constraint Demotion to Najamba_tableaux_final.txt

10-22-2014, 10:25 a.m.

OTSoft 2.3.1, release date 2/14/2011

1. Result

A ranking was found that generates the correct outputs.

Stratum	Constraint Name	Abbreviation
Stratum #1	Ident-Phase(T)/Lex	Id-Phase(T)/Lex
	Ident-Phase(T)	Id-Phase(T)
	Poss X.T	Poss X.T
	*Self-Control	*SC
	Linearity	Linearity
Stratum #2	X.L Adj	X.L Adj
	X.L Dem	X.L Dem
Stratum #3	Ident(T)	Id(T)
Stratum #4	X.L Num/Poss	X.L Num/Poss

2. Tableaux

/PossANonP N/:	Id-Phase(T)/Lex	Id-Phase(T)	Poss X.T	*SC	Linearity	X.L Adj	X.L Dem	Id(T)	X.L Num/Poss
☞ PossANonP N.T								*
PossANonP N			*!
PossANonP.T N	*!	*		*				*
PossANonP.T N.T	*!	*		*				**

/PossP N/:	Id-Phase(T)/Lex	Id-Phase(T)	Poss X.T	*SC	Linearity	X.L Adj	X.L Dem	Id(T)	X.L Num/Poss
☞ PossP N.T								*
PossP N			*!
PossP.T N		*!		*				*
PossP.T N.T		*!		*				**

/N PossAP/:	Id-Phase(T)/Lex	Id-Phase(T)	Poss X.T	*SC	Linearity	X.L Adj	X.L Dem	Id(T)	X.L Num/Poss
☞ N PossAP
N.T PossAP								*!
N PossAP.T	*!	*						*

/N Adj/:	Id-Phase(T)/Lex	Id-Phase(T)	Poss X.T	*SC	Linearity	X.L Adj	X.L Dem	Id(T)	X.L Num/Poss
☞ N.L Adj								*
N Adj						*!
N Adj.L				*!				*
N.L Adj.L				*!				**

/N Adj Adj/:	Id-Phase(T)/Lex	Id-Phase(T)	Poss X.T	*SC	Linearity	X.L Adj	X.L Dem	Id(T)	X.L Num/Poss
☞ N.L Adj.L Adj						*		**
N.L Adj Adj						**!		*
N Adj Adj						*!
N.L Adj.L Adj.L				*!				***
N Adj.L Adj.L				!				**

/N Num/:	Id-Phase(T)/Lex	Id-Phase(T)	Poss X.T	*SC	Linearity	X.L Adj	X.L Dem	Id(T)	X.L Num/Poss
☞ N Num
N.L Num								*!
N Num.L								*!
N.L Num.L								!

/N Dem/:	Id-Phase(T)/Lex	Id-Phase(T)	Poss X.T	*SC	Linearity	X.L Adj	X.L Dem	Id(T)	X.L Num/Poss
☞ N.L Dem								*
N Dem							*!
N Dem.L				*!				*
N.L Dem.L				*!				**

/N Adj Dem/:	Id-Phase(T)/Lex	Id-Phase(T)	Poss X.T	*SC	Linearity	X.L Adj	X.L Dem	Id(T)	X.L Num/Poss
☞ N.L Adj.L Dem								**
N.L Adj Dem							!	*
N Adj Dem						*!	**
N.L Adj.L Dem.L				*!				***
N Adj.L Dem.L				!				**

/N Num Dem/:	Id-Phase(T)/Lex	Id-Phase(T)	Poss X.T	*SC	Linearity	X.L Adj	X.L Dem	Id(T)	X.L Num/Poss
☞ N.L Num.L Dem								**
N Num.L Dem							*!	*
N Num Dem							!
N.L Num Dem					*!		*	*
N Num Dem.L				*!				*
N Num.L Dem.L				*!				**
N.L Num.L Dem.L				*!				***

/PossNonP N Adj/:	Id-Phase(T)/Lex	Id-Phase(T)	Poss X.T	*SC	Linearity	X.L Adj	X.L Dem	Id(T)	X.L Num/Poss
☞ PossNonP N.T Adj.T								**
PossNonP N.T Adj			*!			*		*
PossNonP N.L Adj.T			*!		*			**
PossNonP N.T Adj.L			*!	*				**
PossNonP N.T Adj.L			*!	*				**
PossNonP N.L Adj			!					*
PossNonP N Adj			!			*
PossNonP.T N.T Adj.T	*!	*		*				***

/PossP N Adj/:	Id-Phase(T)/Lex	Id-Phase(T)	Poss X.T	*SC	Linearity	X.L Adj	X.L Dem	Id(T)	X.L Num/Poss
☞ PossP N.T Adj.T								**
PossP N.T Adj			*!			*		*
PossP N.L Adj.T			*!		*			**
PossP N.T Adj.L			*!	*				**
PossP N.T Adj.L			*!	*				**
PossP N.L Adj			!					*
PossP N Adj			!			*
PossP.T N.T Adj.T		*!		*				***

/N Adj PossAP/:	Id-Phase(T)/Lex	Id-Phase(T)	Poss X.T	*SC	Linearity	X.L Adj	X.L Dem	Id(T)	X.L Num/Poss
☞ N.L Adj PossAP								*
N Adj PossAP						*!
N Adj.L PossAP				*!				*
N.L Adj.L PossAP				*!				**
N Adj PossAP.L	*!	*				*		*

/PossNonP N Dem/:	Id-Phase(T)/Lex	Id-Phase(T)	Poss X.T	*SC	Linearity	X.L Adj	X.L Dem	Id(T)	X.L Num/Poss
☞ PossNonP N.T Dem							**	*
PossNonP N.T Dem.L				*!				**
PossNonP N.L Dem			*!				*	*
PossNonP N Dem			*!				**
PossNonP N.L Dem.L			*!	*				**
PossNonP.L N.L Dem	*!	*						**
PossNonP.L N.T Dem	*!	*			*		*	**
PossNonP.L N.L Dem.L	*!	*		*				***
PossNonP.T N.T Dem	*!	*		*			**	**
PossNonP.T N.T Dem.L	*!	*		**				***
PossNonP.T N.L Dem.L	*!	*		**				***

/PossP N Dem/:	Id-Phase(T)/Lex	Id-Phase(T)	Poss X.T	*SC	Linearity	X.L Adj	X.L Dem	Id(T)	X.L Num/Poss
☞ PossP N.T Dem							**	*
PossP N.T Dem.L				*!				**
PossP N.TL Dem.L				*!				**
PossP N.L Dem			*!				*	*
PossP N Dem			*!				**
PossP N.L Dem.L			*!	*				**
PossP.L N.L Dem		*!						**
PossP.L N.T Dem		*!			*		*	**
PossP.L N.L Dem.L		*!		*				***
PossP.T N.T Dem		*!		*			**	**
PossP.T N.T Dem.L		*!		**				***
PossP.T N.L Dem.L	*!	*		**				***

/N PossAP Dem/:	Id-Phase(T)/Lex	Id-Phase(T)	Poss X.T	*SC	Linearity	X.L Adj	X.L Dem	Id(T)	X.L Num/Poss
☞ N PossAP Dem							**
N.L PossAP Dem					*!		*	*
N PossAP Dem.L				*!				*
N.L PossAP Dem.L				*!	*			**
N.L PossAP.L Dem	*!	*						**
N.L PossAP.L Dem.L	*!	*		*				***

/PossNonP N Num/:	Id-Phase(T)/Lex	Id-Phase(T)	Poss X.T	*SC	Linearity	X.L Adj	X.L Dem	Id(T)	X.L Num/Poss
☞ PossNonP N.T Num.T								**
PossNonP N.T Num			*!					*	*
PossNonP N Num.T			*!		*			*
PossNonP N.L Num.T			*!		*			**
PossNonP N.T Num.L			*!	*				**
PossNonP N Num			!						*
PossNonP N.L Num			!					*
PossNonP N Num.L			!	*				*
PossNonP N.L Num.L			!	*				**
PossNonP.T N.T Num.T	*!	*		*				***

/PossP N Num/:	Id-Phase(T)/Lex	Id-Phase(T)	Poss X.T	*SC	Linearity	X.L Adj	X.L Dem	Id(T)	X.L Num/Poss
☞ PossP N.T Num.T								**
PossP N.T Num			*!					*	*
PossP N.L Num.T			*!					**
PossP N Num.T			*!		*			*
PossP N.T Num.L			*!	*				**
PossP N Num			!						*
PossP N.L Num			!					*
PossP N Num.L			!	*				*
PossP N.L Num.L			!	*				**
PossP.T N.T Num.T		*!		*				***

/N Adj PossAP/:	Id-Phase(T)/Lex	Id-Phase(T)	Poss X.T	*SC	Linearity	X.L Adj	X.L Dem	Id(T)	X.L Num/Poss
☞ N Num PossAP									*
N.L Num PossAP								*!
N Num.L PossAP				*!				*
N.L Num.L PossAP				*!				**
N Num PossAP.L	*!	*						*	*

/N Adj Num/:	Id-Phase(T)/Lex	Id-Phase(T)	Poss X.T	*SC	Linearity	X.L Adj	X.L Dem	Id(T)	X.L Num/Poss
☞ N.L Adj Num								*
N Adj Num						*!
N Adj Num.L						*!		*
N Adj.L Num				*!				*
N.L Adj.L Num				*!				**

3. Status of Proposed Constraints: Necessary or Unnecessary

Constraint	Status
Ident(T)	Necessary
Ident-Phase(T)	Necessary
Poss X.T	Necessary
X.L Adj	Necessary
X.L Dem	Necessary
*Self-Control	Necessary
Linearity	Necessary
Ident-Phase(T)/Lex	Not necessary
X.L Num/Poss	Not necessary

A check has determined that the grammar will still work even if the constraints marked above as unnecessary are removed en masse.

4. Ranking 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.

The final rankings obtained are as follows:

Linearity >> X.L Dem

X.L Dem >> Id(T)

Id(T) >> X.L Num/Poss

X.L Adj >> Id(T)

*SC >> { X.L Adj, X.L Dem }

Poss X.T >> X.L Dem

Id-Phase(T) >> X.L Dem

5. Mini-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.

/PossANonP N/:	Poss X.T	Id(T)
☞ PossANonP N.T		*
PossANonP N	*

/PossP N/:	Poss X.T	Id(T)
☞ PossP N.T		*
PossP N	*

/N Adj/:	X.L Adj	Id(T)
☞ N.L Adj		*
N Adj	*

/N Adj Adj/:	X.L Adj	Id(T)
☞ N.L Adj.L Adj	*	**
N Adj Adj	** *

/N Adj Adj/:	X.L Adj	Id(T)
☞ N.L Adj.L Adj	*	**
N.L Adj Adj	**	*

/N Adj Adj/:	*SC	X.L Adj	Id(T)
☞ N.L Adj.L Adj		*	**
N Adj.L Adj.L	* *		**

/N Dem/:	X.L Dem	Id(T)
☞ N.L Dem		*
N Dem	*

/N Adj Dem/:	X.L Dem	Id(T)
☞ N.L Adj.L Dem		**
N.L Adj Dem	* *	*

/N Num Dem/:	X.L Dem	Id(T)
☞ N.L Num.L Dem		**
N Num Dem	* *

/N Num Dem/:	X.L Dem	Id(T)
☞ N.L Num.L Dem		**
N Num.L Dem	*	*

/N Num Dem/:	*SC	Id(T)
☞ N.L Num.L Dem		**
N Num Dem.L	*	*

/PossNonP N Adj/:	Poss X.T	Id(T)
☞ PossNonP N.T Adj.T		**
PossNonP N.L Adj	* *	*

/PossP N Adj/:	Poss X.T	Id(T)
☞ PossP N.T Adj.T		**
PossP N.L Adj	* *	*

/N Adj PossAP/:	X.L Adj	Id(T)
☞ N.L Adj PossAP		*
N Adj PossAP	*

/PossNonP N Dem/:	Poss X.T	X.L Dem	Id(T)
☞ PossNonP N.T Dem		**	*
PossNonP N Dem	*	**

/PossNonP N Dem/:	Poss X.T	X.L Dem	Id(T)
☞ PossNonP N.T Dem		**	*
PossNonP N.L Dem	*	*	*

/PossP N Dem/:	Poss X.T	X.L Dem	Id(T)
☞ PossP N.T Dem		**	*
PossP N Dem	*	**

/PossP N Dem/:	Poss X.T	X.L Dem	Id(T)
☞ PossP N.T Dem		**	*
PossP N.L Dem	*	*	*

/PossNonP N Num/:	Poss X.T	Id(T)
☞ PossNonP N.T Num.T		**
PossNonP N.L Num	* *	*

/PossP N Num/:	Poss X.T	Id(T)
☞ PossP N.T Num.T		**
PossP N.L Num	* *	*

/N Adj PossAP/:	Id(T)	X.L Num/Poss
☞ N Num PossAP		*
N.L Num PossAP	*

/N Adj Num/:	X.L Adj	Id(T)
☞ N.L Adj Num		*
N Adj Num	*

6. Hasse Diagram

The following Hasse diagram (in output folder at Najamba_tableaux_finalHasse.gif) summarizes the rankings obtained.