... tbrooted in εbdo for all alignments α of the children of taand tbdoβ(εa,εb) +=Pelem(ta|εa)Palign(α|εi)(i,j)∈αβ(εi,εj)end for end for end for end for end for The outer ... k1,l1 km,lmdoβ(εi,k,l)+= Porder(ρ|εi)mj=1β(εj,kj,lj)end for end for end for end for This algorithm has computational complexityO(|T |Nm+2), where m is the maximum ... sketched below: for all nodes εain source tree Tain bottom-up order do for all elementary trees tarooted in εado for all nodes εbin target tree Tbin bottom-up order do for all elementary...