Using the GHKM algorithm ( Galley et al. 2004 ) , we can get two different STSG derivations from the two U-trees based on the fixed word alignment .
what’s in a translation rule
Michel Galley Mark Hopkins Kevin Knight Daniel Marcu
Obviously , towards an s-node for sampling , the two values of ` P would define two different U-trees . Using the GHKM algorithm ( Galley et al. 2004 ) , we can get two different STSG derivations from the two U-trees based on the fixed word alignment . Each derivation carries a set of STSG rules ( i.e. , minimal GHKM translation rules ) of its own .
Using the GHKM algorithm ( @@CITATION ) , we can get two different STSG derivations from the two U-trees based on the fixed word alignment .