Localizing these pointer-valued features is straightforward, since during parsing, the HEAD and SEM HEAD of a node are automatically transferred to its mother node.
the syntactic and semantic head of a node only take Algorithm 1 Fine-grained rule extraction Input: HPSG tree/forest E f , foreign sentence F , and alignment A Output: a PAS-based rule set R1 and/or a tree-rule set R2 1: if E f is an HPSG tree then 2: E ′ f = localize Tree(E f ) 3: , F , A) ◃ composed rule extraction algorithm in (Galley et al., 2006) 6: else if E f is an HPSG forest then 7: E ′ f = localize Forest(E f ); 8: R2 = forest based rule extraction(E ′ f , F , A) ◃ Algorithm 1 in  9: end if the identifier of the daughter node as the values.