Since we assume that the structures of parse trees of s and t are determined by a parser, the values of γ s m,n,i and γ t m,n,i are fixed.
by traversing the parse tree in a bottomup manner, we can identify an LCA (i.e., τ i ) for phrases τ m and τ n while simultaneously computing γ m,n,i .