Language & Optimality, 0440949, Andreas van Cranenburgh

3. Given the system of constraints {FAITH , ONSET, NOCODA}, what is the optimal analysis
   for the input /tatata/? Why is the result independent on the ranking of the constraints?

- The optimal analysis would be "ta.ta.ta"
This way all syllables have an onset and no coda, thus the mapping is completely faithful. Because all constraints are satisfied order does not matter.

4. Assume the ranking FAITH >> ONSET, NOCODA. What is the optimal analysis for
   /cmerikc/? And what is the optimal analysis if we assume Senufo’s ranking NOCODA, ONSET >>
   FAITH?

- The optimal analysis would be .@.me.ri.k@

			FAITH	ONSET, NOCODA
 --->	.@.me.ri.k@		*
	<@>.me.ri.k@	*	*
	.[]@.me.ri.k@	*	
	.@m.e.ri.k@		**	*
	....

- Under NOCODA, ONSET >> FAITH:

			NOCODA, ONSET	FAITH
 --->	.[]@.me.ri.k@			*
	.@.me.ri.k@		*
	<@>.me.ri.k@		*	*
	.@m.e.ri.k@	*	**
	.@m.er.ik.@	*	**
	....