According to this assumption, the score function Score(⟨t, t ′ ⟩) is high when the source elementary tree t matches incorrect parse trees and the target elementary tree t ′ matches correct parse trees.
sTsG rules with high scores are regarded to be useful for error correction.