Language & Optimality, 0440949, Andreas van Cranenburgh

9.
			NoONSET	ONSET,	NOCODA
 -->	ho.(te'l)			*
	hot.(e'l)		*	*
	ho.<t>.(e'l)		*	*
	<h>.o.(te'l)		*	*
	ho.(<t>.e'l)		*	*
	[...]

			ROOT,	WSP	TROCH	PARSE SYLL
-->	ho.(te'l)
	hot.(e'l)		*	
	ho.<t>.(e'l)				*
	<h>.o.(te'l)				*
	ho.(<t>.e'l)			*
	[...]


			NoONSET	ONSET,	NOCODA
-->	(va'n).it.y		**	*
-->	(va'n.it).y		**	*
	(va'.ni).ty	*
	(va'.nit).y	*	*	*
	(va').ni.ty	*	
	(va').nit.y	*	*	*
	[...]

			ROOT,	WSP	TROCH	PARSE SYLL
-->	(va'.ni).ty		
	(va'n.it).y	
	(va'.nit).y		*
	(va').ni.ty				*
	(va'n).it.y				*
	(va').nit.y		*		*
	[...]

10.
(A)
bab -> [GEN .O. OnSet] ->

page 11:
O[b]N[a]O[b]N[]
O[b]N[a]X[b]
O[b]N[a]X[b]D[]
O[b]N[a]D[]X[b]
O[b]N[a]D[b]
X[b]O[]N[a]X[b]
X[b]O[][a]D[b]

 [ .O. MaxIO] -->
O[b]N[a]O[b]N[]
O[b]N[a]D[b]

 [ .O. DepIO] -->
O[b]N[a]D[b]

 [ .O. NoCoda] -->
O[b]N[a]D[b]


(B)
bab -> [GEN .O. NoCoda] ->
X[b]N[a]N[]X[b]	O[]X[b]N[a]X[b] 
X[b]N[a]O[b]N[]	O[b]N[a]N[]X[b] 
X[b]N[a]X[b]	O[b]N[a]O[b]N[]
X[b]N[a]X[b]N[]	O[b]N[a]X[b]
X[b]N[]N[a]X[b]	O[b]N[a]X[b]N[]
X[b]O[]N[a]X[b]	O[b]N[]N[a]X[b]
N[]X[b]N[a]X[b]	N[]O[b]N[a]X[b]

 [ .O. OnSet] ->
O[]X[b]N[a]X[b] 
O[b]N[a]N[]X[b] 
O[b]N[a]O[b]N[]
O[b]N[a]X[b]
O[b]N[a]X[b]N[]
O[b]N[]N[a]X[b]
N[]O[b]N[a]X[b]

 [ .O. MaxIO] ->
O[b]N[a]O[b]N[]

 [ .O. DepIO] -->
O[b]N[a]O[b]N[]

11.
A possible phonetic realization would be eg. [ba.b@], 
where N[] is realized as a schwa.

If the filter is run in the opposite direction ambiguities arise, eg.
the schwa could have been part of the original input instead of arising out
of N[].

For interpretive optimization the phonetic filter should be part of the
generator, followed by the inverted constraints:

PhonFilter
.o.
CandStruc
.O.
DepIO
.O.
MaxIO
.O.
Onset
.O.
NoCoda