(b). Fig. 1. 2. Dependency structures. We fix alphabets W of terminals (words), C of ... lencies (a DV-structure) on x, if the following conditions are satisfied : ..... 7 Modification and ordering rules are simulated by rules π → A, where π is a D-tree.
! " #$%%&'#( #) *+!,,---# #( #),),+,+ , %%&,
++ -* * . & */* * 0 . & # / *& + /* / ( / / . * + -* * . ) . .& *& - %& 1( )(/ + . . / * (+2 + & / -* / + #
!
" # $ %&' %()' %(*' $ %+' $ # , - %(.' %('
/ 0 # 1 2 %()'3 4 .* 56 - 7 8 , Æ $
0
Æ " 4 4 " " %(9' $ " 1 :/
: ; %( ! , * * +# * * 34 > ? ! * $D( * ) + * / * + -* * /# ;#
5 8
"7
, $
" , . 13 13 13 D * " 1?3 , . 13 , .13 J " " " 2 $ 1 D 1 33 1 3 B B 1
3 Æ
@
, $ & 1 3 D ¼ ¼
¼ ' '
& 1 3
F 0 / .& -* $( -* *
,
!
,
34
34
34 /# #
, < , . 8 1
" 3 4 , ) &1 3 D ( "
#
"
¼ ¼ 1 ¼ 3
" Æ
,
1 3
,
,
!
34
34
34 /# #
" " "
, . /
+)& * +) - + *
3 4
* # @ -34 > . 8* )(/ )-# * * * ) ) * ) : < -* ) ) . 7 . * , : < * ) * ) ! : < 3 4 -* > 3 4 ) : < : 3 4 ) 34 > & ) . 7! . * * ! 354 > A -* A > : A A < -* & / 3A 4 > 5 34 3A4 & ()# 8* - % 1 3 4 > 34 )- .& @ ; ) * ! : < > 3 4 > ¾
# " ( " 1 3
, 1 3 1 3
6 )- * ) 8* 5 ) /& 1( () $8(/ -* ) . > -34 -* %+/ ( / # * + ) * )( : < :
