In this paper we present a scheme for annotating anaphoric relations in the Hindi Dependency Tree-Bank.
it is computationally efficient to annotate the referent of NP6 as NP4 rather than NP1 since it is more nearer to NP6, hence reducing the search space.